Abstract
Extended logic programs allow for negative conclusions in rules. So, the question of how to deal with contradictions arises. The trivialization (or ‘explosion’) approach of classical logic, according to which everything follows from a contradiction, is certainly not adequate for the purpose of processing partially inconsistent information in a cognitively and computationally satisfactory way. We propose to consider logical principles instead, which stem from the area of directly skeptical inheritance, or defeasible reasoning, known from the AI literature on nonmonotonic reasoning. In these systems conflicting pieces of information neutralize each other unless one of them ‘preempts’ (i.e. defeats) the other. The preemption mechanism is usually based on some notion of specificity. Extending earlier work [19], where we have introduced the concept of neutralization to the framework of extended logic programs, we show in this paper how to add a general mechanism for specificity-based preemption and demonstrate its feasibility by presenting an appropriate meta-interpreter.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
N.D. Belnap: A Useful Four-valued logic, in G. Epstein and J.M. Dunn (Eds.), Modern Uses of Many-valued Logic, Reidel, 1977, 8–37.
D. Billington: Defeasible Logic is Stable, Computing and Information Technology Research Report 48, Griffith University, Brisbane, 1991.
H.A. Geffner and J. Pearl: A Framework for Reasoning with Defaults, in H.E. Kyburg et al. (Eds.), Knowledge Representation and Defeasible Reasoning, Kluwer, London, 1990, 245–265.
M. Gelfond and V. Lifschitz: Logic Programs with Classical Negation, Proc. ICLP 1990, MIT Press, 1990.
M. Gelfond and V. Lifschitz: Classical Negation in Logic Programs and Disjunctive Databases, J. New Generation Computing 9 (1991), 365–385.
H.J. Levesque: Making Believers out of Computers, AI 30 (1986), 81–107.
D. Nelson: Constructible falsity, JSL 14 (1949), 16–26.
D. Nute: Defeasible Reasoning and Decision Support Systems, Decision Support Systems 4 (1988), 97–110.
D. Nute: Basic Defeasible Logic, in L.F. del Cerro and M. Penttonen (Eds.), Intensional Logics for Programming, Oxford University Press, 1992.
J.L. Pollock: Defeasible Reasoning, Cognitive Science 11 (1987), 481–518.
G.R. Simari and R.P. Loui: A Mathematical Treatment of Defeasible Reasoning and its Implementation, AI 53 (1992), 125–157.
L.A. Stein, Skeptical Inheritance: Computing the Intersection of Credulous Extensions, Proc. of IJCAI-89, 1153–1158
R.H. Thomason and J.F. Horty: Logics for Inheritance Theory, Proc. of 2nd Int. Workshop on Nonmonotonic Reasoning 1988, Springer LNAI 346, 220–237.
D.S. Touretzky, J.F. Horty and R.H. Thomason. A Clash of Intuitions: The Current State of Nonmonotonic Multiple Inheritance Systems, Proc. of IJCAI-87, 476–482.
G. Wagner: The two Sources of Nonmonotonicity in Vivid Logic — Inconsistency Handling and Weak Falsity, Proc. of GMD Workshop on Nonmonotonic Reasoning 1989, Gesellschaft für Mathematik und Datenverarbeitung, Bonn-St. Augustin, 1990.
G. Wagner: Logic Programming with Strong Negation and Inexact Predicates, J. of Logic and Computation, 1:6 (1991).
G. Wagner: A Database Needs Two Kinds of Negation, Proc. of 3rd Int. Symposium on Mathematical Fundamentals of Database and Knowledge Base Systems (MFDBS-91), Springer LNCS 495 (1991), 357–371.
G. Wagner: Vivid Logic — Knowledge-Based Reasoning with Two Kinds of Negation, Dissertation, Freie Universität Berlin, 1993.
G. Wagner: Reasoning with Inconsistency in Extended Deductive Databases, forthcoming in L.M. Pereira and A. Nerode (Eds.), Proc. 2nd Int. Workshop on Logic Programming and Nonmonotonic Reasoning, MIT Press, 1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wagner, G. (1993). Neutralization and preemption in extended logic programs. In: Voronkov, A. (eds) Logic Programming and Automated Reasoning. LPAR 1993. Lecture Notes in Computer Science, vol 698. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56944-8_65
Download citation
DOI: https://doi.org/10.1007/3-540-56944-8_65
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56944-2
Online ISBN: 978-3-540-47830-0
eBook Packages: Springer Book Archive