1670 search results - page 187 / 334 » On Skolemization in constructive theories |
172
click to vote
ASP
2003
Springer
15 years 10 months ago
2003
Springer
The work aims at extending Answer Set Programming (ASP) with the possibility of quickly introducing new predefined constructs and to deal with compound data structures: we show ho...
201
click to vote
ASYNC
2001
IEEE
15 years 10 months ago
2001
IEEE
This paper describes the synthesis and hardware implementation of a signal-type asynchronous data communication mechanism (ACM). Such an ACM can be used in systems where a data-dr...
174
click to vote
CSFW
2000
IEEE
15 years 10 months ago
2000
IEEE
Schneider's work on rank functions [14] provides a formal approach to verification of certain properties of a security protocol. However, he illustrates the approach only wit...
164
click to vote
FOSSACS
2000
Springer
15 years 10 months ago
2000
Springer
We relate several models of concurrency introduced in the literature in order to extend classical Mazurkiewicz traces. These are mainly Droste's concurrent automata and Arnold...
176
click to vote
FPCA
1995
15 years 10 months ago
1995
In this paper we study the relationships between logic programming and functional programming, trying to answer the following basic question: to what extent is logic programming j...