Simple operational and denotational semantics for Prolog with cut

DOI10.1016/0304-3975(90)90197-PMaRDI QIDQ912643zbMATH OpenFDO

Authors Michel Billaud

Publication date 1990

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

zbMATH Keywords

denotational semanticsPrologoperational semanticscut operator

Mathematics Subject Classification ID

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

Recommendations

• Operational and goal-independent denotational semantics for Prolog with cut
• Comparative semantics for prolog with cut
• scientific article; zbMATH DE number 4078852
• Denotational and operational semantics for prolog
• Operational and denotational semantics of prolog

Cites work

• scientific article; zbMATH DE number 4078852 (Why is no real title available?)
• scientific article; zbMATH DE number 3653565 (Why is no real title available?)
• Contributions to the Theory of Logic Programming

Cited in

(19)

• A prescribed cut for Prolog that ensures soundness
• A logical semantics for depth-first Prolog with ground negation
• Backtracking with cut via a distributive law and left-zero monoids
• An operational formal definition of PROLOG: A specification method and its application
• scientific article; zbMATH DE number 65740 (Why is no real title available?)
• scientific article; zbMATH DE number 490755 (Why is no real title available?)
• scientific article; zbMATH DE number 516993 (Why is no real title available?)
• Denotational and operational semantics for prolog
• Operational and denotational semantics of prolog
• A denotational semantics and dataflow construction for logic programs
• scientific article; zbMATH DE number 4078852 (Why is no real title available?)
• Prolog's control constructs in a functional setting -- axioms and implementation
• The witness properties and the semantics of the Prolog cut
• Operational and goal-independent denotational semantics for Prolog with cut
• Proving completeness of logic programs with the cut
• A non-definability result for a predicational language with the usual control
• Is there an axiomatic semantics for standard pure Prolog?
• Comparative semantics for prolog with cut
• Axiomatizations of backtracking

This page was built for publication: Simple operational and denotational semantics for Prolog with cut

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