Variable Dependencies and Q-Resolution
暂无分享,去创建一个
[1] Frank Wolter,et al. Monodic fragments of first-order temporal logics: 2000-2001 A.D , 2001, LPAR.
[2] Mikolás Janota,et al. On Propositional QBF Expansions and Q-Resolution , 2013, SAT.
[3] Uwe Bubeck,et al. Model-based transformations for quantified boolean formulas , 2010, DISKI.
[4] Armin Biere,et al. Integrating Dependency Schemes in Search-Based QBF Solvers , 2010, SAT.
[5] Alessandro Cimatti,et al. Theory and Applications of Satisfiability Testing – SAT 2012 , 2012, Lecture Notes in Computer Science.
[6] Armando Tacchella,et al. Clause/Term Resolution and Learning in the Evaluation of Quantified Boolean Formulas , 2006, J. Artif. Intell. Res..
[7] Jie-Hong Roland Jiang,et al. Unified QBF certification and its applications , 2012, Formal Methods Syst. Des..
[8] Armin Biere,et al. Resolution-Based Certificate Extraction for QBF - (Tool Presentation) , 2012, SAT.
[9] Albert R. Meyer,et al. Word problems requiring exponential time(Preliminary Report) , 1973, STOC.
[10] Stefan Szeider,et al. Computing Resolution-Path Dependencies in Linear Time , , 2012, SAT.
[11] Marko Samer. Variable Dependencies of Quantified CSPs , 2008, ICLP 2008.
[12] Matti Järvisalo,et al. Theory and Applications of Satisfiability Testing – SAT 2013 , 2013, Lecture Notes in Computer Science.
[13] Marko Samer,et al. Backdoor Sets of Quantified Boolean Formulas , 2008, Journal of Automated Reasoning.
[14] Hans Kleine Büning,et al. Boolean Functions as Models for Quantified Boolean Formulas , 2007, Journal of Automated Reasoning.
[15] Joseph Boudou,et al. Compression of Propositional Resolution Proofs by Lowering Subproofs , 2013, TABLEAUX.
[16] Hans K. Buning,et al. Propositional Logic: Deduction and Algorithms , 1999 .
[17] Marco Schaerf,et al. An Algorithm to Evaluate Quantified Boolean Formulae and Its Experimental Evaluation , 2002, Journal of Automated Reasoning.
[18] Ofer Strichman,et al. Theory and Applications of Satisfiability Testing – SAT 2010 , 2010, Lecture Notes in Computer Science.
[19] Fahiem Bacchus,et al. A Uniform Approach for Generating Proofs and Strategies for Both True and False QBF Formulas , 2011, IJCAI.
[20] Allen Van Gelder. Variable Independence and Resolution Paths for Quantified Boolean Formulas , 2011, CP.
[21] Roy Dyckhoff. Automated Reasoning with Analytic Tableaux and Related Methods , 2000, Lecture Notes in Computer Science.
[22] At Linz,et al. Dependency Schemes and Search-Based QBF Solving: Theory and Practice , 2012 .
[23] Hans Kleine Büning,et al. Resolution for Quantified Boolean Formulas , 1995, Inf. Comput..