Constructing infinite models represented by tree automata

被引：2

作者：

Peltier, Nicolas ^{[1
]}

机构：

[1] CNRS, LIG, F-38400 St Martin Dheres, France

来源：

ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE | 2009年 / 56卷 / 01期

关键词：

Model building; Tree automata; Infinite models; FINITE; SYMMETRIES; SEARCH;

D O I：

10.1007/s10472-009-9143-8

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

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 I center dot is transformed into a formula Delta(I center dot) s.t. I center dot has a model representable by a term tuple automaton iff Delta(I center dot) has a finite model. This paper is an extended version of Peltier (2008).

引用

页码：65 / 85

页数：21

共 15 条

[1] Predicting and detecting symmetries in FOL finite model search [J].