A logical semantics for depth-first Prolog with ground negation

DOI10.1016/S0304-3975(96)00138-7MaRDI QIDQ1390936zbMATH OpenFDO

Authors James Andrews

Publication date 22 July 1998

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0304-3975(96)00138-7

zbMATH Keywords

logic programming

Mathematics Subject Classification ID

Logic programming (68N17) Semantics in the theory of computing (68Q55)

Recommendations

• A procedural semantics for well-founded negation in logic programs
• scientific article; zbMATH DE number 4185010
• scientific article; zbMATH DE number 18533
• scientific article; zbMATH DE number 591001
• scientific article; zbMATH DE number 92602
• scientific article; zbMATH DE number 1929962
• Towards a logical semantics for pure Prolog

Cites work

• A kripke-kleene semantics for logic programs*
• A logical semantics for depth-first Prolog with ground negation
• A structural approach to operational semantics
• A Transformation System for Developing Recursive Programs
• A view of programming languages as symbiosis of meaning and computations
• An operational formal definition of PROLOG: A specification method and its application
• Contributions to the Theory of Logic Programming
• Denotational and operational semantics for prolog
• scientific article; zbMATH DE number 3648682 (Why is no real title available?)
• scientific article; zbMATH DE number 3872640 (Why is no real title available?)
• scientific article; zbMATH DE number 3924108 (Why is no real title available?)
• scientific article; zbMATH DE number 19144 (Why is no real title available?)
• Logic Programming
• Modelling Prolog Control
• Negation and control in PROLOG
• Negation in logic programming
• Operational and denotational semantics of prolog
• Outline of a Theory of Truth
• Proving termination properties of prolog programs: A semantic approach
• Reasoning about prolog programs: From modes through types to assertions
• Reasoning about termination of pure Prolog programs
• Simple operational and denotational semantics for Prolog with cut
• Strong termination of logic programs
• Termination proofs for logic programs
• Tight, consistent, and computable completions for unrestricted logic programs
• Unfolding and fixpoint semantics of concurrent constraint logic programs
• Uniform proofs as a foundation for logic programming

Cited in

(5)

• A logical semantics for depth-first Prolog with ground negation
• First-order theories for pure Prolog programs with negation
• scientific article; zbMATH DE number 458994 (Why is no real title available?)
• A transformation of propositional Prolog programs into classical logic
• A Survey of the Proof-Theoretic Foundations of Logic Programming

This page was built for publication: A logical semantics for depth-first Prolog with ground negation

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