346 search results - page 22 / 70 » Logical omniscience as a computational complexity problem |
124
Voted
LICS
2007
IEEE
15 years 9 months ago
2007
IEEE
In an influential paper titled “The Benefits of Relaxing Punctuality” [2], Alur, Feder, and Henzinger introduced Metric Interval Temporal Logic (MITL) as a fragment of the r...
152
Voted
BIRTHDAY
2010
Springer
15 years 4 months ago
2010
Springer
The question of whether there is a logic that captures polynomial time was formulated by Yuri Gurevich in 1988. It is still wide open and regarded as one of the main open problems...
113
Voted
ICALP
2003
Springer
15 years 8 months ago
2003
Springer
A special class of oracle circuits with tree-vector form is introduced. It is shown that they can be evaluated in deterministic polynomial-time with a polylog number of adaptive qu...
135
click to vote
ICLP
2005
Springer
15 years 9 months ago
2005
Springer
Abstract Description Logics (DLs) are a family of class (concept) based knowledge representation formalisms. They are characterised by the use of various constructors to build comp...
111
Voted
LICS
2005
IEEE
15 years 9 months ago
2005
IEEE
Metric Temporal Logic (MTL) is a prominent specification formalism for real-time systems. In this paper, we show that the satisfiability problem for MTL over finite timed words...