2035 search results - page 34 / 407 » On the complexity of stratified logics |
90
Voted
KI
2008
Springer
14 years 10 months ago
2008
Springer
Abstract. Modal logics see a wide variety of applications in artificial intelligence, e.g. in reasoning about knowledge, belief, uncertainty, agency, defaults, and relevance. From ...
94
Voted
CADE
1999
Springer
15 years 2 months ago
1999
Springer
We present a PSpace algorithm that decides satisfiability of the graded modal logic Gr(KR)—a natural extension of propositional modal logic KR by counting expressions—which pl...
111
Voted
AIML
2004
14 years 11 months ago
2004
abstract. The aim of the present paper is to analyze the complexity of strict implication (together with falsum, conjunction and disjunction). We prove that Ladner's Theorem r...
99
Voted
ICFP
2007
ACM
15 years 10 months ago
2007
ACM
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
76
Voted
AIML
2008
14 years 11 months ago
2008
In this paper we prove that Japaridze's Polymodal Logic is PSPACE-decidable. To show this, we describe a decision procedure for satisfiability on hereditarily ordered frames t...