Exploiting Fixable, Removable, and Implied Values in Constraint Satisfaction Problems-Reference-Cited by-同舟云学术

Exploiting Fixable, Removable, and Implied Values in Constraint Satisfaction Problems

Published:2005 Issue: Volume: Page:270-284
ISSN:0302-9743
Container-title:Logic for Programming, Artificial Intelligence, and Reasoning
language:
Short-container-title:

Author:

Bordeaux Lucas,Cadoli Marco,Mancini Toni

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-32275-7_19.pdf

Reference24 articles.

1. Lecture Notes in Artificial Intelligence;M. Cadoli,2004

2. Cadoli, M., Mancini, T.: Using a theorem prover for reasoning on constraint problems. In: 3rd Int. CP Workshop on Modelling and Reformulating CSPs (2004)

3. Choueiry, B., Lal, A., Freuder, E.C.: Interchangeability and dynamic bundling for non-binary finite CSPs. In: Int. Workshop on Constraint Solving and Constraint Logic Programming (CSCLP), Springer, Heidelberg (2004) (page to appear)

4. Choueiry, B., Noubir, G.: On the computation of local interchangeability in discrete constraint satisfaction problems. In: Nat (US) Conf. on Artificial Intelligence (AAAI), pp. 326–333. AAAI, Menlo Park (1998)

5. Crawford, J.M.: A theoretical analysis of reasoning by symmetry in first-order logic (extended abstract). In: AAAI Workshop on Tractable Reasoning (1992)

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

1. A preference-based approach to backbone computation with application to argumentation;Proceedings of the 33rd Annual ACM Symposium on Applied Computing;2018-04-09

2. Solving quantified constraint satisfaction problems;Artificial Intelligence;2008-04