77 search results - page 2 / 16 » Testing Basic Boolean Formulae |
ECAI
2004
Springer
13 years 8 months ago
2004
Springer
Quantified Constraint Satisfaction Problems (QCSPs) are CSPs in which some variables are universally quantified. For each possible value of such variables, we have to find ways to ...
COCO
2007
Springer
13 years 11 months ago
2007
Springer
We study a model of graph related formulae that we call the Constraint-Graph model. A constraintgraph is a labeled multi-graph (a graph where loops and parallel edges are allowed)...
AAAI
1990
13 years 5 months ago
1990
This paper presents a new approach for exploiting Truth Maintenance Systems(TMSs) which makes them simpler to use without necessarily incurring a substantial performance penalty. ...
CADE
2002
Springer
14 years 5 months ago
2002
Springer
We show that a conjunctive normal form (CNF) formula F is unsatisfiable iff there is a set of points of the Boolean space that is stable with respect to F. So testing the satisfiab...
JAIR
2006
13 years 4 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...