Unified Characterisations of Resolution Hardness Measures
نویسندگان
چکیده
Various “hardness” measures have been studied for resolution, providing theoretical insight into the proof complexity of resolution and its fragments, as well as explanations for the hardness of instances in SAT solving. In this paper we aim at a unified view of a number of hardness measures, including different measures of width, space and size of resolution proofs. Our main contribution is a unified game-theoretic characterisation of these measures. As consequences we obtain new relations between the different hardness measures. In particular, we prove a generalised version of Atserias and Dalmau’s result on the relation between resolution width and space from [5].
منابع مشابه
Hardness measures and resolution lower bounds
Various “hardness” measures have been studied for resolution, providing theoretical insight into the proof complexity of resolution and its fragments, as well as explanations for the hardness of instances in SAT solving. In this report we aim at a unified view of a number of hardness measures, including different measures of width, space and size of resolution proofs. We also extend these measu...
متن کاملCharacterisations of Termination in Logic Programming
The procedural interpretation of logic programs and queries is parametric to the selection rule, i.e. the rule that determines which atom is selected in each resolution step. Termination of logic programs and queries depends critically on the selection rule. In this survey, we present a unified view and comparison of seven notions of universal termination considered in the literature, and the c...
متن کاملRelating Proof Complexity Measures and Practical Hardness of SAT
Boolean satisfiability (SAT) solvers have improved enormously in performance over the last 10–15 years and are today an indispensable tool for solving a wide range of computational problems. However, our understanding of what makes SAT instances hard or easy in practice is still quite limited. A recent line of research in proof complexity has studied theoretical complexity measures such as leng...
متن کاملFoundations of Artificial Intelligence July 23 , 2010 10 : 00 – 10 : 30
The procedural interpretation of logic programs and queries is parametric to the selection rule, i.e. the rule that determines which atom is selected in each resolution step. Termination of logic programs and queries depends critically on the selection rule. In this survey, we present a unified view and comparison of seven notions of universal termination considered in the literature, and the c...
متن کاملThe effectiveness of transdiagnostic treatment by Unified Protocol on Symptoms of anxiety and depression comorbidity in housewives mothers
Introduction: The aim of the present study was to determine the efficacy of the Unified Protocol (UP) for transdiagnostic treatment on comorbid symptoms of depression and anxiety of housewife mothers. Methods: This investigation was carried out as a semi experimental test on 30 housewives mothers from a schools in the Alborz province with comorbid depression and anxiety, subsequent to primary ...
متن کامل