Abstract
Various approaches to computing answers for disjunctive logic programs are presented. Emphasis is put on splitting based approaches; a naive application of the splitting rule is taken as a starting point for both, the development of a fixpoint semantics and the Split-Sld-calculus. This calculus is proven correct and complete and it is compared with model elimination and InH-Prolog.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
R. Caferra, E. Eder, B. Fronhöfer, and W. Bibel. Extension of prolog through matrix reduction. In Proc. ECAI-84, pages 101–104. North-Holland, 1984.
M.A. Casanova, R. Guerreiro, and A. Silva. Logic programming with general clauses and defaults based on model elimination. In Proc. of the 11th IJCAI, pages 395–400. Morgan Kaufmann, 1989.
C. L. Chang and R. C. T. Lee. Symbolic Logic and Mechanical Theorem Proving. Academic Press, 1973.
H. Decker. On the declarative, operational and procedural semantics of disjunctive computational theories. In Proc. Workshop on the Deductive Approach to Information Systems and Databases, Spain, 1991.
J.A. Fernandez and J. Minker. Bottom-up evaluation of hierarchical disjunctive deductive databases. In Koichi Furukawa, editor, Proc. 8th International Conference on Logic Programming, pages 660–675, 91.
U. Furbach. Answers for disjunctive logic programs. In T. Christaller, editor, Proc. of the GWAI'91, pages 23–32. Springer, Informatik Fachberichte 285, 1991.
U. Furbach. Splitting as a source of parallelism in disjunctive logic programs. Technical Report 8/91, Universität Koblenz, 1991. Also in Proc. of the IJCAI-Workshop PPAI'91.
H. Herre. Negation and constructivity in logic programming. J. New Gener. Comput. Syst., 1(4):295–305, 1988.
D.W. Loveland. Automated Theorem Proving: A logical basis. North-Holland, 1978.
D.W. Loveland. Near-Horn Prolog. In J.-L. Lassez, editor, Proc. of the 4th Int. Conf. on Logic Programming, pages 456–469. The MIT Press, 1987.
D.W. Loveland and D.W. Reed. A near-horn prolog for compilation. Technical report cs-1989–14, Duke University, 1990.
R. Letz, J. Schumann, S. Bayerl, and W. Bibel. SETHEO: A High-Performance Theorem Prover. Technical report, ATP-Report, Technische Universität München, 1989. To appear in Journal of Automated Reasoning.
J. Minker and A. Rajasekar. Procedural interpretation of non-horn logic programs. In Lusk and Overbeek, editors, Proc. of the 9th CADE, pages 279–293. Springer LNCS 310, 1988.
J. Minker and A. Rajasekar, A fixpoint semantics for disjunctive logic programs. J. Logic Programming, 9:45–74, 1990.
D.W. Reed, D.W. Loveland, and B.T. Smith. An alternative characterization of disjunctive logic programs. Technical Report CS-1991-11, Duke Univerity, 1991.
T. Wakayama and T.H. Payne. Case inference in resolution-based languages. In Lusk and Overbeek, editors, Proc. of the 9th CADE, pages 313–322. Springer LNCS 310, 1988.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Furbach, U. (1992). Computing answers for disjunctive logic programs. In: Pearce, D., Wagner, G. (eds) Logics in AI. JELIA 1992. Lecture Notes in Computer Science, vol 633. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0023438
Download citation
DOI: https://doi.org/10.1007/BFb0023438
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55887-3
Online ISBN: 978-3-540-47304-6
eBook Packages: Springer Book Archive