3244 search results - page 214 / 649 » Extensions to Description Logics |
147
click to vote
STACS
2000
Springer
15 years 10 months ago
2000
Springer
Motivated by description logics, we investigate what happens to the complexity of modal satisfiability problems if we only allow formulas built from literals, , 3, and 2. Previous...
169
click to vote
CSFW
2004
IEEE
15 years 10 months ago
2004
IEEE
We present a system, BLF, that combines an authorization logic based on the Binder language with a logical framework, LF, able to express semantic properties of programs. BLF is a...
157
click to vote
ENTCS
2008
15 years 6 months ago
2008
The compositional method, introduced by Feferman and Vaught in 1959, allows to reduce the model-checking problem for a product structure to the model-checking problem for its fact...
185
click to vote
IJCAI
1989
15 years 7 months ago
1989
Mechanical systems, of the kinds which are of interest for qualitative reasoning, are characterized by a set of real-valued parameters, each of which is a piecewise continuous fun...
165
click to vote
CADE
2006
Springer
16 years 6 months ago
2006
Springer
Abstract. We investigate cut-elimination and cut-simulation in impredicative (higher-order) logics. We illustrate that adding simple axioms such as Leibniz equations to a calculus ...