Exploiting Functional Dependencies in Declarative Problem Specifications-Reference-Cited by-同舟云学术

Exploiting Functional Dependencies in Declarative Problem Specifications

Published:2004 Issue: Volume: Page:628-640
ISSN:0302-9743
Container-title:Logics in Artificial Intelligence
language:
Short-container-title:

Author:

Cadoli Marco,Mancini Toni

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-30227-8_52.pdf

Reference27 articles.

1. Lecture Notes in Computer Science;C.A. Brown,1989

2. Cadoli, M., Mancini, T.: Detecting and breaking symmetries on specifications. In: Proc. of the CP 2003 Int. Workshop on Symmetry in CSPs, pp. 13–26 (2003)

3. Cadoli, M., Mancini, T.: Automated reformulation of specifications by safe delay of constraints. In: Proc. of KR 2004, pp. 388–398. AAAI Press, Menlo Park (2004)

4. Cadoli, M., Mancini, T.: Using a theorem prover for reasoning on constraint problems. In: Proc. of the ETAPS 2004 CP+CV Int. Workshop, pp. 17–31 (2004)

5. Lecture Notes in Computer Science;M. Cadoli,2001

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

1. Closure via functional dependence simplification;International Journal of Computer Mathematics;2012-03

2. Instance Based Methods—A Brief Overview;KI - Künstliche Intelligenz;2010-02-05

3. USING A THEOREM PROVER FOR REASONING ON CONSTRAINT PROBLEMS;Applied Artificial Intelligence;2007-04-25

4. Exploiting Fixable, Removable, and Implied Values in Constraint Satisfaction Problems;Logic for Programming, Artificial Intelligence, and Reasoning;2005

5. Detecting and Breaking Symmetries by Reasoning on Problem Specifications;Lecture Notes in Computer Science;2005