Sciweavers

571 search results - page 11 / 115
» Domain Theory in Logical Form
Sort
View
TYPES
1998
Springer
15 years 1 months ago
Proof Normalization Modulo
We define a generic notion of cut that applies to many first-order theories. We prove a generic cut elimination theorem showing that the cut elimination property holds for all theo...
Gilles Dowek, Benjamin Werner
68
Voted
ISMVL
2000
IEEE
90views Hardware» more  ISMVL 2000»
15 years 2 months ago
Structures with Many-Valued Information and Their Relational Proof Theory
We present a uniform relational framework for developing proof systems for theories of manyvaluedness that may have the form of a logical system, of a class of algebra or of an in...
Ivo Düntsch, Wendy MacCaull, Ewa Orlowska
CSL
2006
Springer
15 years 1 months ago
Decidable Theories of the Ordering of Natural Numbers with Unary Predicates
Abstract. Expansions of the natural number ordering by unary predicates are studied, using logics which in expressive power are located between first-order and monadic second-order...
Alexander Moshe Rabinovich, Wolfgang Thomas
74
Voted
ECAI
2004
Springer
15 years 3 months ago
Reasoning in Description Logics with a Concrete Domain in the Framework of Resolution
In description logics, concrete domains are used to model concrete properties such as weight, name, or age, having concrete values such as integers or strings, with built-in predic...
Ullrich Hustadt, Boris Motik, Ulrike Sattler
CORR
2011
Springer
190views Education» more  CORR 2011»
14 years 1 months ago
Compiling Causal Theories to Successor State Axioms and STRIPS-Like Systems
We describe a system for specifying the effects of actions. Unlike those commonly used in AI planning, our system uses an action description language that allows one to specify t...
Fangzhen Lin