New Logical and Complexity Results for Signed-SAT

Authors:
Carlos Ansótegui;Felip Manyà
Affiliations:
-;-
Venue:
ISMVL '03 Proceedings of the 33rd International Symposium on Multiple-Valued Logic
Year:
2003

Citing 0
Cited 3

The logic behind weighted CSP

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
The Helly property and satisfiability of Boolean formulas defined on set families

European Journal of Combinatorics
An algorithm for random signed 3-SAT with intervals

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We define Mv-formulas as the union of the subclassesof signed CNF formulas known as regular and monosignedCNF formulas, and then define resolution calculi that arerefutation complete for Mv-formulas and give new complexityresults for the Horn-SAT and 2-SAT problems. Ourgoal is to use Mv-formulas as a constraint programminglanguage between CSP and SAT, and solve computationallydifficult combinatorial problems with efficient satisfiabilitysolvers for Mv-formulas. The results presented in this paperprovide evidence that Mv-formulas are a problem modelinglanguage that offers a good compromise between complexityand expressive power.