Abstract
We present our Tree—structured Modified Problem Reduction proof procedure (TMPR) developed for classical and three-valued logic in [6], emphasizing its suitability for disjunctive logic programming. TMPR needs no contrapositives and extends SLD-resolution with a Prolog-style backward chaining by a controlled use of case analysis. This is done without having to extend negative goals needed, e.g., for model elimination. Performing case analysis at different levels within proofs often results in a simple structure of proofs and of the (indefinite) answers generated by TMPR. We finally note on the usefulness of strong and exclusion negation besides nontruth-by-CWA negation for disjunctive logic programs and clarify their interrelationship.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
P. Baumgartner and U. Furbach. Model elimination without contrapositives. CADE’94.
U. Furbach. Computing answers for disjunctive logic programs. in LNAI 633, D. Pearce & G. Wagner (Eds.), 357–372, Proc. JELIA’92. Berlin, Germany, Sept. 1992.
M. Gelfond and V. Lifschitz. Classical Negation in Logic Programs and Disjunctive Databases. J. New Gener. Comp., 9 (1991) 365–385.
D.W. Loveland. Automated Theorem Proving: a logical base. North-Holland (1978).
D.W. Loveland. Near-Horn Prolog and Beyond. J. Autom. Reas. 7, pp. 1–26 (1991).
T. Mellouli. TMPR: A Tree-structured Modified Problem Reduction Proof Procedure and its Extension to Three-Valued Logic. Appears in Journal of Automated Reasoning.
T. Mellouli. Enhancing Readability of Proofs by Structure-Preserving Translation and Proving. Accepted contribution to the ECAI’94 workshop: From Theorem Provers to Mathematical Assistants: Issues and Possible Solutions. Amsterdam, 9 August 1994.
T. Mellouli. Tree-structured Theorem Proving using Controlled Case Analysis Mechanisms for Classical, Three-, and Four-Valued Logic. Doctoral Thesis. University of Paderborn (1994).
X. Nie and D.A. Plaisted. A Complete Semantic Back Chaining Proof System. Proc. CADE 10, 16–27 (1990).
D. Pearce and G. Wagner. Logic Programming with Strong Negation. In SchroederHeister, eds., Extensions of Logic Programming, LNAI 475, 311–326, Springer (1991).
L.M. Pereira and J.J. Alferes. Well founded Semantics for Logic Programs with Explicit Negation. B. Neumann (ed.), Proc. ECAI’92, 102–106. J. Wiley & Sons (1992).
D.A. Plaisted. Non-Horn Clause Logic Programming without Contrapositives. Journal of Automated Reasoning 4, 287–325 (1988).
D.W. Reed & D.W. Loveland. A Comparison of Three Prolog Extensions. Journal of Logic Programming 12, 25–50 (1992).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mellouli, T. (1994). TMPR for Disjunctive Logic Programming and Usefulness of Strong and Exclusion Negation. In: Wolfinger, B. (eds) Innovationen bei Rechen- und Kommunikationssystemen. Informatik aktuell. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-51136-3_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-51136-3_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58313-4
Online ISBN: 978-3-642-51136-3
eBook Packages: Springer Book Archive