472 search results - page 13 / 95 » Limiting Negations in Formulas |
TCS
2011
13 years 4 months ago
2011
We prove that if a set X ⊆ Z2 weakly self-assembles at temperature 1 in a deterministic (Winfree) tile assembly system satisfying a natural condition known as pumpability, then ...
GG
2004
Springer
14 years 2 months ago
2004
Springer
We show how edge-labelled graphs can be used to represent first-order logic formulae. This gives rise to recursively nested structures, in which each level of nesting corresponds ...
RSA
2006
13 years 9 months ago
2006
: On input a random 3-CNF formula of clauses-to-variables ratio r3 applies repeatedly the following simple heuristic: Set to True a literal that appears in the maximum number of cl...
IJCAI
2007
13 years 10 months ago
2007
The definition of a stable model has provided a declarative semantics for Prolog programs with negation as failure and has led to the development of answer set programming. In th...
ISLPED
2000
ACM
14 years 1 months ago
2000
ACM
Energy is one of the limited resources for modern systems, especially the battery-operated devices and personal digital assistants. The backlog in new technologies for more powerf...