Protected completions of first-order general logic programs
- 1 June 1990
- journal article
- Published by Springer Nature in Journal of Automated Reasoning
- Vol. 6 (2) , 147-172
- https://doi.org/10.1007/bf00245816
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Equivalences of Logic ProgramsPublished by Elsevier ,1988
- Towards a Theory of Declarative KnowledgePublished by Elsevier ,1988
- Canonical logic programsThe Journal of Logic Programming, 1986
- Completeness of the SLDNF-resolution for a class of logic programsPublished by Springer Nature ,1986
- Notes on the mathematical aspects of Kripke's theory of truth.Notre Dame Journal of Formal Logic, 1986
- A kripke-kleene semantics for logic programs*The Journal of Logic Programming, 1985
- Computing protected circumscriptionThe Journal of Logic Programming, 1985
- Foundations of Logic ProgrammingPublished by Springer Nature ,1984
- Singular Terms, Truth-Value Gaps, and Free LogicThe Journal of Philosophy, 1966
- Introduction to a General Theory of Elementary PropositionsAmerican Journal of Mathematics, 1921