Abstract
This paper extends a constraint solver over the booleans to make it defeasible, and embeddable in a general architecture for defeasible constraint solving. This complements previous work on defeasible solvers over finite domains and rational numbers. Similar to the latter, one approach uses witness variables to detect minimal conflict sets of constraints, but adds important overhead. Other approaches use data dependencies, as in finite domains, to detect conflict sets. Although these are not minimal, such approaches seem more promising due to their less complexity.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
F. Benhamou, Boolean Constraints in Prolog III, in Constraint Logic Programming: Selected Research, F. Benhamou and A. Colmerauer (eds.), The MIT Press, 305–325, 1993.
A. Borning, M. Maher, A. Martindale and M. Wilson, Constraints Hierarchies and Logic Programming, in Proceedings of the Sixth International Conference on Logic Programming, MIT Press, 149–164, 1989.
R. Bryant, Graph-Based Logarithms for Boolean Function Manipulation, IEEE Trans. On Computers, August 1986.
W. Büttner and H. Simonis, Embedding Boolean Expressions into Logic Programming, Journal of Symbolic Computation, vol. 4, Academic Press, 191–205, 1987.
P. Codognet, D. Diaz, CLP(B): Combining Simplicity and Efficiency in Boolean Constraint Solving, in Programming Language Implementation and Logic Programming, M. Hermenegildo and J. Penjam (Eds.), Springer-Verlag, LNCS, vol. 844, 244–260, 1994.
P. Codognet, D. Diaz and F. Rossi, Constraint Retraction in FD, Foundations of Software Technology and Theoretical Computer Scienc, V. Chandru and V. Vinay (eds), Springer-Verlag, LNCS, Vol. 1180, 168–179, 1996.
M. Dincbas, P. Van Hentenryck, H. Simonis, A. Aggoun, T. Graf and F. Berthier, The Constraint Logic Programming Language CHIP, in Proceedings of the International Conference on Fifth Generation Computer Systems, FGCS-88, 693-702, Tokio, Japan, December 1988.
C. Holzbaur, F. Menezes and P. Barahona, Defeasibility in CLP(Q) through Generalised Slack Variables, in Principles Practice of Constraint Programming, E.C. Freuder (Ed.), Springer-Verlag, LNCS vol. 1118, 209–223, 1996.
M. Jampel, E. Freuder and M. Maher (Eds.), Over-Constrained Systems, Springer-Verlag, LNCS vol. 1106, 1996.
A. Kotzamanidis and C. Hogger, Intelligent Backtracking in a Logic Programming System with Linear Constraints over the Reals, Proceedings of PACT’96, Practical Applications of Constraint Technology, London, UK, pp 427–444, April 1996.
F. Menezes and P. Barahona, Preliminary Formalization of an Incremental Hierarchical Constraint Solver, Proceedings of EPIA’93, 6th Portuguese Conference on AI, Springer-Verlag, LNAI Vol. 727, 281–296, 1993.
F. Menezes and P. Barahona, An Incremental Hierarchical Constraint Solver, in Principles and Practice of Constraint Programming, V. Saraswat and P. Van Hentenryck (Eds.), MIT Press, 291–316, 1994.
F. Menezes and P. Barahona, Defeasible Constraint Solving, LNCS vol. 1106, Springer-Verlag, 151–170, 1996.
S. Menju, K. Sakai, Y. Sato and A. Aiba, A Study on Boolean Constraint Solvers, in Constraint Logic Programming: Selected Research, F. Benhamou and A. Colmerauer (eds.), The MIT Press, 252–267, 1993.
A. Rauzy, Using Enumerative methods for Boolean Unification, in Constraint Logic Programming: Selected Research, F. Benhamou and A. Colmerauer (eds.), The MIT Press, 237–251, 1993.
SICStusProlog User’s Manual, Swedish Institute of Computer Science, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Barahona, P. (1998). Defeasible Constraint Solving over the Booleans. In: Coelho, H. (eds) Progress in Artificial Intelligence — IBERAMIA 98. IBERAMIA 1998. Lecture Notes in Computer Science(), vol 1484. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49795-1_35
Download citation
DOI: https://doi.org/10.1007/3-540-49795-1_35
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64992-2
Online ISBN: 978-3-540-49795-0
eBook Packages: Springer Book Archive