Solution Directed Backjumping for QCSP-Reference-Cited by-同舟云学术

Solution Directed Backjumping for QCSP

Published: Issue: Volume: Page:148-163
ISSN:
Container-title:Principles and Practice of Constraint Programming – CP 2007
language:
Short-container-title:

Author:

Bacchus Fahiem,Stergiou Kostas

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-74970-7_13.pdf

Reference16 articles.

1. Ali, M.F., Safarpour, S., Veneris, A., Abadir, M.S., Drechsler, R.: Post-verification debugging of hierarchical designs. In: International Conf. on Computer Aided Design (ICCAD), pp. 871–876 (2005)

2. Bacchus, F., van Beek, P.: On the conversion between non-binary and binary constraint satisfaction problems. In: Proceedings of AAAI 1998, pp. 311–318 (1998)

3. Bacchus, F., Walsh, T.: Propagating logical combinations of constraints. In: Proc. of 19th IJCAI, pp. 35–40 (2005)

4. Lecture Notes in Artificial Intelligence;M. Benedetti,2006

5. Bordeaux, L., Cadoli, M., Mancini, T.: CSP Properties for Quantified Constraints: Definitions and Complexity. In: Proceedings of AAAI 2005, pp. 360–365 (2005)

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Solving quantified constraint satisfaction problems with value selection rules;Frontiers of Computer Science;2020-03-16

2. Treewidth-Aware Quantifier Elimination and Expansion for QCSP;Lecture Notes in Computer Science;2020

3. Integrating Standard Dependency Schemes in QCSP Solvers;Journal of Computer Science and Technology;2012-01

4. Non-binary quantified CSP: algorithms and modelling;Constraints;2009-01-21