148 search results - page 18 / 30 » On the Complexity of Elementary Modal Logics |
120
Voted
IJCAI
2003
15 years 3 months ago
2003
The evolution of Description Logics (DLs) and Propositional Dynamic Logics produced a hierar chy of decidable logics with multiple maximal el ements. It would be desirable to ...
110
Voted
CORR
2008
Springer
15 years 1 months ago
2008
Springer
Pure, or type-free, Linear Logic proof nets are Turing complete once cut-elimination is5 considered as computation. We introduce modal impredicativity as a new form of impredicati...
114
click to vote
CADE
1998
Springer
15 years 6 months ago
1998
Springer
Abstract. leanK is a "lean", i.e., extremely compact, Prolog implementation of a free variable tableau calculus for propositional modal logics. leanK 2.0 includes additio...
118
click to vote
ER
2007
Springer
15 years 5 months ago
2007
Springer
The paper presents an unified Description Logic (DL) model for databases. Describing database models using DLs is a fundamental problem in many areas because it turns databases to...
110
click to vote
FUIN
2007
15 years 1 months ago
2007
Abstract. Our previous research presents a methodology of cooperative problem solving for beliefdesire-intention (BDI) systems, based on a complete formal theory called TEAMLOG. Th...