Sciweavers

LOGCOM
2002
105views more  LOGCOM 2002»
13 years 9 months ago
Labelled Tableaux for Nonmonotonic Reasoning: Cumulative Consequence Relations
In this paper we present a labelled proof method for computing nonmonotonic consequence relations in a conditional logic setting. The method exploits the strong connection between...
Alberto Artosi, Guido Governatori, Antonino Rotolo
ECAI
2010
Springer
13 years 11 months ago
Optimal Tableaux for Conditional Logics with Cautious Monotonicity
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...
Lutz Schröder, Dirk Pattinson, Daniel Hausman...
AAAI
1996
13 years 11 months ago
First-Order Conditional Logic Revisited
Conditional logics play an important role in recent attempts to investigate default reasoning. This paper investigates firstorder conditional logic. We show that, as for first-ord...
Nir Friedman, Joseph Y. Halpern, Daphne Koller
TABLEAUX
2000
Springer
14 years 1 months ago
A Labelled Tableau Calculus for Nonmonotonic (Cumulative) Consequence Relations
Abstract. In this paper we present a labelled proof method for computing nonmonotonic consequence relations in a conditional logic setting. The method is based on the usual possibl...
Alberto Artosi, Guido Governatori, Antonino Rotolo
TARK
1998
Springer
14 years 2 months ago
Hypothetical Knowledge and Counterfactual Reasoning
: Salmetintroduced a notion of hypothetical knowledge and showed how it could be used to capture the type of counterfactual reasoning necessary to force the backwards induction sol...
Joseph Y. Halpern
LPAR
2005
Springer
14 years 3 months ago
Comparative Similarity, Tree Automata, and Diophantine Equations
The notion of comparative similarity ‘X is more similar or closer to Y than to Z’ has been investigated in both foundational and applied areas of knowledge representation and r...
Mikhail Sheremet, Dmitry Tishkovsky, Frank Wolter,...
TABLEAUX
2009
Springer
14 years 4 months ago
Generic Modal Cut Elimination Applied to Conditional Logics
We develop a general criterion for cut elimination in sequent calculi for propositional modal logics, which rests on absorption of cut, contraction, weakening and inversion by the ...
Dirk Pattinson, Lutz Schröder