Solving Linear Equations over Regular Languages
Download:
|
|
by Franz Baader, Lufg Theoretische Informatik
http://www.ti.informatik.uni-kiel.de/~kuesters/./publications_html/BaaderKuesters-UNIF-2001.ps.gz
Add To MetaCart
Abstract:
Uni cation of concept descriptions has been introduced by Baader and Narendran [5] as a new inference service for detecting and avoiding redundancies in Description Logic knowledge bases. The technical results in [5] are concerned
Citations
| 164 | Automata-theoretic techniques for modal logics of programs – Vardi, Wolper - 1986 |
| 144 | Basic description logics – Baader, Nutt - 2003 |
| 114 | Augmenting concept languages by transitive closure of roles: An alternative to terminological cycles – Baader - 1991 |
| 86 | Automata on in objects – Thomas - 1990 |
| 62 | The complexity of set con-straints – Aiken, Kozen, et al. - 1993 |
| 37 | overloading is DEXPTIME-complete – Seidl, Haskell - 1994 |
| 30 | Unification of concept terms in description logics – Baader, Narendran - 1998 |
| 12 | Matching in Description Logics with Existential Restrictions – Baader, Kusters - 2000 |
| 11 | Language Equations – Leiss - 1999 |
| 10 | Combination problems for commutative/monoidal theories: How algebra can help in equational reasoning – Baader, Nutt - 1996 |
| 3 | Implicit language equations: Existence and uniqueness of solutions – Leiss - 1995 |
