Complexity and undecidability results for logic programming
- 1 September 1995
- journal article
- Published by Springer Nature in Annals of Mathematics and Artificial Intelligence
- Vol. 15 (3-4) , 257-288
- https://doi.org/10.1007/bf01536398
Abstract
No abstract availableKeywords
This publication has 31 references indexed in Scilit:
- Autoepistemic logicJournal of the ACM, 1991
- A note on Dowling and Gallier's top-down algorithm for propositional Horn satisfiabilityThe Journal of Logic Programming, 1990
- Negation in logic programmingThe Journal of Logic Programming, 1987
- Decidability and definability with circumscriptionAnnals of Pure and Applied Logic, 1987
- Fixed-point extensions of first-order logicAnnals of Pure and Applied Logic, 1986
- A kripke-kleene semantics for logic programs*The Journal of Logic Programming, 1985
- Negation as failure. IIThe Journal of Logic Programming, 1985
- Linear-time algorithms for testing the satisfiability of propositional horn formulaeThe Journal of Logic Programming, 1984
- The mathematics of non-monotonic reasoningArtificial Intelligence, 1980
- Circumscription—A form of non-monotonic reasoningArtificial Intelligence, 1980