Lookahead in smodels compared to local consistencies in CSP

Authors:
Jia-Huai You;Guohua Liu;Li Yan Yuan;Curtis Onuczko
Affiliations:
Department of Computing Science, University of Alberta, Edmonton, Alberta, Canada;Department of Computing Science, University of Alberta, Edmonton, Alberta, Canada;Department of Computing Science, University of Alberta, Edmonton, Alberta, Canada;Department of Computing Science, University of Alberta, Edmonton, Alberta, Canada
Venue:
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
Year:
2005

Citing 8
Cited 2

On the parallel complexity of discrete relaxation in constraint satisfaction networks

Artificial Intelligence
Improvements to propositional satisfiability search algorithms

Improvements to propositional satisfiability search algorithms
A machine program for theorem-proving

Communications of the ACM
Extending and implementing the stable model semantics

Artificial Intelligence
Logic programs with stable model semantics as a constraint programming paradigm

Annals of Mathematics and Artificial Intelligence
SAT v CSP

CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Singleton Consistencies

CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Domain filtering consistencies

Journal of Artificial Intelligence Research

Quartet-Based Phylogeny Reconstruction with Answer Set Programming

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
On the relation among answer set solvers

Annals of Mathematics and Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

In answer set programming systems like Smodels and some SAT solvers, constraint propagation is carried out by a mechanism called lookahead. The question arises as what is the pruning power of lookahead, and how such pruning power fares in comparison with the consistency techniques in solving CSPs. In this paper, we study the pruning power of lookahead by relating it to local consistencies under two different encodings from CSPs to answer set programs. This leads to an understanding of how the search space is pruned in an answer set solver with lookahead for solving CSPs. On the other hand, lookahead as a general constraint propagation mechanism provides a uniform algorithm for enforcing a variety of local consistencies. We also study the impact on the search efficiency under these encodings.