Decision Procedures Using Model Building Techniques

Few year ago we have developed an Automated Deduction approach to model building. The method, called RAMC looks simultaneously for inconsistencies and models for a given formula. The capabilities of RAMC have been extended both for model building and for unsatisfiability detection by including in it the use of semantic strategies. In the present work we go further in this direction and define more general and powerful semantic rules. These rules are an extension of Slagle's semantic resolution. The robustness of our approach is evidenced by proving that the method is also a decision procedure for a wide range of classes decidable by semantic resolution and in particular by hyper-resolution. Moreover, the method builds models for satisfiable formulae in these classes, in particular, for satisfiable formulae that do not have any finite model.

[1]  B. Dreben,et al.  The decision problem: Solvable classes of quantificational formulas , 1979 .

[2]  Ricardo Caferra,et al.  Extending Semantic Resolution via Automated Model Building: Applications , 1995, IJCAI.

[3]  James R. Slagle,et al.  Automatic Theorem Proving With Renamable and Semantic Resolution , 1967, JACM.

[4]  Ricardo Caferra,et al.  A Method for Simultanous Search for Refutations and Models by Equational Constraint Solving , 1992, J. Symb. Comput..

[5]  Alexander Leitsch.  Deciding Clause Classes by Semantic Clash Resolution , 1993, Fundam. Informaticae.

[6]  Christian G. Fermüller,et al.  Model Building by Resolution , 1992, CSL.

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

[8]  Grigori Mints,et al.  Proof theory in the USSR 1925–1969 , 1991, Journal of Symbolic Logic.

[9]  William H. Joyner.  Resolution Strategies as Decision Procedures , 1976, JACM.

[10]  Harry R. Lewis,et al.  Unsolvable classes of quantificational formulas , 1979 .

[11]  J. Cherniavsky.  Review of "Unsolvable classes of quantificational formulas" by Harry R. Lewis. Addison-Wesley 1979. and "The decision problem: solvable classes of quantificational formulas" by Burton Dreben and Warren D. Goldfarb. Addison-Wesley 1979. , 1982, SIGA.

[12]  Egon Börger,et al.  Decision Problems in Predicate Logic , 1984 .

[13]  Christian G. Fermüller,et al.  Hyperresolution and Automated Model Building , 1996, J. Log. Comput..

[14]  Ricardo Caferra,et al.  Model Building and Interactive Theory Discovery , 1995, TABLEAUX.

[15]  Christian G. Fermüller,et al.  Resolution Methods for the Decision Problem , 1993, Lecture Notes in Computer Science.