Complete extension of general logic programs
From MaRDI portal
(Redirected from Publication:1190477)
Recommendations
Cites work
- scientific article; zbMATH DE number 3872640 (Why is no real title available?)
- A kripke-kleene semantics for logic programs*
- Closures and fairness in the semantics of programming logic
- Contributions to the Theory of Logic Programming
- Negation as failure. II
- Negation as failure: a comparison of Clark's completed data base and Reiter's closed world assumption
- Negation in logic programming
- On the declarative and procedural semantics of logic programs
- Sémantique logique et dénotationnelle des interpréteurs PROLOG
- The Semantics of Predicate Logic as a Programming Language
Cited in
(10)- scientific article; zbMATH DE number 1482189 (Why is no real title available?)
- Complete logic programs with domain-closure axiom
- scientific article; zbMATH DE number 1292287 (Why is no real title available?)
- Negation-as-failure rule for general logic programs with equality
- scientific article; zbMATH DE number 4074450 (Why is no real title available?)
- Decidability of the Clark's completion semantics for monadic programs and queries
- Protected completions of first-order general logic programs
- Is there an axiomatic semantics for standard pure Prolog?
- scientific article; zbMATH DE number 1200168 (Why is no real title available?)
- Négation constructive et axiomatique interne
This page was built for publication: Complete extension of general logic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1190477)
