Semantisches Browsen

Aus International Center for Computational Logic
Wechseln zu:Navigation, Suche
LATPub495
Abstract We extend previous results on the complexi
We extend previous results on the complexity of solving language equations with one-sided concatenation and all Boolean operations to the case where also disequations (i.e., negated equations) may occur. To show that solvability of systems of equations and disequations is still in ExpTime, we introduce a new type of automata working on infinite trees, which we call looping automata with colors. As applications of these results, we show new complexity results for disunification in the description logic FL0 and for monadic set constraints with negation. We believe that looping automata with colors may also turn out to be useful in other applications.
rn out to be useful in other applications.  +
Author Franz Baader + , Alexander Okhotin +
BibTex
@inproceedings{ BaOk-LPAR18,
  address = {M{\'e}rida, Venezuela},
  author = {Franz {Baader} and Alexander {Okhotin}},
  booktitle = {Proceedings of the 18th International Conference on Logic for Programming, Artifical Intelligence, and Reasoning {(LPAR-12)}},
  editor = {Nikolaj {Bj{\o}rner} and Andrei {Voronkov}},
  pages = {107--121},
  publisher = {Springer-Verlag},
  series = {Lecture Notes in Computer Science},
  title = {Solving language equations and disequations with applications to disunification in description logics and monadic set constraints},
  volume = {7180},
  year = {2012},
}
Bibtype Inproceedings  +
Booktitle Proceedings of the 18th International Conference on Logic for Programming, Artifical Intelligence, and Reasoning (LPAR-12)  +
Download BaOk-LPAR18.pdf  +
Editor Nikolaj Bjørner and Andrei Voronkov  +
ErsterAutorNachname Baader  +
ErsterAutorVorname Franz  +
Forschungsgruppe Automatentheorie +
Pages 107-121  +
Publication text Franz Baader, Alexander Okhotin<br/>
Franz Baader, Alexander Okhotin<br/> '''[[LATPub495|<b>Solving language equations and disequations with applications to disunification in description logics and monadic set constraints</b>]]''' <br/>__NOTOC__In Nikolaj Bjørner and Andrei Voronkov, eds., <i>Proceedings of the 18th International Conference on Logic for Programming, Artifical Intelligence, and Reasoning (LPAR-12)</i>, volume 7180 of Lecture Notes in Computer Science, 107-121, 2012. Springer<br/><span class="glyphicon glyphicon-chevron-right" style="font-size: 85%;" ></span> [[LATPub495|Details]] <span class="glyphicon glyphicon-chevron-right" style="font-size: 85%; margin-left: 2ex; "></span> [[Media:BaOk-LPAR18.pdf|Download]]
pan> [[Media:BaOk-LPAR18.pdf|Download]]  +
Publication text en Franz Baader, Alexander Okhotin<br/>
Franz Baader, Alexander Okhotin<br/> '''[[LATPub495/en|<b>Solving language equations and disequations with applications to disunification in description logics and monadic set constraints</b>]]''' <br/>__NOTOC__In Nikolaj Bjørner and Andrei Voronkov, eds., <i>Proceedings of the 18th International Conference on Logic for Programming, Artifical Intelligence, and Reasoning (LPAR-12)</i>, volume 7180 of Lecture Notes in Computer Science, 107-121, 2012. Springer<br/><span class="glyphicon glyphicon-chevron-right" style="font-size: 85%;" ></span> [[LATPub495|Details]] <span class="glyphicon glyphicon-chevron-right" style="font-size: 85%; margin-left: 2ex;" ></span> [[Media:BaOk-LPAR18.pdf|Download]]
pan> [[Media:BaOk-LPAR18.pdf|Download]]  +
Publisher Springer  +
Referiert 1  +
Series Lecture Notes in Computer Science  +
Title Solving language equations and disequations with applications to disunification in description logics and monadic set constraints  +
To appear 0  +
Type inproceedings  +
Volume 7180  +
Year 2012  +
Hat Abfrage
Dieses Attribut ist ein Spezialattribut in diesem Wiki.
LATPub495 + , LATPub495 + , LATPub495 + , LATPub495 + , LATPub495 + , LATPub495 +
Kategorien Inproceedings , Publikation
Zuletzt geändert
Dieses Attribut ist ein Spezialattribut in diesem Wiki.
25 März 2015 14:34:07  +
verstecke Attribute die hierhin verlinken 
LATPub495/en + Weiterleitungsseite
 

 

Bitte den Namen einer Seite angeben, um mit dem Browsen zu beginnen.