Tight, consistent, and computable completions for unrestricted logic programs
- 28 February 1993
- journal article
- Published by Elsevier in The Journal of Logic Programming
- Vol. 15 (3) , 243-273
- https://doi.org/10.1016/0743-1066(93)90041-e
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- The well-founded semantics for general logic programsJournal of the ACM, 1991
- Strict completion of Logic ProgramsNew Generation Computing, 1991
- Signed data dependencies in logic programsThe Journal of Logic Programming, 1989
- A computable semantics for general logic programsThe Journal of Logic Programming, 1989
- Negation as failure using tight derivations for general logic programsThe Journal of Logic Programming, 1989
- Negation in logic programmingThe Journal of Logic Programming, 1987
- Linear logicTheoretical Computer Science, 1987
- A kripke-kleene semantics for logic programs*The Journal of Logic Programming, 1985
- The recursion-theoretic complexity of the semantics of predicate logic as a programming languageInformation and Control, 1982
- The Semantics of Predicate Logic as a Programming LanguageJournal of the ACM, 1976