Abstract
We present a framework of logic programming using an explicit representation of defeats of assumptions, called assumption denials. We study semantics for extended, disjunctive, and extended disjunctive programs, all in the same framework. The framework is based on a fixpoint operator over “uninterpreted programs”, and semantics for various kinds of programs are then defined simply by adding appropriate constraint clauses. For extended programs, we present a skeptical semantics that is tractable, and a credulous semantics which is a natural extension of a number of equivalent semantics proposed for normal programs. The generality of this framework is further evidenced by its ability to define semantics for disjunctive programs in terms of non-disjunctive programs. This reveals a relationship between disjunctive programs and non-disjunctive programs, which is known previously to be false in some other formalisms.
This paper is based on the technical report, “Abductive logic programming with assumption denials,” ISIS-RR-93-19E, Fujitsu Laboratories, 1993. The work of the first author was performed while visiting ISIS, Fujitsu Laboratories Ltd.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
J. Alferes, P. Dung, and L. Pereira. Scenario semantics of extended logic programs. In Proc. Second Workshop on Logic Programming and Nonmonotonic Reasoning, 1993.
J. Alferes and L. Pereira. On logic programs with two kinds of negation. In Proc. Joint International Conference and Symposium on Logic Programming, pages 574–588. MIT Press, 1992.
C. Baral and V.S. Subrahmanian. Dualities between alternative semantics for logic programming and nonmonotonic reasoning. In Proc. First Workshop on Logic Programming and Nonmonotonic Reasoning, pages 69–86, 1991.
C. Baral and V.S. Subrahmanian. Stable and extension class theory for logic programs and default logic. J. Automated Reasoning, pages 345–366, 1992.
A. Bondarenko, F. Toni, and R.A. Kowalski. An assumption-based frame-work for nonmonotonic reasoning. In Proc. Second Workshop on Logic Programming and Nonmonotonic Reasoning, July, 1993. Invited talk.
J. Dix. A classification theory of semantics of normal logic programs: I. strong properties. Foundamenta Informaticae (to appear), 1994.
J. Dix. A classification theory of semantics of normal logic programs: Ii. weak properties. Foundamenta Informaticae (to appear), 1994.
P. Dung. Negations as hypotheses: An abductive foundation for logic programming. In Proc. 8th ICLP, pages 3–17, 1991.
P. Dung. Acyclic disjunctive logic programs with abductive procedures as proof procedure. In Proc. International Conference on Fifth Generation Computer System, pages 555–561, 1992.
P. Dung. An argumentation semantics for logic programming with explicit negation. In Proc. 10th ICLP, pages 615–630, 1993.
K. Eshghi and R.A. Kowalski. Abduction compared with negation by failure. In Proc. 6th ICLP, pages 234–254, 1988.
A. Van Gelder. The alternating fixpoint of logic programs with negation. In Proc. 8th ACM PODS, 1989.
M. Gelfond and V. Lifschitz. Logical programs with classical negation. In Proc. 7th International Conference and Symposium on Logic Programming, pages 579–597, 1990.
L. Giordano and A. Martelli. Generalized stable models, truth maintenance and conflict resolution. In Proc. 7th ICLP, pages 427–441, 1990.
A. Van Gelder, K. Ross, and J.S. Schlipf. Unfounded sets and well-founded semantics for general logic programs. In Proc. 7th ACM PODS, 1988.
K. Inoue and C. Sakama. Transforming abductive logic programs to disjunctive programs. In Proc. 10th ICLP, 1993.
R.A. Kowalski and F. Dadri. Logic programs with exceptions. In Proc. 7th ICLP, pages 490–504, 1990.
A. Kakas and P. Mancarella. Generalized stable models: a semantics for abduction. In Proc. 9th European Conf. for AI, 1990.
A. Kakas, P. Mancarella, and P.M. Dung. The acceptability semantics for logic programs. In Proc. 11th ICLP, pages 504–519, 1994.
L. Pereira and J. Alferes. Well-founded semantics with explicit negation. In Proc. 10th ECAI, pages 102–106, 1992.
L. Pereira and J. Alferes. Optative reasoning with scenario semantics. In Proc. 10th ICLP, pages 601–615, 1993.
L. Pereira, J. Alferes, and J. Aparício. Contradiction removal within well-founded semantics. In Proc. First Workshop on Logic Programming and Nonmonotonic Reasoning, pages 105–119, 1991.
L. Pereira, J. Alferes, and J. Aparício. Counterfactual reasoning based on revising assumptions. In Proc. International Symposium on Logic Programming, pages 566–580, 1991.
H. Przymusinska and T.C. Przymusinski. Stationary default extensions. Technical report, California State Polytechnic and University of California at Riverside, 1991.
T.C. Przymusinski. Extended stable semantics for normal and disjunctive logic programs. In Proc. 7th International Conference and Symposium on Logic Programming, pages 459–477, 1990.
T.C. Przymusinski. Well-founded semantics coincides with three-valued stable semantics. Foundamenta Informaticae, 13:445–463, 1990.
T.C. Przymusinski. Semantics of disjunctive logic programs and deductive databases. In Proc. 2nd International Conference on Object Oriented and Deductive Databases, pages 87–107, 1991.
T. C. Przymusinski. Static semantics of logic programs. Annals of Mathematics and Artificial Intelligence, 1995. (A short version in this volume).
C. Sakama and K. Inoue. Negation in disjunctive logic programs. In Proc. 10th ICLP, 1993.
D. Saccà and C. Zaniolo. Stable models and non-determinism in logic programs with negation. In Proc. 9th ACM PODS, pages 205–217, 1990.
D. Saccà and C. Zaniolo. Partial models and three-valued stable models in logic programs with negation. In Proc. First Workshop on Logic Programming and Nonmonotonic Reasoning, pages 87–101, 1991.
C. Witteveen and G. Brewka. Skeptical reason maintenance and belief revision. Artificial Intelligence, 61:1–36, 1993.
C. Witteveen and C. M. Jonker. Revision by expansion in logic programs. Technical Report Report 93-02, Faculty of Mathematics and Computer Science, Delft University of Technology, 1993.
L. Yuan. Autoepistemic logic of first order and its expressive power. J. Automated Reasoning, 13(1):88–116, 1994.
J. You and L. Yuan. A three-valued semantics for deductive databases and logic programs. J. Computer and System Sciences, 49(2):334–361, 1994. An extended abstract appeared in Proc. ACM PODS '90.
J. You and L. Yuan. On the equivalence of semantics for normal logic programs. Journal of Logic Programming, 22(3):209–219, 1995.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
You, JH., Yuan, L.Y. (1995). Logic programming with assumption denial. In: Dix, J., Pereira, L.M., Przymusinski, T.C. (eds) Non-Monotonic Extensions of Logic Programming. NMELP 1994. Lecture Notes in Computer Science, vol 927. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030661
Download citation
DOI: https://doi.org/10.1007/BFb0030661
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59467-3
Online ISBN: 978-3-540-49272-6
eBook Packages: Springer Book Archive