Skip Navigation

Journal of Logic and Computation 2002 12(6):1027-1060; doi:10.1093/logcom/12.6.1027
© 2002 by Oxford University Press
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (5)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Artosi, A.
Right arrow Articles by Rotolo, A.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Original Article

Labelled Tableaux for Nonmonotonic Reasoning: Cumulative Consequence Relations

Alberto Artosi1, Guido Governatori2 and Antonino Rotolo3

1 Department of Philosophy, University of Bologna, via Zamboni 38, I-40126 Bologna, Italy. E-mail: artosi{at}cirfid.unibo.it 2 School of Information Technology and Electrical Engineering, The University of Queensland, Brisbane, QLD 4072, Australia. E-mail: guido{at}itee.uq.edu.au 3 CIRSFID, University of Bologna, Via Galliera 3, I-40121 Bologna, Italy. E-mail: rotolo{at}cirfid.unibo.it

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 these deductive relations and conditional logics, and it is based on the usual possible world semantics devised for the latter. The label formalism KEM, introduced to account for the semantics of normal modal logics, is easily adapted to the semantics of conditional logic by simply indexing labels with formulas. The basic inference rules are provided by the propositional system KE+—a tableau-like analytic proof system devised to be used both as a refutation method and a direct method of proof—that is the classical core of KEM which is thus enlarged with suitable elimination rules for the conditional connective. The resulting algorithmic framework is able to compute cumulative consequence relations in so far as they can be expressed as conditional implications.

Keywords: Labelled tableaux; nonmonotonic reasoning; conditional logic

Received 24 January 2001.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.