346 search results - page 5 / 70 » Logical omniscience as a computational complexity problem |
CIE
2009
Springer
14 years 2 months ago
2009
Springer
Let Γ be a (not necessarily finite) structure with a finite relational signature. We prove that deciding whether a given existential positive sentence holds in Γ is in LOGSPACE...
LICS
2009
IEEE
14 years 2 months ago
2009
IEEE
—One-counter processes are pushdown systems over a singleton stack alphabet (plus a stack-bottom symbol). We study the complexity of two closely related verification problems ov...
IJCAI
2001
13 years 9 months ago
2001
In the last decade, there has been several studies on the computational complexity of planning. These studies normally assume that the goal of planning is to make a certain fluent...
ACMSE
2000
ACM
13 years 12 months ago
2000
ACM
We present the background and justi cation for a new approachto studying computation and computational complexity. We focus on categories of problems and categories of solutions w...
MFCS
2005
Springer
14 years 1 months ago
2005
Springer
This paper analyses the computational complexity of the model checking problem for Higher Order Fixpoint Logic – the modal µ-calculus enriched with a typed λ-calculus. It is ha...