A computable semantics for general logic programs

DOI10.1016/0743-1066(89)90017-4MaRDI QIDQ4730755zbMATH OpenOpenAlexFDO

Authors

Publication date 1989

Published in The Journal of Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0743-1066(89)90017-4

zbMATH Keywords

canonical general programsfinite failure setlogic programssemanticssuccess setthree-valued logic

Mathematics Subject Classification ID

Many-valued logic (03B50) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Artificial intelligence (68T99)

Recommendations

• The well-founded semantics for general logic programs
• scientific article; zbMATH DE number 176721
• scientific article; zbMATH DE number 970715
• A semantics for modular general logic programs
• Generalized well-founded semantics for logic programs
• A compositional semantics for logic programs
• A logical foundation for logic programming II: Semantics of general logic programs
• A kripke-kleene semantics for logic programs*
• On the declarative and procedural semantics of logic programs
• scientific article; zbMATH DE number 4195154

Cited in

(16)

• Definite clause programs are canonical (over a suitable domain)
• Logic programs as compact denotations.
• On computability by logic programs
• A semantic approach to illative combinatory logic
• Canonical logic programs
• scientific article; zbMATH DE number 1200168 (Why is no real title available?)
• Reducts of Propositional Theories, Satisfiability Relations, and Generalizations of Semantics of Logic Programs
• scientific article; zbMATH DE number 218508 (Why is no real title available?)
• scientific article; zbMATH DE number 945663 (Why is no real title available?)
• scientific article; zbMATH DE number 2101985 (Why is no real title available?)
• Computer Science Logic
• Approximating any logic program by a CS-program
• Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs
• A sound and complete semantics for a similarity-based logic programming language
• Protected completions of first-order general logic programs
• On abstract resource semantics and computability logic

This page was built for publication: A computable semantics for general logic programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4730755)