Results 1  10
of
32
A Multivalued Logic Approach to Integrating Planning and Control
 Artificial Intelligence
, 1995
"... Intelligent agents embedded in a dynamic, uncertain environment should incorporate capabilities for both planned and reactive behavior. Many current solutions to this dual need focus on one aspect, and treat the other one as secondary. We propose an approach for integrating planning and control base ..."
Abstract

Cited by 106 (8 self)
 Add to MetaCart
Intelligent agents embedded in a dynamic, uncertain environment should incorporate capabilities for both planned and reactive behavior. Many current solutions to this dual need focus on one aspect, and treat the other one as secondary. We propose an approach for integrating planning and control based on behavior schemas, which link physical movements to abstract action descriptions. Behavior schemas describe behaviors of an agent, expressed as trajectories of control actions in an environment, and goals can be defined as predicates on these trajectories. Goals and behaviors can be combined to produce conjoint goals and complex controls. The ability of multivalued logics to represent graded preferences allows us to formulate tradeoffs in the combination. Two composition theorems relate complex controls to complex goals, and provide the key to using standard knowledgebased deliberation techniques to generate complex controllers. We report experiments in planning and execution on a mobi...
A Treatise on ManyValued Logics
 Studies in Logic and Computation
, 2001
"... The paper considers the fundamental notions of many valued logic together with some of the main trends of the recent development of infinite valued systems, often called mathematical fuzzy logics. Besides this logical approach also a more algebraic approach is discussed. And the paper ends with som ..."
Abstract

Cited by 52 (3 self)
 Add to MetaCart
The paper considers the fundamental notions of many valued logic together with some of the main trends of the recent development of infinite valued systems, often called mathematical fuzzy logics. Besides this logical approach also a more algebraic approach is discussed. And the paper ends with some hints toward applications which are based upon actual theoretical considerations about infinite valued logics. Key words: mathematical fuzzy logic, algebraic semantics, continuous tnorms, leftcontinuous tnorms, Pavelkastyle fuzzy logic, fuzzy set theory, nonmonotonic fuzzy reasoning 1 Basic ideas 1.1 From classical to manyvalued logic Logical systems in general are based on some formalized language which includes a notion of well formed formula, and then are determined either semantically or syntactically. That a logical system is semantically determined means that one has a notion of interpretation or model 1 in the sense that w.r.t. each such interpretation every well formed formula has some (truth) value or represents a function into
What is a Forest? On the vagueness of certain geographic concepts
 Topoi
, 2002
"... The paper examines ways in which the meanings of geographical concepts are affected by the phenomenon of vagueness. A logical analysis based on the theory of supervaluation semantics is developed and employed to describe differences and logical dependencies between different senses of vague concepts ..."
Abstract

Cited by 27 (2 self)
 Add to MetaCart
The paper examines ways in which the meanings of geographical concepts are affected by the phenomenon of vagueness. A logical analysis based on the theory of supervaluation semantics is developed and employed to describe differences and logical dependencies between different senses of vague concepts. Particular attention is given to analysing the concept of `forest' which exhibits many kinds of vagueness.
Sequent and Hypersequent Calculi for Abelian and Łukasiewicz Logics
 ACM Transactions on Computational Logic
, 2005
"... We present two embeddings of infinitevalued ̷Lukasiewicz logic ̷L into Meyer and Slaney’s abelian logic A, the logic of latticeordered abelian groups. We give new analytic proof systems for A and use the embeddings to derive corresponding systems for ̷L. These include: hypersequent calculi for A a ..."
Abstract

Cited by 19 (6 self)
 Add to MetaCart
We present two embeddings of infinitevalued ̷Lukasiewicz logic ̷L into Meyer and Slaney’s abelian logic A, the logic of latticeordered abelian groups. We give new analytic proof systems for A and use the embeddings to derive corresponding systems for ̷L. These include: hypersequent calculi for A and ̷L and terminating versions of these calculi; labelled single sequent calculi for A and ̷L of complexity coNP; unlabelled single sequent calculi for A and ̷L. 1
Modal Semantics for Knowledge Bases Dealing with Vague Concepts
 Principles of Knowledge Representation and Reasoning: Proceedings of the 6th International Conference (KR98
, 1998
"... The paper investigates the characterisation of vague concepts within the framework of modal logic. This work builds on the supervaluation approach of Fine and exploits the idea of a precisification space. A simple language is presented with two modalities: a necessity operator and an operator `it i ..."
Abstract

Cited by 11 (5 self)
 Add to MetaCart
The paper investigates the characterisation of vague concepts within the framework of modal logic. This work builds on the supervaluation approach of Fine and exploits the idea of a precisification space. A simple language is presented with two modalities: a necessity operator and an operator `it is unequivocal that' which is used to articulate the logic of vagueness. Both these operators obey the schemas of the logic S5. I show how this language can be used to represent logical properties of vague predicates which have a variety of possible precise interpretations. I consider the use within KR systems of number of different entailment relations that can be specified for this language. Certain vague predicates (such as `tall') may be indefinite even when there is no ambiguity in meaning. These can be accounted for by means of a threevalued logic, incorporating a definiteness operator. I also show the relationship between observable quantities (such as height) and vague predicates (su...
Triangle algebras: A formal logic approach to intervalvalued residuated lattices, Fuzzy Sets and Systems
"... In this paper, we introduce triangle algebras: a variety of residuated lattices equipped with approximation operators, and with a third angular point u, different from 0 and 1. We show that these algebras serve as an equational representation of intervalvalued residuated lattices (IVRLs). Furthermor ..."
Abstract

Cited by 7 (6 self)
 Add to MetaCart
In this paper, we introduce triangle algebras: a variety of residuated lattices equipped with approximation operators, and with a third angular point u, different from 0 and 1. We show that these algebras serve as an equational representation of intervalvalued residuated lattices (IVRLs). Furthermore, we present Triangle Logic (TL), a system of manyvalued logic capturing the tautologies of IVRLs. Triangle algebras are used to cast the essence of using closed intervals of L as truth values into a set of appropriate logical axioms. Our results constitute a crucial first step towards solving an important research challenge: the axiomatic formalization of residuated tnorm based logics on L I, the lattice of closed intervals of [0,1], in a similar way as was done for formal fuzzy logics on the unit interval. Key words: formal logic, intervalvalued fuzzy set theory, residuated lattices
On computing belief change operations using quantified boolean formulas
 Journal of Logic and Computation
, 2004
"... In this paper, we show how an approach to belief revision and belief contraction can be axiomatised by means of quantified Boolean formulas. Specifically, we consider the approach of belief change scenarios, a general framework that has been introduced for expressing different forms of belief change ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
In this paper, we show how an approach to belief revision and belief contraction can be axiomatised by means of quantified Boolean formulas. Specifically, we consider the approach of belief change scenarios, a general framework that has been introduced for expressing different forms of belief change. The essential idea is that for a belief change scenario (K, R, C), the set of formulas K, representing the knowledge base, is modified so that the sets of formulas R and C are respectively true in, and consistent with the result. By restricting the form of a belief change scenario, one obtains specific belief change operators including belief revision, contraction, update, and merging. For both the general approach and for specific operators, we give a quantified Boolean formula such that satisfying truth assignments to the free variables correspond to belief change extensions in the original approach. Hence, we reduce the problem of determining the results of a belief change operation to that of satisfiability. This approach has several benefits. First, it furnishes an axiomatic specification of belief change with respect to belief change scenarios. This then leads to further insight into the belief change framework.
Tutorial: Complexity of ManyValued Logics
 In Proc. 31st International Symposium on MultipleValued Logics, IEEE CS Press, Los Alamitos
, 2001
"... this article selfcontained. ..."