Abstract
Arc-consistency has been one of the most popular consistency techniques for space pruning in solving constraint satisfaction problems (CSPs), while lookahead appears to be its counterpart in answer set solvers. In this paper, we perform a theoretical comparison of their pruning powers, based on the translation of Niemelä from CSPs to answer set programs. Especially, we show two results. First, we show that lookahead is strictly stronger than arc-consistency. The extra pruning power comes from the ability to propagate unique values for variables, also called unit propagation in this paper, so that conflicts may be detected. This suggests that arc-consistency can be enhanced with unit propagation for CSPs. We then formalize this technique and show that, under the translation of Niemelä, it has exactly the same pruning power as lookahead.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Davis, M., Logemann, G., Loveland, D.: A machine program for theorem proving. Communications of the ACM 5(7), 394–397 (1962)
Dechter, R.: Constraint Processing. Morgan Kaufmann, San Francisco (2003)
Freeman, J.W.: Improvements to propositional satisfiability search algorithms. PhD thesis, Department of Computer and Information Science, University of Pennsylvania (1995)
Freuder, E.C.: Synthesizing constraint expressions. CACM 21(11), 958–966 (1978)
Van Gelder, A., Ross, K., Schlipf, J.: The well-founded semantics for general logic programs. Journal of the ACM 38(3), 620–650 (1991)
Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Proc. 5th ICLP, pp. 1070–1080. MIT Press, Cambridge (1988)
Gent, I.: Arc consistency in SAT. In: Proc. ECAI 2003, pp. 121–125 (2002)
Kasif, S.: On the parallel complexity of discrete relaxation in constraint satisfaction networks. Artificial Intelligence, 275–286 (1990)
Leone, N., et al.: DLV: a disjunctive datalog system, release 2000-10-15 (2000), At http://www.dbai.tuwien.ac.at/proj/dlv/
Mackworth, A.: Consistency in networks of relations. Artificial Intelligence 8(1), 99–118 (1977)
Marriott, K., Stucky, P.: Programming with Constraints. MIT Press, Cambridge (1998)
Niemelä, I.: Logic programs with stable model semantics as a constraint programming paradigm. Annals of Math. and Artificial Intelligence 25(3-4), 241–273 (1999)
Simons, P.: Extending and Implementing the Stable Model Semantics. PhD thesis, Helsinki University of Technology, Helsinki, Finland (2000)
Simons, P., Niemelä, I., Soininen, T.: Extending and implementing the stable model semantics. Artificial Intelligence 138(1-2) (2002)
Walsh, T.: CSP vs. SAT. In: Dechter, R. (ed.) CP 2000. LNCS, vol. 1894, pp. 441–456. Springer, Heidelberg (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
You, JH., Hou, G. (2004). Arc-Consistency + Unit Propagation = Lookahead. In: Demoen, B., Lifschitz, V. (eds) Logic Programming. ICLP 2004. Lecture Notes in Computer Science, vol 3132. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27775-0_22
Download citation
DOI: https://doi.org/10.1007/978-3-540-27775-0_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22671-0
Online ISBN: 978-3-540-27775-0
eBook Packages: Springer Book Archive