Skip Navigation

Logic Journal of IGPL 2004 12(5):345-353; doi:10.1093/jigpal/12.5.345
© 2004 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 Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Paris, J.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Deriving Information from Inconsistent Knowledge Bases: A Completeness Theorem for {eta}{triangleright}{eta}

Jeff Paris

Department of Mathematics, University of Manchester, Manchester M13 9PL, UK. E-mail: jeff{at}maths.man.ac.uk

The logical consequence relations {eta}{triangleright}{eta} provide a very attractive way of inferring new facts from inconsistent knowledge bases without compromising standards of credibility. In this short note we provide proof theories and completeness theorems for these consequence relations which may have some applicability in small examples.

Key Words: Logic, Inconsistency, Probability Logic, Paraconsistent Logics

Received 31 August 2004. Revised 29 September 2004.


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.