Constraint Propagation in Model Generation

Model generation refers to the automatic construction of models of a given logical theory. It can be regarded as a special case of constraint satisfaction where the constraints are a set of clauses with equality and functions. In this paper, we study various constraint propagation rules for finite model generation. We implemented these rules in a prototype system called SEM (a System for Enumerating Models). By experimenting with SEM, we try to identify a set of transformation rules that are both efficient and easy to implement. We also compare several existing model generation systems that are based on different logics and strategies.

[1]  Larry Wos,et al.  Automated reasoning - 33 basic research problems , 1988 .

[2]  Ricardo Caferra,et al.  A Method for Building Models Automatically. Experiments with an Extension of OTTER , 1994, CADE.

[3]  Larry Wos,et al.  Negative Paramodulation , 1986, CADE.

[4]  Michael J. Maher,et al.  Constraint Logic Programming: A Survey , 1994, J. Log. Program..

[5]  Miyuki Koshimura,et al.  MGTP: A Parallel Theorem Prover Based on Lazy Model Generation , 1992, CADE.

[6]  David A. Plaisted,et al.  Problem Solving by Searching for Models with a Theorem Prover , 1994, Artif. Intell..

[7]  Wolfgang Bibel,et al.  Constraint Satisfaction from a Deductive Viewpoint , 1988, Artif. Intell..

[8]  Alan K. Mackworth.  The Logic of Constraint Satisfaction , 1991, Artif. Intell..

[9]  KumarVipin.  Algorithms for constraint-satisfaction problems , 1992 .

[10]  Hilary Putnam,et al.  A Computing Procedure for Quantification Theory , 1960, JACM.

[11]  Vipin Kumar,et al.  Algorithms for Constraint-Satisfaction Problems: A Survey , 1992, AI Mag..

[12]  Masayuki Fujita,et al.  Automatic Generation of Some Results in Finite Algebra , 1993, IJCAI.

[13]  Tanel Tammet.  Using Resolution for Deciding Solvable Classes and Building Finite Models , 1991, Baltic Computer Science.

[14]  François Bry,et al.  SATCHMO: A Theorem Prover Implemented in Prolog , 1988, CADE.

[15]  M. Stickel,et al.  Automated reasoning and exhaustive search: Quasigroup existence problems☆ , 1995 .

[16]  Hantao Zhang,et al.  ModGen: Theorem Proving by Model Generation , 1994, AAAI.