551 search results - page 32 / 111 » Realizability of Real-Time Logics |
152
Voted
WISE
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Answering a query over a group of RDF data pages is a trivial process. However, in the Semantic Web, there is a need for ontology technology. Consequently, OWL, a family ...
151
click to vote
FOSSACS
2009
Springer
16 years 11 hour ago
2009
Springer
Abstract. We present a realizability model for a call-by-value, higherorder programming language with parametric polymorphism, general first-class references, and recursive types....
156
click to vote
ESOP
2008
Springer
15 years 7 months ago
2008
Springer
We present a denotational model of impredicative Hoare Type Theory, a very expressive dependent type theory in which one can and reason about mutable abstract data types. The model...
138
click to vote
UAI
1989
15 years 6 months ago
1989
In this paper, the feasibility of using finite totally ordered probability models under Aleliunas’s Theory of Probabilistic Logic [Aleliunas, 1988] is investigated. The general...
152
click to vote
DLOG
2008
15 years 7 months ago
2008
Formal Concept Analysis (FCA) is an approach to knowledge engineering, representation, and analysis. A `standard' FCA-workflow starts with some `experimental' data, class...