A theory of diagnosis from first principles
Artificial Intelligence
Attributive concept descriptions with complements
Artificial Intelligence
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
An efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF
Annals of Mathematics and Artificial Intelligence
Hybrid Inferences in KL-ONE-Based Knowledge Representation Systems
GWAI '90 Proceedings of the 14th German Workshop on Artificial Intelligence
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
The description logic handbook: theory, implementation, and applications
The description logic handbook: theory, implementation, and applications
From tableaux to automata for description logics
Fundamenta Informaticae
DATE '03 Proceedings of the conference on Design, Automation and Test in Europe - Volume 1
WWW '05 Proceedings of the 14th international conference on World Wide Web
Finding maximally satisfiable terminologies for the description logic ALC
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
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
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Swoop: A Web Ontology Editing Browser
Web Semantics: Science, Services and Agents on the World Wide Web
On finding all minimally unsatisfiable subformulas
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Discovery of minimal unsatisfiable subsets of constraints using hitting set dualization
PADL'05 Proceedings of the 7th international conference on Practical Aspects of Declarative Languages
Automata-Based Axiom Pinpointing
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
A Modularization-Based Approach to Finding All Justifications for OWL DL Entailments
ASWC '08 Proceedings of the 3rd Asian Semantic Web Conference on The Semantic Web
Axiom Pinpointing in Lightweight Description Logics via Horn-SAT Encoding and Conflict Analysis
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
ISWC '09 Proceedings of the 8th International Semantic Web Conference
A Relevance-Directed Algorithm for Finding Justifications of DL Entailments
ASWC '09 Proceedings of the 4th Asian Conference on The Semantic Web
Automata-Based Axiom Pinpointing
Journal of Automated Reasoning
Using sums-of-products for non-standard reasoning
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
A defeasible reasoning approach for description logic ontologies
Proceedings of the South African Institute for Computer Scientists and Information Technologists Conference
Towards Practical ABox Abduction in Large Description Logic Ontologies
International Journal on Semantic Web & Information Systems
Axiomatizing εL⊥-expressible terminological knowledge from erroneous data
Proceedings of the seventh international conference on Knowledge capture
Hi-index | 0.00 |
Axiom pinpointing has been introduced in description logics (DLs) to help the user to understand the reasons why consequences hold and to remove unwanted consequences by computing minimal (maximal) subsets of the knowledge base that have (do not have) the consequence in question. The pinpointing algorithms described in the DL literature are obtained as extensions of the standard tableau-based reasoning algorithms for computing consequences from DL knowledge bases. Although these extensions are based on similar ideas, they are all introduced for a particular tableau-based algorithm for a particular DL.The purpose of this paper is to develop a general approach for extending a tableau-based algorithm to a pinpointing algorithm. This approach is based on a general definition of "tableaux algorithms," which captures many of the known tableau-based algorithms employed in DLs, but also other kinds of reasoning procedures.