Attributive concept descriptions with complements
From MaRDI portal
Publication:749235
DOI10.1016/0004-3702(91)90078-XzbMath0712.68095MaRDI QIDQ749235
Gert Smolka, Manfred Schmidt-Schauss
Publication date: 1991
Published in: Artificial Intelligence (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Knowledge representation (68T30) Artificial intelligence (68T99)
Related Items (91)
Fuzzy terms ⋮ An empirical analysis of terminological representation systems ⋮ Peirce algebras ⋮ Resolution for label-based formulas in hierarchical representation ⋮ Extending description logics with uncertainty reasoning in possibilistic logic ⋮ DESCRIPTION LOGICS OVER LATTICES ⋮ Computing the least common subsumer w.r.t. a background terminology ⋮ CoLab: A hybrid knowledge representation and compilation laboratory ⋮ Making fuzzy description logic more general ⋮ Reasoning within intuitionistic fuzzy rough description logics ⋮ The complexity of concept languages ⋮ A family of dynamic description logics for representing and reasoning about actions ⋮ Type-2 fuzzy description logic ⋮ PS\textsc{pace} tableau algorithms for acyclic modalized \({\mathcal{ALC}}\) ⋮ Consistency checking reduced to satisfiability of concepts in terminological systems ⋮ A tableau algorithm for description logics with concrete domains and general TBoxes ⋮ A description logic based situation calculus ⋮ Open answer set programming for the semantic web ⋮ The F-logic approach for description languages ⋮ A refined architecture for terminological systems: Terminology = Schema + Views ⋮ An epistemic operator for description logics ⋮ A Conceptual Framework for Secrecy-preserving Reasoning in Knowledge Bases ⋮ Generalized satisfiability for the description logic \(\mathcal{ALC}\) ⋮ Planning from second principles ⋮ The Probabilistic Description Logic ⋮ A polynomial space construction of tree-like models for logics with local chains of modal connectives ⋮ Extending the description logic \(\mathcal{EL}\) with threshold concepts induced by concept measures ⋮ Reasoning in Expressive Description Logics under Infinitely Valued Gödel Semantics ⋮ Reasoning with the finitely many-valued Łukasiewicz fuzzy description logic \(\mathcal {SROIQ}\) ⋮ The Syntax of Many-Valued Relations ⋮ A multi-dimensional terminological knowledge representation language ⋮ A sequent calculus for reasoning in four-valued Description Logics ⋮ \(\mathcal{ALCQPI}_{R^+}\): rational grading in an expressive description logic with inverse and transitive roles and counting ⋮ Generalized fuzzy rough description logics ⋮ A logical framework for privacy-preserving social network publication ⋮ Automata-Based Axiom Pinpointing ⋮ Runtime verification using the temporal description logic \(\mathcal{ALC}\)-LTL revisited ⋮ Foundations of Onto-Relational Learning ⋮ Semantic operations of multiple soft sets under conflict ⋮ Reasoning on UML class diagrams ⋮ Optimizing terminological reasoning for expressive description logics ⋮ Correctness and Worst-Case Optimality of Pratt-Style Decision Procedures for Modal and Hybrid Logics ⋮ Generalized Satisfiability for the Description Logic $\mathcal{ALC}$ ⋮ Automata can show PSpace results for description logics ⋮ Natural language syntax and first-order inference ⋮ SPASS & FLOTTER version 0.42 ⋮ Building decision procedures for modal logics from propositional decision procedures — The case study of modal K ⋮ Experimental analysis of some computation rules in a simple parallel reasoning system for the ALC description logic ⋮ Subsumption computed algebraically ⋮ Description logics with contraries, contradictories, and subcontraries ⋮ Fuzzy description logics under Gödel semantics ⋮ Decidable fragments of first-order modal logics ⋮ A formal framework for description logics with uncertainty ⋮ Unification of concept terms in description logics ⋮ Inductive Logic Programming in Databases: From <scp>Datalog</scp> to ⋮ The complexity of finite model reasoning in description logics ⋮ \(\mathcal {BCDL}\): Basic constructive description logic ⋮ On the failure of the finite model property in some fuzzy description logics ⋮ Semantic decision making using ontology-based soft sets ⋮ On reasoning about structural equality in XML: a description logic approach ⋮ Automata-based axiom pinpointing ⋮ A hybrid reasoning system for terminologies and first-order clauses in knowledge bases ⋮ Extending soft sets with description logics ⋮ Reducing one class of machine learning algorithms to logical operations of plausible reasoning ⋮ Generalized modal satisfiability ⋮ The complexity of existential quantification in concept languages. ⋮ Fuzzy Description Logic Reasoning Using a Fixpoint Algorithm ⋮ A Fine-Grained Approach to Resolving Unsatisfiable Ontologies ⋮ Reasoning with rough description logics: An approximate concepts approach ⋮ An empirical analysis of modal theorem provers ⋮ Extracting Modules from Ontologies: A Logic-Based Approach ⋮ KRIPKE COMPLETENESS OF STRICTLY POSITIVE MODAL LOGICS OVER MEET-SEMILATTICES WITH OPERATORS ⋮ Normative Systems Represented as Hybrid Knowledge Bases ⋮ Description Logics ⋮ Ontologies and Databases: The DL-Lite Approach ⋮ Combining Horn rules and description logics in CARIN ⋮ Adding clauses to poor man's logic (without increasing the complexity) ⋮ Second-order reasoning in description logics ⋮ Runtime Verification Using a Temporal Description Logic ⋮ A PSpace algorithm for acyclic epistemic DL \(\mathcal{ALCS}5_m\) ⋮ Fuzzy description logics with general t-norms and datatypes ⋮ Reasoning within expressive fuzzy rough description logics ⋮ Towards Contingent World Descriptions in Description Logics ⋮ EXPtime tableaux for ALC ⋮ On the decidability status of fuzzy \(\mathcal {A}\mathcal {L}\mathcal {C}\) with general concept inclusions ⋮ Tarskian set constraints ⋮ Tractable reasoning via approximation ⋮ On the expressivity of feature logics with negation, functional uncertainty, and sort equations ⋮ Probabilistic Reasoning in the Description Logic $$\mathcal {ALCP}$$ with the Principle of Maximum Entropy ⋮ Combining interval-based temporal reasoning with general TBoxes ⋮ Decidability of SHIQ with complex role inclusion axioms
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The complexity of existential quantification in concept languages.
- An algebraic semantics approach to the effective resolution of type equations
- Computational complexity of terminological reasoning in BACK
- Reasoning and revision in hybrid representation systems
- Terminological reasoning is inherently intractable
- Login: a logic programming language with built-in inheritance
- Feature-constraint logics for unification grammars
This page was built for publication: Attributive concept descriptions with complements
