971 search results - page 19 / 195 » Approximate Satisfiability and Equivalence |
ECAI
2006
Springer
14 years 1 months ago
2006
Springer
Abstract. We present an approximation theory for the extended answer set semantics, using the concept of an approximation constraint. Intuitively, an approximation constraint, whil...
TCS
2002
13 years 9 months ago
2002
Under the hypothesis that NP has positive p-dimension, we prove that any approximation algorithm A for MAX3SAT must satisfy at least one of the following:
POPL
2010
ACM
14 years 7 months ago
2010
ACM
The definition of type equivalence is one of the most important design issues for any typed language. In dependentlytyped languages, because terms appear in types, this definition...
FP
1991
14 years 1 months ago
1991
The notion of functionality is not cast in stone, but depends upon what we have as types in our language. With partial equivalence relations (pers) as types we show that the funct...
CONCUR
2003
Springer
14 years 3 months ago
2003
Springer
We present a process-algebraic language for Probabilistic I/O Automata (PIOA). To ensure that PIOA specifications given in our language satisfy the “input-enabled” property, w...