124 search results - page 7 / 25 » Automata can show PSpace results for description logics |
LICS
2002
IEEE
14 years 16 days ago
2002
IEEE
We study relations on trees defined by first-order constraints over a vocabulary that includes the tree extension relation Ì Ì ¼, holding if and only if every branch of Ì ex...
CAV
1999
Springer
13 years 12 months ago
1999
Springer
BDDs and their algorithms implement a decision procedure for Quanti ed Propositional Logic. BDDs are a kind of acyclic automata. Unrestricted automata (recognizing unbounded string...
ICALP
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. Tree-walking automata (TWAs) recently received new attention in the fields of formal languages and databases. Towards a better understanding of their expressiveness, we c...
CADE
2008
Springer
14 years 8 months ago
2008
Springer
Axiom pinpointing has been introduced in description logics (DL) to help the user understand the reasons why consequences hold by computing minimal subsets of the knowledge base th...
DLOG
2010
13 years 5 months ago
2010
Semantic interoperability is essential on the Semantic Web to enable different information systems to exchange data. Such interoperability can be achieved by identifying similar in...