Abstract
Though there exist some rules of thumb for design of good models for solving constraint satisfaction problems, the modeling process still belongs more to art than to science. Moreover, as new global constraints and search techniques are being developed, the modeling process is becoming even more complicated and a lot of effort and experience is required from the user. Hence (semi-) automated tools for improving efficiency of constraint models are highly desirable. The paper presents a low-information technique for discovering implied Boolean constraints in the form of equivalences, exclusions, and dependencies for any constraint model with (some) Boolean variables. The technique is not only completely independent of the constraint model (therefore a low-information technique), but it is also easy to implement because it is based on ideas of singleton consistency. Despite its simplicity, the proposed technique proved itself to be surprisingly efficient in our experiments.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Barták, R.: A Flexible Constraint Model for Validating Plans with Durative Actions. In: Planning, Scheduling and Constraint Satisfaction: From Theory to Practice. Frontiers in Artificial Intelligence and Applications, vol. 117, pp. 39–48. IOS Press, Amsterdam (2005)
Barták, R., Čepek, O.: Temporal Networks with Alternatives: Complexity and Model. In: FLAIRS 2007. Proceedings of the Twentieth International Florida AI Research Society Conference, AAAI Press (2007)
Barták, R., Čepek, O., Surynek, P.: Modelling Alternatives in Temporal Networks. In: CI-Sched 2007. Proceedings of the 2007 IEEE Symposium on Computational Intelligence in Scheduling, pp. 129–136. IEEE Press (2007)
Beck, J.Ch., Fox, M.S.: Scheduling Alternative Activities. In: Proceedings of the National Conference on Artificial Intelligence, pp. 680–687. AAAI Press (1999)
Debruyne, R., Bessière, C.: Some Practicable Filtering Techniques for the Constraint Satisfaction Problem. In: IJCAI. Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, pp. 412–417. Morgan Kaufmann, San Francisco (1997)
Dechter, R.: Learning while searching in constraint satisfaction problems. In: Proceedings of the Fifth National Conference on Artificial Intelligence, pp. 178–183. AAAI Press (1986)
Dechter, R., Meiri, I., Pearl, J.: Temporal Constraint Networks. Artificial Intelligence 49, 61–95 (1991)
Fages, F.: CLP versus LS on log-based reconciliation problems for nomadic applications. In: Proceedings of ERCIM/CompulogNet Workshop on Constraints, Praha (2001)
Hoos, H.H., Stützle, T.: SATLIB: An Online Resource for Research on SAT. In: SAT 2000, pp. 283–292. IOS Press, Amsterdam (2000), SATLIB is available online at www.satlib.org
Mariot, K., Stuckey, P.J.: Programming with Constraints: An Introduction. The MIT Press, Cambridge (1998)
Pardalos, P.M., Qian, T., Resende, M.G.: A greedy randomized adaptive search procedure for the feedback vertex set problem. Journal of Combinatorial Optimization 2, 399–412 (1999)
Pipatsrisawat, T., Darwiche, A.: RSat Solver, version 1.03 (accesessed, March 2007), http://reasoning.cs.ucla.edu/rsat/
Smith, B.: Modelling. A chapter in Handbook of Constraint Programming, pp. 377–406. Elsevier, Amsterdam (2006)
Stallman, R.M., Sussman, G.J.: Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis. Artificial Intelligence 9, 135–196 (1997)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Barták, R. (2007). Generating Implied Boolean Constraints Via Singleton Consistency. In: Miguel, I., Ruml, W. (eds) Abstraction, Reformulation, and Approximation. SARA 2007. Lecture Notes in Computer Science(), vol 4612. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73580-9_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-73580-9_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73579-3
Online ISBN: 978-3-540-73580-9
eBook Packages: Computer ScienceComputer Science (R0)