Fran¸cois Bry and Sunna Torge. Model generation for applications -- a tableaux method complete for finite satisfiability. Technical Report PMSFB -1997-15, Institut fur Informatik, LMU Munchen, 1997. 16 Norbert Eisinger and Tim Geisler  Home/Search   Document Not in Database   Summary   Related Articles

.... splitting called folding down in [LMG94] was already introduced in [MB88] Complement splitting contributes not only to efficiency, but also to a method that generates all minimal models but no nonminimal ones [BY96] Another, called extended delta rule, contributes to the EP tableau method [BT97], which is complete for both unsatisfiability and finite satisfiability. The latter refinement handles non clausal formulas and treats existential quantifiers in a way different from Skolemization. It has been applied to the constraint satisfiability problem during the schema design phase of ....

....introduce function symbols. Skolemization may transform a finitely satisfiable set of formulas into a form with an infinite Herbrand universe where no finite subset of the Herbrand base represents a model. This effect can be avoided by using the extended delta rule for existential quantifiers [BT97]. Equality Elimination. In the given examples, the equality predicate is used in two different syntactic situations: one argument is ground (e.g. X = c) both arguments are variables Looking at the former situation in detail, the occurrences of the variable X show one of the patterns 8X ....

Fran¸cois Bry and Sunna Torge. Model generation for applications -- a tableaux method complete for finite satisfiability. Technical Report PMSFB -1997-15, Institut fur Informatik, LMU Munchen, 1997. 16 Norbert Eisinger and Tim Geisler

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC