971 search results - page 109 / 195 » Approximate Satisfiability and Equivalence |
121
click to vote
ALGORITHMICA
2007
15 years 27 days ago
2007
Abstract Many compiler optimization techniques depend on the ability to calculate the number of elements that satisfy certain conditions. If these conditions can be represented by ...
109
Voted
AML
2010
15 years 27 days ago
2010
In Abstract Algebraic Logic, the general study of propositional non-classical logics has been traditionally based on the abstraction of the Lindenbaum-Tarski process. In this proce...
138
click to vote
CCE
2008
15 years 26 days ago
2008
Deterministic optimization approaches have been well developed and widely used in the process industry to accomplish off-line and on-line process optimization. The challenging tas...
93
Voted
DAM
2008
15 years 25 days ago
2008
Let G = (V, E) be a graph with vertex set V and edge set E. The k-coloring problem is to assign a color (a number chosen in {1, . . . , k}) to each vertex of G so that no edge has...
107
click to vote
FAC
2008
15 years 25 days ago
2008
Abstract. In this paper we consider the relationship between refinement-oriented specification and specifications using a temporal logic. We investigate the extent to which one can...