Attributive concept descriptions with complements
Artificial Intelligence
Finite tree automata with cost functions
Theoretical Computer Science - Selected papers of the 17th Colloquium on Trees in Algebra and Programming (CAAP '92) and of the European Symposium on Programming (ESOP), Rennes, France, Feb. 1992
The Inverse Method Implements the Automata Approach for Modal Satisfiability
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Automata theoretic techniques for modal logics of programs: (Extended abstract)
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
The description logic handbook: theory, implementation, and applications
The description logic handbook: theory, implementation, and applications
WWW '05 Proceedings of the 14th international conference on World Wide Web
Automata can show PSpace results for description logics
Information and Computation
Axiom Pinpointing in General Tableaux
TABLEAUX '07 Proceedings of the 16th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Non-standard reasoning services for the debugging of description logic terminologies
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Augmenting concept languages by transitive closure of roles: an alternative to terminological cycles
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
Weighted automata and weighted logics on infinite words
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
ISWC '09 Proceedings of the 8th International Semantic Web Conference
Automata-Based Axiom Pinpointing
Journal of Automated Reasoning
Context-dependent views to axioms and consequences of Semantic Web ontologies
Web Semantics: Science, Services and Agents on the World Wide Web
Using sums-of-products for non-standard reasoning
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
A generic approach for correcting access restrictions to a consequence
ESWC'10 Proceedings of the 7th international conference on The Semantic Web: research and Applications - Volume Part I
Hi-index | 0.00 |
Axiom pinpointing has been introduced in description logics (DL) to help the user understand the reasons why consequences hold by computing minimal subsets of the knowledge base that have the consequence in question (MinA). Most of the pinpointing algorithms described in the DL literature are obtained as extensions of tableau-based reasoning algorithms for computing consequences from DL knowledge bases. In this paper, we show that automata-based algorithms for reasoning in DLs can also be extended to pinpointing algorithms. The idea is that the tree automaton constructed by the automata-based approach can be transformed into a weighted tree automaton whose so-called behaviour yields a pinpointing formula, i.e., a monotone Boolean formula whose minimal valuations correspond to the MinAs. We also develop an approach for computing the behaviour of a given weighted tree automaton.