3931 search results - page 316 / 787 » Separation logic and abstraction |
179
click to vote
ICALP
2001
Springer
15 years 11 months ago
2001
Springer
We present a logical framework Υ for reasoning on a very general class of languages featuring binding operators, called nominal , presented in higher-order abstract syntax (HOAS)....
195
click to vote
IPPS
2000
IEEE
15 years 11 months ago
2000
IEEE
Abstract. Knowledge discovery is a time-consuming and space intensive endeavor. By distributing such an endeavor, we can diminish both time and space. System INDED pronounced indee...
197
click to vote
CADE
2000
Springer
15 years 11 months ago
2000
Springer
Abstract. aRa is an automatic theorem prover for various kinds of relation algebras. It is based on Gordeev’s Reduction Predicate Calculi for n-variable logic (RPCn) which allow ...
188
Voted
CL
2000
Springer
15 years 11 months ago
2000
Springer
Abstract. We consider the problem of specifying and computing consistent answers to queries against databases that do not satisfy given integrity constraints. This is done by simul...
160
click to vote
ICLP
1994
Springer
15 years 11 months ago
1994
Springer
Constructive negation has been proved to be a valid alternative to negation as failure, especially when negation is required to have, in a sense, an `active' role. In this pa...