-
1
-
-
84944414500
-
Bounded model construction for monadic second-order logics
-
No. 1855 in Lecture Notes in Computer Science, Chicago, USA. Springer-Verlag
-
Abdelwaheb, A., & Basin, D. (2000). Bounded model construction for monadic second-order logics. In 12th International Conference on Computer-Aided Verification (CAV'00), No. 1855 in Lecture Notes in Computer Science, pp. 99-113, Chicago, USA. Springer-Verlag.
-
(2000)
12th International Conference on Computer-aided Verification (CAV'00)
, pp. 99-113
-
-
Abdelwaheb, A.1
Basin, D.2
-
2
-
-
0009858375
-
Resolution theorem proving
-
Robinson, A., & Voronkov, A. (Eds.), chap. 2, Elsevier Science
-
Bachmair, L., & Ganzinger, H. (2001). Resolution theorem proving. In Robinson, A., & Voronkov, A. (Eds.), Handbook of Automated Reasoning, Vol. I, chap. 2, pp. 19-99. Elsevier Science.
-
(2001)
Handbook of Automated Reasoning
, vol.1
, pp. 19-99
-
-
Bachmair, L.1
Ganzinger, H.2
-
5
-
-
0036476801
-
An algorithm to evaluate quantified Boolean formulae and its experimental evaluation
-
Cadoli, M., Schaerf, M., Giovanardi, A., & Giovanardi, M. (2002). An algorithm to evaluate quantified Boolean formulae and its experimental evaluation. Journal of Automated Reasoning, 28, 101-142.
-
(2002)
Journal of Automated Reasoning
, vol.28
, pp. 101-142
-
-
Cadoli, M.1
Schaerf, M.2
Giovanardi, A.3
Giovanardi, M.4
-
6
-
-
0031632503
-
An algorithm to evaluate Quantified Boolean Formulae
-
Menlo Park. AAAI Press
-
Cadoli, M., Giovanardi, A., & Schaerf, M. (1998). An algorithm to evaluate Quantified Boolean Formulae. In Proceedings of the 15th National Conference on Artificial Intelligence (AAAI-98) and of the 10th Conference on Innovative Applications of Artificial Intelligence (IAAI-98), pp. 262-267, Menlo Park. AAAI Press.
-
(1998)
Proceedings of the 15th National Conference on Artificial Intelligence (AAAI-98) and of the 10th Conference on Innovative Applications of Artificial Intelligence (IAAI-98)
, pp. 262-267
-
-
Cadoli, M.1
Giovanardi, A.2
Schaerf, M.3
-
8
-
-
0037503164
-
SAT-based planning in complex domains: Concurrency, constraints and nondeterminism
-
Castellini, C., Giunchiglia, E., & Tacchella, A. (2003). SAT-based planning in complex domains: Concurrency, constraints and nondeterminism. Artificial Intelligence, 147(12), 85-117.
-
(2003)
Artificial Intelligence
, vol.147
, Issue.12
, pp. 85-117
-
-
Castellini, C.1
Giunchiglia, E.2
Tacchella, A.3
-
9
-
-
84919401135
-
A machine program for theorem proving
-
Davis, M., Logemann, G., & Loveland, D. W. (1962). A machine program for theorem proving. Communication of ACM, 5(7), 394-397.
-
(1962)
Communication of ACM
, vol.5
, Issue.7
, pp. 394-397
-
-
Davis, M.1
Logemann, G.2
Loveland, D.W.3
-
11
-
-
0025228149
-
Enhancement schemes for constraint processing: Backjumping, learning, and cutset decomposition
-
Dechter, R. (1990). Enhancement schemes for constraint processing: Backjumping, learning, and cutset decomposition. Artificial Intelligence, 41(3), 273-312.
-
(1990)
Artificial Intelligence
, vol.41
, Issue.3
, pp. 273-312
-
-
Dechter, R.1
-
12
-
-
0002612248
-
Resolution decision procedures
-
Robinson, A., & Voronkov, A. (Eds.), chap. 25, Elsevier Science B.V
-
Fermüller, C. G., Leitsch, A., Hustadt, U., & Tammet, T. (2001). Resolution decision procedures. In Robinson, A., & Voronkov, A. (Eds.), Handbook of Automated Reasoning, Vol. II, chap. 25, pp. 1791-1849. Elsevier Science B.V.
-
(2001)
Handbook of Automated Reasoning
, vol.2
, pp. 1791-1849
-
-
Fermüller, C.G.1
Leitsch, A.2
Hustadt, U.3
Tammet, T.4
-
13
-
-
26444480521
-
Watched data structures for QBF solvers
-
Giunchiglia, E., & Tacchella, A. (Eds.), Theory and Applications of Satisfiability Testing, 6th International Conference, SAT 2003. Santa Margherita Ligure, Italy, May 5-8, 2003 Selected Revised Papers, Springer
-
Gent, I., Giunchiglia, E., Narizzano, M., Rowley, A., & Tacchella, A. (2004). Watched data structures for QBF solvers. In Giunchiglia, E., & Tacchella, A. (Eds.), Theory and Applications of Satisfiability Testing, 6th International Conference, SAT 2003. Santa Margherita Ligure, Italy, May 5-8, 2003 Selected Revised Papers, Vol. 2919 of Lecture Notes in Computer Science, pp. 25-36. Springer.
-
(2004)
Lecture Notes in Computer Science
, vol.2919
, pp. 25-36
-
-
Gent, I.1
Giunchiglia, E.2
Narizzano, M.3
Rowley, A.4
Tacchella, A.5
-
14
-
-
26444521474
-
Solution learning and solution directed backjumping revisited
-
APES Research Group
-
Gent, I. P., & Rowley, A. G. (2004). Solution learning and solution directed backjumping revisited. Tech. rep. APES-80-2004, APES Research Group. Available from http://www.dcs.st-and.ac.uk/~apes/apesreports.html.
-
(2004)
Tech. Rep.
, vol.APES-80-2004
-
-
Gent, I.P.1
Rowley, A.G.2
-
17
-
-
0036927770
-
Learning for quantified boolean logic satisfiability
-
Giunchiglia, E., Narizzano, M., & Tacchella, A. (2002). Learning for Quantified Boolean Logic Satisfiability. In Proceedings of the Eighteenth National Conference on Artificial Intelligence and Fourteenth Conference on Innovative Applications of Artificial Intelligence, July 28 - August 1, 2002, Edmonton, Alberta, Canada. AAAI Press, 2002, pp. 649-654.
-
(2002)
Proceedings of the Eighteenth National Conference on Artificial Intelligence and Fourteenth Conference on Innovative Applications of Artificial Intelligence, July 28 - August 1, 2002, Edmonton, Alberta, Canada. AAAI Press, 2002
, pp. 649-654
-
-
Giunchiglia, E.1
Narizzano, M.2
Tacchella, A.3
-
18
-
-
0037380443
-
Backjumping for quantified boolean logic satisfiability
-
Giunchiglia, E., Narizzano, M., & Tacchella, A. (2003). Backjumping for Quantified Boolean Logic Satisfiability. Artificial Intelligence, 145, 99-120.
-
(2003)
Artificial Intelligence
, vol.145
, pp. 99-120
-
-
Giunchiglia, E.1
Narizzano, M.2
Tacchella, A.3
-
19
-
-
35048815626
-
Monotone literals and learning in QBF reasoning
-
Giunchiglia, E., Narizzano, M., & Tacchella, A. (2004a). Monotone literals and learning in QBF reasoning. In Tenth International Conference on Principles and Practice of Constraint Programming, CP 2004, pp. 260-273.
-
(2004)
Tenth International Conference on Principles and Practice of Constraint Programming, CP 2004
, pp. 260-273
-
-
Giunchiglia, E.1
Narizzano, M.2
Tacchella, A.3
-
20
-
-
26444559520
-
Qbf reasoning on real-world instances
-
Giunchiglia, E., Narizzano, M., & Tacchella, A. (2004b). Qbf reasoning on real-world instances. In Theory and Applications of Satisfiability Testing, 7th International Conference, SAT 2004, Vancouver, BC, Canada, May 10-13, 2004, Revised Selected Papers, pp. 105-121.
-
(2004)
Theory and Applications of Satisfiability Testing, 7th International Conference, SAT 2004, Vancouver, BC, Canada, May 10-13, 2004, Revised Selected Papers
, pp. 105-121
-
-
Giunchiglia, E.1
Narizzano, M.2
Tacchella, A.3
-
21
-
-
35048828305
-
Qube++: An efficient qbf solver
-
Giunchiglia, E., Narizzano, M., & Tacchella, A. (2004c). Qube++: An efficient qbf solver. In 5th International Conference on Formal Methods in Computer-Aided Design, FMCAD 2004, pp. 201-213.
-
(2004)
5th International Conference on Formal Methods in Computer-aided Design, FMCAD 2004
, pp. 201-213
-
-
Giunchiglia, E.1
Narizzano, M.2
Tacchella, A.3
-
22
-
-
0002037968
-
Resolution for quantified Boolean formulas
-
Kleine-Büning, H., Karpinski, M., & Flögel, A. (1995). Resolution for quantified Boolean formulas. Information and Computation, 117(1], 12-18.
-
(1995)
Information and Computation
, vol.117
, Issue.1
, pp. 12-18
-
-
Kleine-Büning, H.1
Karpinski, M.2
Flögel, A.3
-
23
-
-
25144445259
-
Challenges in the QBF arena: The SAT'03 evaluation of QBF solvers
-
Sixth International Conference on Theory and Applications of Satisfiability Testing (SAT 2003), Springer Verlag
-
Le Berre, D., Simon, L., & Tacchella, A. (2003). Challenges in the QBF arena: the SAT'03 evaluation of QBF solvers. In Sixth International Conference on Theory and Applications of Satisfiability Testing (SAT 2003), Vol. 2919 of LNCS. Springer Verlag.
-
(2003)
LNCS
, vol.2919
-
-
Le Berre, D.1
Simon, L.2
Tacchella, A.3
-
24
-
-
84885191825
-
Lemma and model caching in decision procedures for quantified Boolean formulas
-
LNAI 2381, Springer
-
Letz, R. (2002). Lemma and model caching in decision procedures for quantified Boolean formulas. In Proceedings of Tableaux 2002, LNAI 2381, pp. 160-175. Springer.
-
(2002)
Proceedings of Tableaux 2002
, pp. 160-175
-
-
Letz, R.1
-
26
-
-
0034852165
-
Chaff: Engineering an efficient SAT solver
-
Moskewicz, M. W., Madigan, C. F., Zhao, Y., Zhang, L., & Malik, S. (2001). Chaff: Engineering an Efficient SAT Solver. In Proceedings of the 38th Design Automation Conference (DAC'Ol), pp. 530-535.
-
(2001)
Proceedings of the 38th Design Automation Conference (DAC'Ol)
, pp. 530-535
-
-
Moskewicz, M.W.1
Madigan, C.F.2
Zhao, Y.3
Zhang, L.4
Malik, S.5
-
27
-
-
1642581004
-
Optimizing a BDD-based modal solver
-
Pan, G., & Vardi, M. Y. (2003). Optimizing a BDD-based modal solver. In Automated Deduction - CADE-19, 19th International Conference on Automated Deduction Miami Beach, FL, USA, July 28 - August 2, 2003, Proceedings, pp. 75-89.
-
(2003)
Automated Deduction - CADE-19, 19th International Conference on Automated Deduction Miami Beach, FL, USA, July 28 - August 2, 2003, Proceedings
, pp. 75-89
-
-
Pan, G.1
Vardi, M.Y.2
-
30
-
-
0001372340
-
Hybrid algorithms for the constraint satisfaction problem
-
Prosser, P. (1993b). Hybrid algorithms for the constraint satisfaction problem. Computational Intelligence, 5(3), 268-299.
-
(1993)
Computational Intelligence
, vol.5
, Issue.3
, pp. 268-299
-
-
Prosser, P.1
-
31
-
-
0033332766
-
Constructing conditional plans by a theorem prover
-
Rintanen, J. (1999). Constructing conditional plans by a theorem prover. Journal of Artificial Intelligence Research, 10, 323-352.
-
(1999)
Journal of Artificial Intelligence Research
, vol.10
, pp. 323-352
-
-
Rintanen, J.1
-
32
-
-
84918983692
-
A machine-oriented logic based on the resolution principle
-
Robinson, A. (1965). A machine-oriented logic based on the resolution principle. Journal of the ACM, 12(1), 23-41.
-
(1965)
Journal of the ACM
, vol.12
, Issue.1
, pp. 23-41
-
-
Robinson, A.1
-
33
-
-
0011150067
-
The generalized resolution principle
-
Oliver and Boyd, Edinburgh
-
Robinson, A. (1968). The generalized resolution principle. In Machine Intelligence, Vol. 3, pp. 77-93. Oliver and Boyd, Edinburgh.
-
(1968)
Machine Intelligence
, vol.3
, pp. 77-93
-
-
Robinson, A.1
-
35
-
-
0003214883
-
On the complexity of proofs in prepositional logics
-
Tseitin, G. (1970). On the complexity of proofs in prepositional logics. Seminars in Mathematics, 8.
-
(1970)
Seminars in Mathematics
, vol.8
-
-
Tseitin, G.1
-
36
-
-
84974079324
-
The complexity of propositional proofs
-
Urquhart, A. (1995). The complexity of propositional proofs. The Bulletin of Symbolic Logic, 1(4:), 425-467.
-
(1995)
The Bulletin of Symbolic Logic
, vol.1
, Issue.4
, pp. 425-467
-
-
Urquhart, A.1
-
37
-
-
0035209012
-
Efficient conflict driven learning in a Boolean satisfiability solver
-
Zhang, L., Madigan, C. F., Moskewicz, M. W., & Malik, S. (2001). Efficient conflict driven learning in a Boolean satisfiability solver. In International Conference on ComputerAided Design (ICCAD'01), pp. 279-285.
-
(2001)
International Conference on ComputerAided Design (ICCAD'01)
, pp. 279-285
-
-
Zhang, L.1
Madigan, C.F.2
Moskewicz, M.W.3
Malik, S.4
|