11 search results - page 2 / 3 » On 2-SAT and Renamable Horn |
JAIR
2006
13 years 5 months ago
2006
A -model is a satisfying assignment of a Boolean formula for which any small alteration, such as a single bit flip, can be repaired by flips to some small number of other bits, yi...
ICTAI
2008
IEEE
13 years 11 months ago
2008
IEEE
Handling redundancy in propositional reasoning and search is an active path of theoretical research. For instance, the complexity of some redundancy-related problems for CNF formu...
ICTAI
2006
IEEE
13 years 11 months ago
2006
IEEE
In this paper a new approach for computing Strong Backdoor sets of boolean formula in conjunctive normal form (CNF) is proposed. It makes an original use of local search technique...
IANDC
2006
13 years 5 months ago
2006
This paper studies the complexity of learning classes of expressions in propositional logic from equivalence queries and membership queries. In particular, we focus on bounding th...
IJCAI
1997
13 years 6 months ago
1997
Tractable covers are introduced as a new ap proach to equivalence-preserving compilation of propositional knowledge bases. First, a gen eral framework is presented. Then, two ...