3658 search results - page 350 / 732 » The logic of proofs, semantically |
185
click to vote
APSEC
2008
IEEE
16 years 1 months ago
2008
IEEE
Memory usage analysis is an important problem for resource-constrained mobile devices, especially under mission- or safety-critical circumstances. Program codes running on or bein...
191
click to vote
ICLP
1999
Springer
15 years 11 months ago
1999
Springer
We introduce the notion of bounded nondeterminism for logic programs and queries. A program and a query have bounded nondeterminism if there are finitely many refutations for the...
178
click to vote
CSL
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. We address a fundamental mismatch between the combinations of dynamics that occur in complex physical systems and the limited kinds of dynamics supported in analysis. Mod...
140
click to vote
FSS
2006
15 years 6 months ago
2006
An implication operator A is said to be tied if there is a binary operation T that ties A; that is, the identity A(a, A(b, z)) = A(T (a, b), z) holds for all a, b, z. We aim at th...
199
click to vote
CL
2000
Springer
15 years 11 months ago
2000
Springer
Abstract. In this paper a semantic approach for the specification and the management of databases with evolving schemata is introduced. It is shown how a general object-oriented m...