3244 search results - page 229 / 649 » Extensions to Description Logics |
296
click to vote
POPL
2008
ACM
16 years 6 months ago
2008
ACM
We propose a characterization of PSPACE by means of a type assignment for an extension of lambda calculus with a conditional construction. The type assignment STAB is an extension...
134
click to vote
MLQ
2007
15 years 6 months ago
2007
It is well known that MTL satisfies the finite embeddability property. Thus MTL is complete w.r.t. the class of all finite MTL-chains. In order to reach a deeper understanding ...
163
click to vote
CORR
2002
Springer
15 years 6 months ago
2002
Springer
Abstract. Logic Programming paradigms that allow for expressing preferences have drawn a lot of research interest over the last years. Among them, the principle of ordered disjunct...
218
click to vote
LPAR
2010
Springer
15 years 4 months ago
2010
Springer
Data trees and data words have been studied extensively in connection with XML reasoning. These are trees or words that, in addition to labels from a finite alphabet, carry labels ...
173
click to vote
CSL
2002
Springer
15 years 6 months ago
2002
Springer
In the process of interactive theorem proving one often works with incomplete higher order proofs. In this paper we address the problem of giving a correctness criterion for these ...