Solving constraint satisfaction problems with SAT modulo theories-Reference-Cited by-同舟云学术

Solving constraint satisfaction problems with SAT modulo theories

Published:2012-05-26 Issue:3 Volume:17 Page:273-303
ISSN:1383-7133
Container-title:Constraints
language:en
Short-container-title:Constraints

Author:

Bofill Miquel,Palahí Miquel,Suy Josep,Villaret Mateu

Publisher

Springer Science and Business Media LLC

Subject

Artificial Intelligence,Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Software

Link

http://link.springer.com/content/pdf/10.1007/s10601-012-9123-1.pdf

Reference39 articles.

1. Ackermann, W. (1954). Solvable cases of the decision problem. Studies in logic and the foundations of mathematics. North-Holland, Amsterdam.

2. Apt, K. R., & Wallace, M. (2007). Constraint logic programming using eclipse. New York: Cambridge University Press.

3. Banković, M., & Marić, F. (2010). An Alldifferent constraint solver in SMT. In Proceedings of the 8th international workshop on satisfiability modulo theories.

4. Barrett, C., Stump, A., & Tinelli, C. (2010). The Satisfiability Modulo Theories Library (SMT-LIB). http://www.SMT-LIB.org . Accessed 16 May 2012.

5. Barrett, C., Stump, A., & Tinelli, C. (2010). The SMT-LIB standard: Version 2.0. In Proceedings of the 8th international workshop on satisfiability modulo theories.

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

1. Model-based fleet deployment in the IoT–edge–cloud continuum;Software and Systems Modeling;2022-05-03

2. Multi-agent pathfinding with continuous time;Artificial Intelligence;2022-04

3. Automated Design of Elevator Systems: Experimenting with Constraint-Based Approaches;AIxIA 2021 – Advances in Artificial Intelligence;2022

4. Continuous Multi-agent Path Finding via Satisfiability Modulo Theories (SMT);Lecture Notes in Computer Science;2021

5. Bounded Suboptimal Token Swapping;2020 IEEE 32nd International Conference on Tools with Artificial Intelligence (ICTAI);2020-11