2062 search results - page 238 / 413 » Derivatives of Logical Formulas |
173
click to vote
ICLP
1997
Springer
15 years 10 months ago
1997
Springer
We introduce novel, sound, complete, and locally optimal evaluation strategies for functional logic programming languages. Our strategies combine, in a non-trivial way, two landma...
185
click to vote
ICLP
2010
Springer
15 years 10 months ago
2010
Springer
[6]. An SBML model can be interpreted in Biocham at three abstraction levels: • the Boolean semantics (asynchronuous Boolean state transitions on the presence/absence of molecule...
172
click to vote
ACSD
2004
IEEE
15 years 10 months ago
2004
IEEE
The behaviour of asynchronous circuits is often described by Signal Transition Graphs (STGs), which are Petri nets whose transitions are interpreted as rising and falling edges of...
166
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
We present an iterative algorithm for enforcing policies represented in a first-order logic, which can, in particular, express all transmission-related clauses in the HIPAA Priva...
187
click to vote
SIGSOFT
2007
ACM
16 years 7 months ago
2007
ACM
Model checking techniques have traditionally dealt with temporal logic languages and automata interpreted over -words, i.e., infinite in the future but finite in the past. However...