loading...
Automated reasoning on monotonic constraints
Vancouver, British Columbia, Canada November 13-November 15
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TAI.2000.88990012th IEEE International Conference on ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
L. Bordeaux, IRIN, Nantes Univ., France
F. Benhamou, IRIN, Nantes Univ., France
Abstract: We study the properties of monotonic parts of (continuous) constraints. We design a general framework to reason about them : directions can be abstracted by signs, which capture significant information on the location of solutions. We show that this formalism is appropriate to study the relative position of solution sets. Efficient algorithms are proposed to diagnose the behaviour of some consistency techniques. These methods raise new perspectives on an open issue: the prediction of the consistency technique to be used wrt a given problem.
Index Terms:
inference mechanisms; constraint handling; automated reasoning; monotonic constraints; consistency techniques
Citation:
L. Bordeaux, F. Benhamou, "Automated reasoning on monotonic constraints," ictai, pp.0401, 12th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'00), 2000
Usage of this product signifies your acceptance of the Terms of Use.