1545 search results - page 151 / 309 » Defeasible Description Logics |
LOGCOM
2002
13 years 7 months ago
2002
We present a logical approach to plan recognition that builds on Kautz's theory of keyhole plan recognition, defined as the problem of inferring descriptions of high-level pl...
STACS
2000
Springer
13 years 11 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...
IJCAI
1989
13 years 9 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...
CADE
2006
Springer
14 years 8 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 ...
BIRTHDAY
1991
Springer
13 years 11 months ago
1991
Springer
First-order modal logics, as traditionally formulated, are not expressive enough. It is this that is behind the difficulties in formulating a good analog of Herbrand’s Theorem, ...