Optimizing description logic subsumption
TL;DR: Effective optimization techniques can make a dramatic difference in the performance of knowledge representation systems based on expressive description logics and difficult problems in propositional modal logic can be effectively solved using the same techniques.
read more
Abstract: Effective optimization techniques can make a dramatic difference in the performance of knowledge representation systems based on expressive description logics. With currently-available desktop computers, systems that incorporate these techniques can effectively reason in description logics with intractable inference. Because of the correspondence between description logics and propositional modal logic difficult problems in a propositional modal logic can be effectively solved using the same techniques.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Figures
Citations
Handbook on Ontologies
Steffen Staab,Rudi Studer +1 more
- 12 Aug 2009
TL;DR: The Handbook on Ontologies provides a comprehensive overview of the current status and future prospectives of the field of ontologies considering ontology languages, ontology engineering methods, example ontologies, infrastructures and technologies for ontology, and how to bring this all into ontology-based infrastructureures and applications that are among the best of their kind.
1.5K
•Book
Ontologies: A Silver Bullet for Knowledge Management and Electronic Commerce
Dieter Fensel
- 01 Jan 2001
TL;DR: This second editionsystematically introduces the notion of ontologies to the non-expert reader and demonstrates in detail how to apply this conceptual framework for improved intranet retrieval of corporate information and knowledge and for enhanced Internet-based electronic commerce.
1.4K
OIL: an ontology infrastructure for the Semantic Web
Dieter Fensel,F.A.H. van Harmelen,Ian Horrocks,Deborah L. McGuinness,Peter F. Patel-Schneider +4 more
TL;DR: The authors present OIL, a proposal for a joint standard for specifying and exchanging ontologies, which is needed for knowledge sharing and reuse on the Semantic Web.
Reasoning on UML class diagrams
TL;DR: This work considers UML class diagrams, which are one of the most important components of UML, and addresses the problem of reasoning on such diagrams, using several results developed in the field of Knowledge Representation and Reasoning regarding Description Logics (DLs), a family of logics that admit decidable reasoning procedures.
671
Description Logics
Franz Baader
- 01 Sep 2009
TL;DR: Approaches for reasoning in expressive DLs, which are the foundation for Reasoning in the Web ontology language OWL DL, are presented and tractable reasoning in the more light-weight DL $\mathcal{EL}$, which is employed in bio-medical ontologies, is considered.
447
References
•Proceedings Article
Proceedings of the 19th International Joint Conference on Artificial Intelligence
Josep M. Pujol,Jordi Delgado,Ramon Sangüesa,Andreas Flache +3 more
- 01 Jan 2005
4.5K
•Book
A machine program for theorem-proving
Martin Davis,George Logemann,Donald W. Loveland +2 more
- 31 Aug 2011
TL;DR: The programming of a proof procedure is discussed in connection with trial runs and possible improvements.
3.6K
Attributive concept descriptions with complements
TL;DR: It is shown that deciding coherence and subsumption of such descriptions are PSPACE-complete problems that can be decided with linear space.
1.1K
A guide to completeness and complexity for modal logics of knowledge and belief
Joseph Y. Halpern,Yoram Moses +1 more
TL;DR: It is shown that while the problem of deciding satisfiability of an S5 formula with one agent is NP-complete, the problem for many agents is PSPACE-complete and the problem becomes complete for exponential time once a common knowledge operator is added to the language.
965
•Proceedings Article
A correspondence theory for terminological logics: preliminary report
Klaus Schild
- 24 Aug 1991
TL;DR: It is proved that universal implications can be expressed within TSC, and it is shown that features correspond to deterministic programs in dynamic logic preserves decidability, although violates its finite model property.
646