메뉴 건너뛰기




Volumn 26, Issue , 2006, Pages 371-416

Clause/term resolution and learning in the evaluation of quantified boolean formulas

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; FORMAL LOGIC; FUNCTION EVALUATION; INFERENCE ENGINES; LEARNING SYSTEMS; THEOREM PROVING;

EID: 33749033103     PISSN: 10769757     EISSN: 10769757     Source Type: Journal    
DOI: 10.1613/jair.1959     Document Type: Article
Times cited : (120)

References (39)
  • 1
    • 84944414500 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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
  • 8
    • 0037503164 scopus 로고    scopus 로고
    • 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
  • 11
    • 0025228149 scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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
  • 23
    • 25144445259 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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
  • 30
    • 0001372340 scopus 로고
    • 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
  • 32
    • 84918983692 scopus 로고
    • 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 scopus 로고
    • 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 scopus 로고
    • 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 scopus 로고
    • 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


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.