@InProceedings{SchroderEA10,
  author = {Lutz Schr{\"o}der and Dirk Pattinson and Daniel Hausmann},
  title = {Optimal Tableaux for Conditional Logics with Cautious Monotonicity},
  year = {2010},
  editor = {Michael Wooldridge},
  booktitle = {European Conference on Artificial Intelligence (ECAI 2010)},
  publisher = {IOS Press},
  series = {Frontiers in Artificial Intelligence and Applications},
  volume = {215},
  pages = {707-712},
  keywords = {Conditional logic coalgebra tableaux system S cautious monotony},
  comment = { <a href = "http://www8.informatik.uni-erlangen.de/~schroeder/papers/CondTableaux.pdf"> [preprint] </a>},
  abstract = {  Conditional logics capture default entailment in a modal framework
  in which non-monotonic implication becomes a first-class citizen, and
  in particular can be negated and nested. There is a wide range of
  axiomatizations of conditionals in the literature, from weak systems
  such as the basic conditional logic CK, which allows only for
  equivalent exchange of conditional antecedents, to strong systems
  such as Burgess' system S, which imposes the full
  Kraus-Lehmann-Magidor properties of preferential logic. While
  tableaux systems implementing the actual complexity of the logic at
  hand have recently been developed for several weak systems, strong
  systems including in particular disjunction elimination or cautious
  monotonicity have so far eluded such efforts; previous results for
  strong systems are limited to semantics-based decision procedures
  and completeness proofs for Hilbert-style axiomatizations. Here, we
  present tableaux systems of optimal complexity PSpace for several
  strong axiom systems in conditional logic, including system S; the
  arising decision procedure for system S is implemented in the
  generic reasoning tool CoLoSS.
},
}