scientific article; zbMATH DE number 67501

MaRDI QIDQ4012242zbMATH OpenFDO

Authors Franz Baader, Philipp Hanschke

Publication date 27 September 1992

zbMATH Keywords

concept language extension by concrete domainsfeature-structure logicsterminological logics

Mathematics Subject Classification ID

Logic of natural languages (03B65) Logic in artificial intelligence (68T27) Knowledge representation (68T30) Natural language processing (68T50)

Recommendations

• scientific article; zbMATH DE number 2196595
• NExpTime-complete description logics with concrete domains
• Description logics with aggregates and concrete domains.
• PSpace Reasoning with the Description Logic ALCF(D)
• scientific article; zbMATH DE number 140381

Cited in

(27)

• Concrete domains
• Cardinality restrictions on concepts
• On similarity in fuzzy description logics
• CoLab: A hybrid knowledge representation and compilation laboratory
• An algebraic view on p-admissible concrete domains for lightweight description logics
• Enhancing probabilistic model checking with ontologies
• Using model theory to find decidable and tractable description logics with concrete domains
• Description logics with concrete domains and general concept inclusions revisited
• Taming past LTL and flat counter systems
• A tableau decision procedure for \(\mathcal{SHOIQ}\)
• Querying incomplete information in RDF with SPARQL
• Hybrid logics and ontology languages
• scientific article; zbMATH DE number 67502 (Why is no real title available?)
• scientific article; zbMATH DE number 140398 (Why is no real title available?)
• Unification of concept terms in description logics
• Ontology-mediated probabilistic model checking
• First steps towards taming description logics with strings
• Reasoning in OWL 2 EL with hierarchical concrete domains
• The expressive power of description logics with numerical constraints over restricted classes of models
• The concrete \textsc{Evonne}: visualization meets concrete domain reasoning
• Concrete domains meet expressive cardinality restrictions in description logics
• Combining interval-based temporal reasoning with general TBoxes
• \({\mathcal E}\)-connections of abstract description systems
• An automata-theoretic approach to constraint LTL
• A tableau algorithm for description logics with concrete domains and general TBoxes
• Data complexity of query answering in expressive description logics via tableaux
• Verification of qualitative \(\mathbb Z\) constraints

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4012242)