Monotone Literals and Learning in QBF Reasoning-Reference-Cited by-同舟云学术

Monotone Literals and Learning in QBF Reasoning

Published:2004 Issue: Volume: Page:260-273
ISSN:0302-9743
Container-title:Principles and Practice of Constraint Programming – CP 2004
language:
Short-container-title:

Author:

Giunchiglia Enrico,Narizzano Massimo,Tacchella Armando

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-30201-8_21.pdf

Reference20 articles.

1. Cadoli, M., Schaerf, M., Giovanardi, A., Giovanardi, M.: An algorithm to evaluate quantified boolean formulae and its experimental evaluation. Journal of Automated Reasoning 28(2), 101–142 (2002)

2. Giunchiglia, E., Narizzano, M., Tacchella, A.: Learning for Quantified Boolean Logic Satisfiability. In: 18th National Conference on Artificial Intelligence (AAAI 2002), AAAI Press/MIT Press (2002)

3. Lecture Notes in Computer Science;D. Berre Le,2004

4. Lecture Notes in Artificial Intelligence;E. Giunchiglia,2001

5. Giunchiglia, E., Narizzano, M., Tacchella, A.: Backjumping for Quantified Boolean Logic Satisfiability. In: Seventeenth International Joint Conference on Artificial Intelligence (IJCAI 2001), Morgan Kaufmann, San Francisco (2001)

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

1. Reasoning with Propositional Logic: From SAT Solvers to Knowledge Compilation;A Guided Tour of Artificial Intelligence Research;2020

2. Symmetries of Quantified Boolean Formulas;Theory and Applications of Satisfiability Testing – SAT 2018;2018

3. Contributions to the Theory of Practical Quantified Boolean Formula Solving;Lecture Notes in Computer Science;2012

4. Extended Failed-Literal Preprocessing for Quantified Boolean Formulas;Theory and Applications of Satisfiability Testing – SAT 2012;2012

5. Integrating Dependency Schemes in Search-Based QBF Solvers;Theory and Applications of Satisfiability Testing – SAT 2010;2010