A fixpoint characterization of abductive logic programs
- 31 May 1996
- journal article
- Published by Elsevier in The Journal of Logic Programming
- Vol. 27 (2) , 107-136
- https://doi.org/10.1016/0743-1066(95)00119-0
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- Hypothetical reasoning in logic programsThe Journal of Logic Programming, 1994
- On the duality of abduction and model generation in a framework for model generation with equalityTheoretical Computer Science, 1994
- Disjunctive LP+integrity constraints= stable model semanticsAnnals of Mathematics and Artificial Intelligence, 1993
- Linear resolution for consequence findingArtificial Intelligence, 1992
- Michael Gelfond and Vladimir Lifschitz. The stable model semantics for logic programming. Logic programming, Proceedings of the fifth international conference and symposium, Volume 2, edited by Robert A. Kowalski and Kenneth A. Bowen, Series in logic programming, The MIT Press, Cambridge, Mass., and London, 1988, pp. 1070–1080. - Kit Fine. The justification of negation as failure. Logic, methodology and philosophy of science VIII, Proceedings of the Eighth International Congress of Logic, Methodology and Philosophy of Science, Moscow, 1987, edited by Jens Erik Fenstad, Ivan T. Frolov, and Risto Hilpinen, Studies in logic and the foundations of mathematics, vol. 126, North-Holland, Amsterdam etc. 1989, pp. 263–301.The Journal of Symbolic Logic, 1992
- Embedding negation as failure into a model generation theorem proverPublished by Springer Nature ,1992
- On the Relationship Between Abduction and DeductionJournal of Logic and Computation, 1991
- Classical negation in logic programs and disjunctive databasesNew Generation Computing, 1991
- Magic sets and other strange ways to implement logic programs (extended abstract)Published by Association for Computing Machinery (ACM) ,1985
- Negation as FailurePublished by Springer Nature ,1978