7 research outputs found
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]
Finding Tractable Formulas in NNF
Many applications in Computer Science require to represent knowledge and to reason with non normal form formulas. However, most of the advances in tractable reasoning are applied only to CNF formulas. In this paper, we extend tractability to several classes of non normal formulas which are of high practical interest. Thus, we first define three non normal Horn-like classes of formulas F1 F2 : : : Fn where each F i is constituted by a disjunction of two optional terms F i = NNF \Gamma i C + i : the first one is in Negation Normal Form (NNF) composed exclusively with negative literals and the second one is a conjunction of positive propositions. These formulas codify the same problems that the Horn formulas but with significantly, even exponentially, less propositional symbols. Second, we define sound and refutational complete inference rule sets for each class. Our third contribution consists in the design of a sound, complete and strictly linear running time algorit..
Disjunctive Logic Programming: A Survey And Assessment
We describe the elds of disjunctive logic programming and disjunctive deductive databases from the time of their inception to the current time. Contributions with respect to semantics, implementations and applications are surveyed