KL-ONE

swMATH28891MaRDI QIDQ40605FDOQ40605

Author name not available (Why is that?)

Official website: https://rd.springer.com/article/10.1023/A:1013882326814

Cited In (47)

• Combining description logics, description graphs, and rules
• Blocking and other enhancements for bottom-up model generation methods
• HermiT: an OWL 2 reasoner
• A polynomial space construction of tree-like models for logics with local chains of modal connectives
• A new methodology for developing deduction methods
• Representing ontologies using description logics, description graphs, and rules
• A conceptual framework for secrecy-preserving reasoning in knowledge bases
• Experimental analysis of some computation rules in a simple parallel reasoning system for the \(\mathcal{ALC}\) description logic
• On the decidability status of fuzzy \(\mathcal {A}\mathcal {L}\mathcal {C}\) with general concept inclusions
• On the undecidability of fuzzy description logics with GCIs and product t-norm
• Description Logics
• Reasoning in expressive description logics under infinitely valued Gödel semantics
• Reasoning on UML class diagrams
• Data complexity of query answering in expressive description logics via tableaux
• Hybrid logics and ontology languages
• Using tableau to decide description logics with full role negation and identity
• A tableau decision procedure for \(\mathcal{SHOIQ}\)
• Ontology Integration Using ε-Connections
• Probabilistic DL reasoning with pinpointing formulas: a Prolog-based approach
• CLIPS
• Pellet
• Consistency reasoning in lattice-based fuzzy description logics
• FaCT++
• Racer
• MetTeL
• CEL
• Protege
• MSPASS
• Sonic
• A hybrid reasoning system for terminologies and first-order clauses in knowledge bases
• WSReasoner
• ICOM
• Automata-based axiom pinpointing
• Lightweight hybrid tableaux
• Automated synthesis of tableau calculi
• Optimizing terminological reasoning for expressive description logics
• Ontologies and Databases: The DL-Lite Approach
• Computing the least common subsumer w.r.t. a background terminology
• A Tableau Calculus for Regular Grammar Logics with Converse
• ExpTime tableaux for \(\mathcal {ALC}\) using sound global caching
• PS\textsc{pace} tableau algorithms for acyclic modalized \({\mathcal{ALC}}\)
• ExpTime tableau decision procedures for regular grammar logics with converse
• An overview of tableau algorithms for description logics
• Automata can show PSpace results for description logics
• ExpTime tableaux with global caching for hybrid PDL
• Terminating tableaux for graded hybrid logic with global modalities and role hierarchies
• Modal tableau systems with blocking and congruence closure

This page was built for software: KL-ONE