Axiomatizations of backtracking

DOI10.1007/3-540-55210-3_174MaRDI QIDQ5096771zbMATH OpenOpenAlexFDO

Authors Michel Billaud

Publication date 18 August 2022

Published in STACS 92 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-55210-3_174

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic programming (68N17) Semantics in the theory of computing (68Q55)

Recommendations

• Toward the concept of backtracking computation
• Is there an axiomatic semantics for standard pure Prolog?
• Axiomatizing schemes and their behaviors
• Concurrent program schemes and their logics
• First-order theories for pure Prolog programs with negation

Cites work

• scientific article; zbMATH DE number 4078852 (Why is no real title available?)
• scientific article; zbMATH DE number 19144 (Why is no real title available?)
• Denotational and operational semantics for prolog
• Operational and denotational semantics of prolog
• Simple operational and denotational semantics for Prolog with cut

Cited in

(6)

• Relating models of backtracking
• Toward the concept of backtracking computation
• A denotational semantics and dataflow construction for logic programs
• scientific article; zbMATH DE number 598180 (Why is no real title available?)
• Computational complexity of terminological reasoning in BACK
• Intelligent backtracking in \(\text{CLP}(\Re)\)

This page was built for publication: Axiomatizations of backtracking

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