A Fixed Point Semantics for the ATMS
assumption based truthautomatic theorem provingfixed point theorymaintenance systempropositional logic
The ATMS resolution mechanisms have been formalized, using the concept of DK-tree. We propose a new and simple approach based on the fixed point theory and an original demonstration of the completeness of these mechanisms. We first introduce the basic definitions of terms, sets and functions which are used in the paper and build a lattice. Then, the basic formal tools to describe the ATMS mechanisms are introduced: The notion of DK- Clash (in fact, the inference rule), and a monotonic function, which represents the deduction process and whose least fixed point corresponds to the output of an ATMS. We prove the soundness and the completeness (for specific clauses) of these mechanisms. This demonstration brings to light an original and interesting property, whose applications are discussed at the end of the paper.
This page was built for publication: A Fixed Point Semantics for the ATMS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4276177)