Continuous First-Order Constraint Satisfaction with Equality and Disequality Constraints

  • Stefan Ratschan
Conference paper

DOI: 10.1007/3-540-46135-3_45

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2470)
Cite this paper as:
Ratschan S. (2002) Continuous First-Order Constraint Satisfaction with Equality and Disequality Constraints. In: Van Hentenryck P. (eds) Principles and Practice of Constraint Programming - CP 2002. CP 2002. Lecture Notes in Computer Science, vol 2470. Springer, Berlin, Heidelberg

Abstract

In an earlier paper we have shown, how one can successfully use constraint satisfaction techniques for proving and solving formulae in the first-order predicate language over the real numbers (i.e., real first-order constraints). This approach was restricted to inputs that contain inequality symbols such as ≤, but no equality symbols (=) or disequality symbols (≠). In this paper we lay the basis for extending this approach to inputs that contain (dis)equalities. This considerably widens the practical applicability of numerical constraint satisfaction methods.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Stefan Ratschan
    • 1
  1. 1.Institut d’Informatica i AplicacionsUniversitat de GironaSpain

Personalised recommendations