Negation as failure using tight derivations for general logic programs
- 31 March 1989
- journal article
- Published by Elsevier in The Journal of Logic Programming
- Vol. 6 (1-2) , 109-133
- https://doi.org/10.1016/0743-1066(89)90032-0
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Efficient tests for top-down termination of logical rulesJournal of the ACM, 1988
- Comments on “general failure of logic programs”The Journal of Logic Programming, 1986
- Negation-as-failure rule for general logic programs with equalityThe Journal of Logic Programming, 1985
- Negation as failure. IIThe Journal of Logic Programming, 1985
- Implementation of logical query languages for databasesACM Transactions on Database Systems, 1985
- General failure of logic programsThe Journal of Logic Programming, 1985
- A logical reconstruction of Prolog IIThe Journal of Logic Programming, 1984
- On compiling queries in recursive first-order databasesJournal of the ACM, 1984
- Contributions to the Theory of Logic ProgrammingJournal of the ACM, 1982
- The Semantics of Predicate Logic as a Programming LanguageJournal of the ACM, 1976