A logical semantics for depth-first Prolog with ground negation

DOI10.1016/S0304-3975(96)00138-7zbMath0911.68135MaRDI QIDQ1390936

James Andrews

Publication date: 22 July 1998

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

zbMATH Keywords

logic programming

Mathematics Subject Classification ID

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

Related Items

First-order theories for pure Prolog programs with negation, A logical semantics for depth-first Prolog with ground negation, A transformation of propositional Prolog programs into classical logic, A Survey of the Proof-Theoretic Foundations of Logic Programming

Cites Work

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