2035 search results - page 33 / 407 » On the complexity of stratified logics |
85
Voted
CADE
2008
Springer
15 years 7 days ago
2008
Springer
Recent studies have provided many characterisations of the class of polynomial time computable functions through term rewriting techniques. In this paper we describe a (fully autom...
97
Voted
FSTTCS
2005
Springer
15 years 3 months ago
2005
Springer
We give new proofs of soundness (all representable functions on base types lies in certain complexity classes) for Light Affine Logic, Elementary Affine Logic, LFPL and Soft Af...
AI
2002
Springer
14 years 10 months ago
2002
Springer
ko et al. have recently proposed an abstract framework for default reasoning. Besides capturing most existing formalisms and proving that their standard semantics all coincide, th...
100
click to vote
IJCAI
2007
14 years 11 months ago
2007
Integrating description logics (DL) and logic programming (LP) would produce a very powerful and useful formalism. However, DLs and LP are based on quite different principles, so ...
119
Voted
FOSSACS
2006
Springer
15 years 1 months ago
2006
Springer
In recent years, a tight connection has emerged between modal logic on the one hand and coalgebras, understood as generic transition systems, on the other hand. Here, we prove tha...