Author:
Pulina Luca,Tacchella Armando
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Software
Reference44 articles.
1. Aha, D., & Kibler, D. (1991). Instance-based learning algorithms. Machine Learning, 6, 37–66.
2. Ansotegui, C., Gomes, C. P., & Selman, B. (2005). Achille’s heel of QBF. In Proc. of AAAI (pp. 275–281).
3. Benedetti, M. (2005). sKizzo: A suite to evaluate and certify QBFs. In 20th int’l. conference on automated deduction, Lecture notes in computer science (Vol. 3632, pp. 369–376). Springer.
4. Biere, A. (2005). Resolve and expand. In Seventh intl. conference on theory and applications of satisfiability testing (SAT’04), LNCS (Vol. 3542, pp. 59–70).
5. Castellini, C., Giunchiglia, E., & Tacchella, A. (2003). SAT-based planning in complex domains: Concurrency, constraints and nondeterminism. Artificial Intelligence, 147, 85–117.
Cited by
57 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献