Abstract
Presents a new and unifying formalization of the inference techniques involved in assumption-based truth maintenance systems (ATMS). Basic concepts of ATMS are briefly reviewed. Then an original inference system, called P-deduction, is presented, which enables us to build a propositional backward-chaining prover. It is shown how to exploit the results provided by the proof algorithm in order to compute labels, interpretations, and nogoods.
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call