Browse wiki

From International Center for Computational Logic
This paper investigates the relationship bThis paper investigates the relationship between automata- and tableau-based inference procedures for Description Logics. To be more precise, we develop an abstract notion of what a tableau-based algorithm is, and then show, on this abstract level, how tableau-based algorithms can be converted into automata-based algorithms. In particular, this allows us to characterize a large class of tableau-based algorithms that imply an ExpTime upper-bound for reasoning in the description logics for which such an algorithm exists.logics for which such an algorithm exists.  +
Franz Baader +, Carsten Lutz +, J. Hladik +  and Frank Wolter +
@inproceedings{ BaaHlaLutWol-LPAR03,
  author = {F. {Baader} and J. {Hladik} and C. {Lutz} and F. {Wolter}},
  booktitle = {Proceedings of the 10th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning ({LPAR 2003})},
  editor = {Moshe {Vardi} and Andrei {Voronkov}},
  pages = {1--32},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  title = {From Tableaux to Automata for Description Logics},
  volume = {2850},
  year = {2003},
}
Inproceedings  +
Proceedings of the 10th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 2003)  +
BaaHlaLutWol-LPAR03.ps.gz  +
Moshe Vardi and Andrei Voronkov  +
1-32  +
Franz Baader, J. Hladik, Carsten Lutz, FraFranz Baader, J. Hladik, Carsten Lutz, Frank Wolter<br/> '''[[LATPub274|<b>From Tableaux to Automata for Description Logics</b>]]''' <br/>__NOTOC__In Moshe Vardi and Andrei Voronkov, eds., <i>Proceedings of the 10th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 2003)</i>, volume 2850 of Lecture Notes in Computer Science, 1-32, 2003. Springer<br/><span class="fas fa-chevron-right" style="font-size: 85%;" ></span> [[LATPub274|Details]] <span class="fas fa-chevron-right" style="font-size: 85%; margin-left: 2ex; "></span> [[Media:BaaHlaLutWol-LPAR03.ps.gz|Download]]laLutWol-LPAR03.ps.gz|Download]]  +
Franz Baader, J. Hladik, Carsten Lutz, FraFranz Baader, J. Hladik, Carsten Lutz, Frank Wolter<br/> '''[[LATPub274/en|<b>From Tableaux to Automata for Description Logics</b>]]''' <br/>__NOTOC__In Moshe Vardi and Andrei Voronkov, eds., <i>Proceedings of the 10th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 2003)</i>, volume 2850 of Lecture Notes in Computer Science, 1-32, 2003. Springer<br/><span class="fas fa-chevron-right" style="font-size: 85%;" ></span> [[LATPub274|Details]] <span class="fas fa-chevron-right" style="font-size: 85%; margin-left: 2ex;" ></span> [[Media:BaaHlaLutWol-LPAR03.ps.gz|Download]]laLutWol-LPAR03.ps.gz|Download]]  +
Springer  +
Lecture Notes in Computer Science  +
From Tableaux to Automata for Description Logics  +
inproceedings  +
2850  +
2003  +
Display title of"Display title of" is a predefined property that can assign a distinct display title to an entity and is provided by <a rel="nofollow" class="external text" href="https://www.semantic-mediawiki.org/wiki/Help:Special_properties">Semantic MediaWiki</a>.
From Tableaux to Automata for Description Logics  +
Modification date"Zuletzt geändert <span style="font-size:small;">(Modification date)</span>" is a predefined property that corresponds to the date of the last modification of a subject and is provided by <a rel="nofollow" class="external text" href="https://www.semantic-mediawiki.org/wiki/Help:Special_properties">Semantic MediaWiki</a>.
25. März 2015, 14:34:04  +
Has query"Hat Abfrage <span style="font-size:small;">(Has query)</span>" is a predefined property that represents meta information (in form of a <a rel="nofollow" class="external text" href="https://www.semantic-mediawiki.org/wiki/Subobject">subobject</a>) about individual queries and is provided by <a rel="nofollow" class="external text" href="https://www.semantic-mediawiki.org/wiki/Help:Special_properties">Semantic MediaWiki</a>.