34 search results - page 1 / 7 » The Representational Power of Conjunctive Normal Form |
FCS
2006
13 years 6 months ago
2006
- There is continuing research interest in comparison of the complexity of problems within the class NP-Complete. This paper examines the representational power of conjunctive norm...
DAC
2003
ACM
14 years 5 months ago
2003
ACM
Procedures for Boolean satis ability most commonly work with Conjunctive Normal Form. Powerful SAT techniques based on implications and con icts can be retained when the usual CNF...
BNCOD
2009
13 years 5 months ago
2009
We study the expressiveness of a positive fragment of path queries, denoted Path+ , on node-labeled trees documents. The expressiveness of Path+ is studied from two angles. First, ...
ENTCS
2008
13 years 4 months ago
2008
Most well-known algorithms for equational solving are based on quantifier elimination. This technique iteratively eliminates the innermost block of existential/universal quantifie...
DAC
2007
ACM
14 years 5 months ago
2007
ACM
Satisfiability (SAT) solvers often benefit from a preprocessing of the formula to be decided. For formulae in conjunctive normal form (CNF), subsumed clauses may be removed or par...