Automata-Theoretic techniques for modal logics of programs
Journal of Computer and System Sciences
A theory of diagnosis from first principles
Artificial Intelligence
On the synthesis of a reactive module
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
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
On the temporal analysis of fairness
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
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
The Complexity of Reasoning with Boolean Modal Logics Extended Version
The Complexity of Reasoning with Boolean Modal Logics Extended Version
WWW '05 Proceedings of the 14th international conference on World Wide Web
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Debugging Incoherent Terminologies
Journal of Automated Reasoning
Principles of Model Checking (Representation and Mind Series)
Principles of Model Checking (Representation and Mind Series)
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Reasoning about infinite computation paths
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
Multi-Valued MSO Logics OverWords and Trees
Fundamenta Informaticae
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
Automata-Based Axiom Pinpointing
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Reasoning in expressive description logics with fixpoints based on automata on infinite trees
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
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
Axiom Pinpointing in General Tableaux
Journal of Logic and Computation
VMCAI'07 Proceedings of the 8th international conference on Verification, model checking, and abstract interpretation
Finding all justifications of OWL DL entailments
ISWC'07/ASWC'07 Proceedings of the 6th international The semantic web and 2nd Asian conference on Asian semantic web conference
Weighted muller tree automata and weighted logics
Journal of Automata, Languages and Combinatorics
Weighted automata and weighted logics on infinite words
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Complexity of Axiom Pinpointing in the DL-Lite Family of Description Logics
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
From model checking to model measuring
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
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 and other logics 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. We use the DL $\mathcal{SI}$ as well as Linear Temporal Logic (LTL) to illustrate our new pinpointing approach.