Sciweavers

4737 search results - page 183 / 948
» The LOGIC negotiation model
Sort
View
ICALP
2000
Springer
14 years 1 months ago
Decidable First-Order Transition Logics for PA-Processes
We show the decidability of model checking PA-processes against several first-order logics based upon the reachability predicate. The main tool for this result is the recognizabil...
Denis Lugiez, Ph. Schnoebelen
AIML
2008
13 years 11 months ago
Modal logics for mereotopological relations
We present a complete axiomatization of a logic denoted by MTML (Mereo-Topological Modal Logic) based on the following set of mereotopological relations: part-of, overlap, underlap...
Yavor Nenov, Dimiter Vakarelov
ECSQARU
2009
Springer
14 years 4 months ago
Merging Belief Bases Represented by Logic Programs
Abstract. This paper presents a method which allows for merging beliefs expressed thanks to logic programming with stable model semantics. This method is based on the syntactic mer...
Julien Hué, Odile Papini, Eric Würbel
IJCAI
2003
13 years 11 months ago
Evaluating Significance of Inconsistencies
Inconsistencies frequently occur in knowledge about the real-world. Some of these inconsistencies may be more significant than others, and some knowledgebases (sets of formulae) m...
Anthony Hunter
CORR
2008
Springer
107views Education» more  CORR 2008»
13 years 9 months ago
Metric Structures and Probabilistic Computation
Abstract. Continuous first-order logic is used to apply model-theoretic analysis to analytic structures (e.g. Hilbert spaces, Banach spaces, probability spaces, etc.). Classical co...
Wesley Calvert