2062 search results - page 179 / 413 » Derivatives of Logical Formulas |
126
click to vote
LICS
2010
IEEE
15 years 2 months ago
2010
IEEE
We consider formulas which, in addition to the symbols in the vocabulary, may use two designated symbols ≺ and + that must be interpreted as a linear order and its associated ad...
159
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
154
click to vote
TII
2010
14 years 11 months ago
2010
In this paper, we develop an automated framework for formal verification of timed continuous Petri nets (ContPNs). Specifically, we consider two problems: (1) given an initial set ...
127
click to vote
DALT
2006
Springer
15 years 8 months ago
2006
Springer
We outline elements of the Abstract Contract Calculator, a prototype language implemented in Haskell (a declarative programming language) in which we simulate agents executing abst...
154
click to vote
DATE
2000
IEEE
15 years 8 months ago
2000
IEEE
Traditional FPGA design flows have treated logic synthesis and physical design as separate steps. With the recent advances in technology, the lack of information on the physical ...