Solving Language Equations and Disequations with Applications to Disunification in Description Logics and Monadic Set Constraints-Reference-Cited by-同舟云学术

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

Published:2012 Issue: Volume: Page:107-121
ISSN:0302-9743
Container-title:Logic for Programming, Artificial Intelligence, and Reasoning
language:
Short-container-title:

Author:

Baader Franz,Okhotin Alexander

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-28717-6_11.pdf

Reference18 articles.

1. Lecture Notes in Computer Science;A. Aiken,1994

2. Aiken, A., Kozen, D., Wimmers, E.L.: Decidability of systems of set constraints with negative constraints. Information and Computation 122(1), 30–44 (1995)

3. Lecture Notes in Artificial Intelligence;F. Baader,2001

4. Baader, F., Narendran, P.: Unification of concept terms in description logic. Journal of Symbolic Computation 31, 277–305 (2001)

5. Baader, F., Okhotin, A.: On Language Equations with One-sided Concatenation., LTCS-Report LTCS-06-01, Chair for Automata Theory, Institute for Theoretical Computer Science, TU Dresden, A short version has been published in the Proceedings of the 20th International Workshop on Unification, UNIF 2006 (2006), http://lat.inf.tu-dresden.de/research/reports.html

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Tree Automata with Global Constraints for Infinite Trees;2019

2. Extending Unification in EL to Disunification: The Case of Dismatching and Local Disunification;Logical Methods in Computer Science;2017-04-27

3. On language equations with concatenation and various sets of Boolean operations;RAIRO - Theoretical Informatics and Applications;2015-07

4. On Language Equations with One-sided Concatenation;Fundamenta Informaticae;2013