Constructing infinite models represented by tree automata

Authors:
Nicolas Peltier
Affiliations:
CNRS, LIG, Saint Martin d'Hères, France 38400
Venue:
Annals of Mathematics and Artificial Intelligence
Year:
2009

Citing 9
Cited 0

A Structure-preserving Clause Form Translation

Journal of Symbolic Computation
First-order logic and automated theorem proving

First-order logic and automated theorem proving
A method for simultaneous search for refutations and models by equational constraint solving

Journal of Symbolic Computation
Working with ARMs: complexity results on atomic representations of herbrand models

Information and Computation
FINDER: Finite Domain Enumerator - System Description

CADE-12 Proceedings of the 12th International Conference on Automated Deduction
System Description: Generating Models by SEM

CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
FDPLL - A First Order Davis-Putnam-Longeman-Loveland Procedure

CADE-17 Proceedings of the 17th International Conference on Automated Deduction
Predicting and Detecting Symmetries in FOL Finite Model Search

Journal of Automated Reasoning
Model representation via contexts and implicit generalizations

CADE' 20 Proceedings of the 20th international conference on Automated Deduction

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a method to use finite model builders in order to construct infinite models of first-order formulae. The constructed models are Herbrand interpretations, in which the interpretation of the predicate symbols is specified by tree tuple automata (Comon et al. 1997). Our approach is based on formula transformation: a formula 驴 is transformed into a formula Δ(驴) s.t. 驴 has a model representable by a term tuple automaton iff Δ(驴) has a finite model. This paper is an extended version of Peltier (2008).