Abstract
A method is proposed to transform automatically some satisfiable clause sets S into clause sets S′ having a unique Herbrand model (w.r.t. a given signature) which also satisfies S. These clause sets with only one model can be used as representations of (in general infinite) Herbrand models of the initial set of clauses. Existing theorem provers may be used to evaluate literals and clauses in the models thus represented (using the standard proof by consistency mechanism). We also prove that for some classes of clauses, the extracted model can also be represented by a tree automaton on tuples of finite trees. This entails in particular that the evaluation of arbitrary function-free formulae in the represented models is decidable.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
