Constraint-Based Methods

  • Ricardo Caferra
  • Alexander Leitsch
  • Nicholas Peltier
Part of the Applied Logic Series book series (APLS, volume 31)


The methods presented in this chapter are based on the use of constrained formulae, and are devoted to the principle of simultaneous search for refutations and models (respectively proofs and countermodels). They are extensions of proof procedures (resolution and tableaux) obtained by adding new rules, so-called disinference rules, to the standard inference rules. The purpose of these new rules is to discard redundant instances of formulae or of clauses. The expression of these redundant instances (by constraints) prevents some further applications of inference rules and thus leads to a reduction of the search space. In some cases, the method may produce Herbrand models, represented by sets of constrained literals. By the principle of lazy unification, constraint-based inference is efficient and useful also in ordinary refutational theorem proving without features of model building.


Equational Problem Ground Term Ground Instance Equational Formula Deletion Rule 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media Dordrecht 2004

Authors and Affiliations

  • Ricardo Caferra
    • 1
  • Alexander Leitsch
    • 2
  • Nicholas Peltier
    • 3
  1. 1.Laboratory Leibniz — IMAG, INPGGrenobleFrance
  2. 2.Vienna University of TechnologyAustria
  3. 3.Laboratory Leibniz — IMAG, CNRSGrenobleFrance

Personalised recommendations