Sciweavers

346 search results - page 22 / 70
» Logical omniscience as a computational complexity problem
Sort
View
LICS
2007
IEEE
14 years 3 months ago
The Cost of Punctuality
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...
Patricia Bouyer, Nicolas Markey, Joël Ouaknin...
BIRTHDAY
2010
Springer
13 years 10 months ago
Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs
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...
Martin Grohe
ICALP
2003
Springer
14 years 1 months ago
Oracle Circuits for Branching-Time Model Checking
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...
Ph. Schnoebelen
ICLP
2005
Springer
14 years 2 months ago
OWL: A Description Logic Based Ontology Language
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...
Ian Horrocks
LICS
2005
IEEE
14 years 2 months ago
On the Decidability of Metric Temporal Logic
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...
Joël Ouaknine, James Worrell