Automated Model Building: From Finite to Infinite Models

Authors:
Nicolas Peltier
Affiliations:
LIG INPG/CNRS, Grenoble Cedex, France 38031
Venue:
Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics
Year:
2008

Citing 8
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
A Note on Symmetry Heuristics in SEM

CADE-18 Proceedings of the 18th International Conference on Automated Deduction
Reasoning by Symmetry and Function Ordering in Finite Model Generation

CADE-18 Proceedings of the 18th International Conference on Automated Deduction
SEM: a system for enumerating models

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
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 for using existing finite model builders for constructing infinite models of first-order formulae. The considered interpretations are represented by tree tuple automata. Our approach is based on formula transformation. It is proven to be sound (i.e. all the constructed interpretations are models of the original formula) and complete for the considered class of interpretations (i.e. a model is eventually built for any formula having a model representable by a tree automaton).