Soundness of Q-resolution with dependency schemes
نویسندگان
چکیده
منابع مشابه
Soundness of Q-resolution with dependency schemes
Article history: Received 1 December 2014 Received in revised form 16 May 2015 Accepted 9 October 2015 Available online 20 October 2015 Communicated by N. Shankar
متن کاملDependency Schemes and Q-resolution
We propose Q(D)-resolution, a proof system for Quantified Boolean Formulas. Q(D)-resolution is a generalization of Q-resolution parameterized by a dependency scheme D. This system is motivated by the generalization of the QDPLL algorithm using dependency schemes implemented in the solver DepQBF. We prove soundness of Q(D)-resolution for a dependency scheme D that is strictly more general than t...
متن کاملLong Distance Q-Resolution with Dependency Schemes
Resolution proof systems for quantified Boolean formulas (QBFs) provide a formal model for studying the limitations of state-of-the-art search-based QBF solvers that use these systems to generate proofs. We study a proof system that combines two proof systems supported by the solver DepQBF: Q-resolution with generalized universal reduction according to a dependency scheme and long distance Q-re...
متن کاملDependency Schemes in QBF Calculi: Semantics and Soundness
We study the parametrization of QBF resolution calculi by dependency schemes. One of the main problems in this area is to understand for which dependency schemes the resulting calculi are sound. Towards this end we propose a semantic framework for variable independence based on ‘exhibition’ by QBF models, and use it to define a property of dependency schemes called full exhibition. We prove tha...
متن کاملCoinductive Soundness of Corecursive Type Class Resolution
Horn clauses and first-order resolution are commonly used for the implementation of type classes in Haskell. Recently, several corecursive extensions to type class resolution have been proposed, with the common goal of allowing (co)recursive dictionary construction for those cases when resolution does not terminate. This paper shows, for the first time, that corecursive type class resolution an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2016
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2015.10.020