472 search results - page 2 / 95 » Limiting Negations in Formulas |
137
Voted
LPAR
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. Grounding is the task of reducing a first order formula to ground formula that is equivalent on a given universe, and is important in many kinds of problem solving and re...
147
Voted
EDBT
2004
ACM
16 years 3 months ago
2004
ACM
We study the problem of answering queries over sources with limited access patterns. The problem is to decide whether a given query Q is feasible, i.e., equivalent to an executable...
152
Voted
SIEMENS
1993
15 years 7 months ago
1993
122
Voted
EXACT
2007
15 years 6 months ago
2007
Given a model and a property expressed in temporal logic, a model checker normally produces a counterexample in case the model does not satisfy the property. This counterexample i...
103
Voted
SAT
2009
Springer
15 years 10 months ago
2009
Springer
In this paper we consider the class of boolean formulas in Conjunctive Normal Form (CNF) where for each variable all but at most d occurrences are either positive or negative. This...