Axiomatizations of backtracking

DOI10.1007/3-540-55210-3_174zbMATH Open1493.68338OpenAlexW1802865379MaRDI QIDQ5096771FDOQ5096771

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

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

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)

Cites Work

• Simple operational and denotational semantics for Prolog with cut
• Operational and denotational semantics of prolog
• Denotational and operational semantics for prolog
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (6)

• Relating models of backtracking
• Toward the concept of backtracking computation
• A denotational semantics and dataflow construction for logic programs
• Title not available (Why is that?)
• 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)