4217 search results - page 31 / 844 » Computational indistinguishability logic |
CSL
2010
Springer
14 years 11 months ago
2010
Springer
By a Euclidean logic, we understand a formal language whose variables range over subsets of Euclidean space, of some fixed dimension, and whose non-logical primitives have fixed me...
FLAIRS
2003
14 years 11 months ago
2003
Recently, a hierarchy of spatio-temporal languages based on the propositional temporal logic PTL and the spatial languages RCC-8, BRCC-8 and S4u has been introduced. Although a nu...
102
click to vote
TC
2011
14 years 4 months ago
2011
—Mounting concerns over variability, defects and noise motivate a new approach for digital circuitry: stochastic logic, that is to say, logic that operates on probabilistic signa...
CADE
1990
Springer
15 years 1 months ago
1990
Springer
We briefly review a mechanical theorem-prover for a logic of recursive functions over finitely generated objects including the integers, ordered pairs, and symbols. The prover, kn...
KI
1999
Springer
15 years 2 months ago
1999
Springer
Computing least common subsumers in description logics is an important reasoning service useful for a number of applications. As shown in the literature, it can, for instance, be u...