124 search results - page 11 / 25 » Automata can show PSpace results for description logics |
RTS
2008
13 years 7 months ago
2008
The aim of this paper is to show, how a multitasking application running under a real-time operating system compliant with an OSEK/VDX standard can be modeled by timed automata. Th...
LATA
2009
Springer
14 years 2 months ago
2009
Springer
This tutorial will present an overview of the use of Monadic Second-Order Logic to describe sets of finite graphs and graph transformations, in relation with the notions of tree-w...
AUSAI
2005
Springer
14 years 1 months ago
2005
Springer
In this paper, I will show how a controlled natural language can be used to describe knowledge for the Semantic Web and discuss the formal properties of this language. At the firs...
IANDC
2007
13 years 7 months ago
2007
A fundamental result of Büchi states that the set of monadic second-order formulas true in the structure (Nat, <) is decidable. A natural question is: what monadic predicates ...
DLOG
2008
13 years 10 months ago
2008
The use of Description Logic as the basis for Semantic Web Languages has led to new requirements with respect to scalable and nonstandard reasoning. In this paper, we address the p...