49 search results - page 1 / 10 » PSPACE Automata for Description Logics |
DLOG
2006
14 years 17 days ago
2006
Tree automata are often used for satisfiability testing in the area of description logics, which usually yields ExpTime complexity results. We examine conditions under which this ...
IANDC
2008
13 years 11 months ago
2008
In the area of Description Logic (DL), both tableau-based and automata-based algorithms are frequently used to show decidability and complexity results for basic inference problem...
DLOG
2007
14 years 1 months ago
2007
In Description Logics (DLs), both tableau-based and automata-based algorithms are frequently used to show decidability and complexity results for basic inference problems such as c...
LPAR
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. We consider the temporal logic with since and until modalities. This temporal logic is expressively equivalent over the class of ordinals to first-order logic thanks to ...
FORMATS
2004
Springer
14 years 4 months ago
2004
Springer
We study the model-checking problem for weighted timed automata and the weighted CTL logic by the bisimulation approach. Weighted timed automata are timed automata extended with co...