Solving Language Equations and Disequations with Applications to Disunification in Description Logics and Monadic Set Constraints



: Baader F, Okhotin A

: 2012

: Lecture Notes in Computer Science

: LOGIC FOR PROGRAMMING, ARTIFICIAL INTELLIGENCE, AND REASONING (LPAR-18)

: LECT NOTES COMPUT SC

: 7180

: 107

: 121

: 15

: 0302-9743


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.



Last updated on 2024-26-11 at 22:33