2432 search results - page 169 / 487 » Cryptographic logical relations |
211
click to vote
ALP
1997
Springer
15 years 9 months ago
1997
Springer
Abstract. We show that non-determinism simplifies coding certain problems into programs. We define a non-confluent, but well-behaved class of rewrite systems for supporting non-...
168
click to vote
ECP
1997
Springer
15 years 9 months ago
1997
Springer
We present a framework for encoding planning problems in logic programs with negation as failure, having computational e ciency as our major consideration. In order to accomplish o...
177
click to vote
CCL
1994
Springer
15 years 9 months ago
1994
Springer
Abstract: This paper describes the application of CLP (constraint logic programming) to several digital circuit design problems. It is shown that logic programming together with ef...
157
click to vote
DIMACS
1996
15 years 6 months ago
1996
: We review the expressibility of some basic graph properties in certain fragments of Monadic Second-Order logic, like the set of Monadic-NP formulas. We focus on cases where a pro...
146
click to vote
ISMB
1994
15 years 6 months ago
1994
Temporallogic, in particular, interval logic has been used to represent genomemapsand to assist genome mapconstructions. However,interval logic itself appears to be bruited in its...