A Uniform Proof Procedure for Classical and Non-classical Logics (1996) [22 citations — 16 self]
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@INPROCEEDINGS{Otten96auniform,author = {Jens Otten and Christoph Kreitz and Fachgebiet Intellektik and Fachbereich Informatik and Technische Hochschule Darmstadt},
title = {A Uniform Proof Procedure for Classical and Non-classical Logics},
booktitle = {KI-96: Advances in Artificial Intelligence, LNAI 1137},
year = {1996},
pages = {307--319},
publisher = {Springer}
}
Years of Citing Articles
Abstract:
Abstract. We present a proof procedure for classical and non-classical logics. The proof search is based on the matrix-characterization of validity where an emphasis on paths and connections avoids redundancies occurring in sequent or tableaux calculi. Our uniform path-checking algorithm operates on arbitrary (non-normal form) formulae and generalizes Bibel's connection method for classical logic and formulae in clause-form. It can be applied to intuitionistic and modal logics by modifying the component for testing complementarity of connected atoms. Besides a short and elegant path-checking procedure we present a specialized string-unification algorithm which is necessary for dealing with non-classical logics. 1
