63 search results - page 4 / 13 » Conditional Logics of Normality as Modal Systems |
APAL
2006
13 years 7 months ago
2006
By a well-known result of Cook and Reckhow [4, 12], all Frege systems for the Classical Propositional Calculus (CPC) are polynomially equivalent. Mints and Kojevnikov [11] have re...
AIML
2006
13 years 8 months ago
2006
We see a systematic set of cut-free axiomatisations for all the basic normal modal logics formed by some combination the axioms d, t, b, 4, 5. They employ a form of deep inference ...
AI
1999
Springer
13 years 7 months ago
1999
Springer
Forthcoming in the Journal of Aritificial Intelligence We introduce mathematical programming and atomic decomposition as the basic modal (T-Box) inference techniques for a large c...
BDA
2006
13 years 8 months ago
2006
Surprisingly enough, there has been few investigations for typing references of semistructured data and XML documents. This paper build on a previous proposal [7] introducing simp...
ECAI
2010
Springer
13 years 8 months ago
2010
Springer
Conditional logics capture default entailment in a modal framework in which non-monotonic implication is a first-class citizen, and in particular can be negated and nested. There i...