472 search results - page 19 / 95 » Limiting Negations in Formulas |
110
click to vote
AAAI
1994
15 years 4 months ago
1994
d Abstract) Goran Gogic l, Christos H. Papadimitriou', and Martha Sideri2 : Approximating a general formula from above and below by Horn formulas (its Horn envelope and Horn c...
112
click to vote
STOC
2003
ACM
16 years 3 months ago
2003
ACM
For a Boolean formula on n variables, the associated property P is the collection of n-bit strings that satisfy . We study the query complexity of tests that distinguish (with hig...
152
click to vote
PLANX
2007
15 years 4 months ago
2007
We present an algorithm to solve XPath decision problems under regular tree type constraints and show its use to statically typecheck XPath queries. To this end, we prove the deci...
194
click to vote
MFCS
2010
Springer
15 years 1 months ago
2010
Springer
The problem of finding a satisfying assignment for a 2-SAT formula that minimizes the number of variables that are set to 1 (min ones 2–sat) is NP-complete. It generalizes the w...
112
click to vote
AI
2004
Springer
15 years 3 months ago
2004
Springer
A version space is a collection of concepts consistent with a given set of positive and negative examples. Mitchell [Mit82] proposed representing a version space by its boundary s...