A1 Refereed original research article in a scientific journal
Solving Language Equations and Disequations with Applications to Disunification in Description Logics and Monadic Set Constraints
Authors: Baader F, Okhotin A
Publication year: 2012
Journal: Lecture Notes in Computer Science
Journal name in source: LOGIC FOR PROGRAMMING, ARTIFICIAL INTELLIGENCE, AND REASONING (LPAR-18)
Journal acronym: LECT NOTES COMPUT SC
Volume: 7180
First page : 107
Last page: 121
Number of pages: 15
ISSN: 0302-9743
Abstract
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.
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.
UTU Research Portal