Wire Routing and Satisfiability Planning-Reference-Cited by-同舟云学术

Wire Routing and Satisfiability Planning

Published:2000 Issue: Volume: Page:822-836
ISSN:0302-9743
Container-title:Computational Logic — CL 2000
language:
Short-container-title:

Author:

Erdem Esra,Lifschitz Vladimir,Wong Martin D. F.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-44957-4_55

Reference16 articles.

1. Roberto Bayardo and Robert Schrag. Using CSP look-back techniques to solve real-world SAT instances. In Proc. IJCAI-97, pages 203–208, 1997.

2. Hector Geffner. Causal theories for nonmonotonic reasoning. In Proc. AAAI-90, pages 524–530. AAAI Press, 1990.

3. Michael Gelfond and Vladimir Lifschitz. Action languages. Electronic Transactions on AI, 3, 1998. http://www.ep.liu.se/ea/cis/1998/016 .

4. Enrico Giunchiglia and Vladimir Lifschitz. An action language based on causal explanation: Preliminary report. In Proc. AAAI-98, pages 623–630. AAAI Press, 1998.

5. Henry Kautz and Bart Selman. Planning as satisfiability. In Proc. ECAI-92, pages 359–363, 1992.

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

1. Answer Set Programming Modulo Acyclicity;Logic Programming and Nonmonotonic Reasoning;2015

2. Applications of Action Languages in Cognitive Robotics;Correct Reasoning;2012

3. Rectilinear Steiner Tree Construction Using Answer Set Programming;Logic Programming;2004

4. Strong Equivalence for Causal Theories;Logic Programming and Nonmonotonic Reasoning;2003

5. Representing Knowledge in A-Prolog;Computational Logic: Logic Programming and Beyond;2002