Proof method of partial correctness and weak completeness for normal logic programs
- 30 November 1993
- journal article
- Published by Elsevier in The Journal of Logic Programming
- Vol. 17 (2-4) , 265-278
- https://doi.org/10.1016/0743-1066(93)90033-d
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Proof method of partial correctness and weak completeness for normal logic programsThe Journal of Logic Programming, 1993
- Proof methods of declarative properties of definite programsTheoretical Computer Science, 1993
- An operational formal definition of PROLOG: a specification method and its applicationNew Generation Computing, 1992
- A simple fixed point characterization of three-valued stable model semanticsInformation Processing Letters, 1991
- The well-founded semantics for general logic programsJournal of the ACM, 1991
- Programming in three-valued logicTheoretical Computer Science, 1991
- Negation by default and unstratifiable logic programsTheoretical Computer Science, 1991
- Declarative modeling of the operational behavior of logic languagesTheoretical Computer Science, 1989
- A kripke-kleene semantics for logic programs*The Journal of Logic Programming, 1985
- The Semantics of Predicate Logic as a Programming LanguageJournal of the ACM, 1976