scientific article; zbMATH DE number 1936671

No author found.

Publication date: 25 June 2003

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

artificial intelligence knowledge representation description logic

Modal logic (including the logic of norms) (03B45) Logic in artificial intelligence (68T27) Knowledge representation (68T30) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35) General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to computer science (68-00)

Related Items (only showing first 100 items - show all)

Computing the least common subsumer w.r.t. a background terminology ⋮ Disjunctive logic programming with types and objects: the $\mathrm{DLV}^{+}$ system ⋮ Strong Equivalence of RASP Programs ⋮ The Truth about Defaults ⋮ Stepwise Debugging of Description-Logic Programs ⋮ Well-Supported Semantics for Logic Programs with Generalized Rules ⋮ Dual tableau-based decision procedures for relational logics with restricted composition operator ⋮ Deciding unifiability and computing local unifiers in the description logic $\mathcal{EL}$ without top constructor ⋮ Tailoring Temporal Description Logics for Reasoning over Temporal Conceptual Models ⋮ On the Undecidability of Fuzzy Description Logics with GCIs and Product T-norm ⋮ Ensuring Correctness of Model Transformations While Remaining Decidable ⋮ An approach to contextual time series analysis ⋮ Evolving objects in temporal information systems ⋮ Controlled query evaluation with open queries for a decidable relational submodel ⋮ Making fuzzy description logic more general ⋮ Using Evolution Graphs for Describing Topology-Aware Prediction Models in Large Clusters ⋮ A Framework for Semantic-Based Similarity Measures for $\mathcal{ELH}$ -Concepts ⋮ Small substructures and decidability issues for first-order logic with two variables ⋮ Understanding one another: making out meanings with Boolean equations ⋮ A logic of reachable patterns in linked data-structures ⋮ Expressive probabilistic description logics ⋮ A family of dynamic description logics for representing and reasoning about actions ⋮ A false sense of security ⋮ What makes an effective representation of information: a formal account of observational advantages ⋮ Generalizing type-2 fuzzy ontologies and type-2 fuzzy description logics ⋮ Uncertain lightweight ontologies in a product-based possibility theory framework ⋮ A Cookbook for Temporal Conceptual Data Modelling with Description Logics ⋮ A Conceptual Framework for Secrecy-preserving Reasoning in Knowledge Bases ⋮ A closeness- and priority-based logical study of social network creation ⋮ Reasoning with Global Assumptions in Arithmetic Modal Logics ⋮ Blending under deconstruction. The roles of logic, ontology, and cognition in computational concept invention ⋮ Automated synthesis of application-layer connectors from automata-based specifications ⋮ A quantitative approach to reasoning about incomplete knowledge ⋮ Effective method for detecting error causes from incoherent biological ontologies ⋮ ABox abduction in the description logic $\mathcal{ALC}$ ⋮ Adding Threshold Concepts to the Description Logic $\mathcal{EL}$ ⋮ SHACL: a description logic in disguise ⋮ Inseparability and Conservative Extensions of Description Logic Ontologies: A Survey ⋮ Inconsistency-Tolerant Querying of Description Logic Knowledge Bases ⋮ From Fuzzy to Annotated Semantic Web Languages ⋮ All About Fuzzy Description Logics and Applications ⋮ Higher-Order Modal Logics: Automation and Applications ⋮ Recent Advances in Datalog$$^\pm $$ ⋮ Extending Unification in $\mathcal{EL}$ to Disunification: The Case of Dismatching and Local Disunification ⋮ Program schemata technique for propositional program logics: a 30-year history ⋮ Construction of fuzzy OWL ontologies from fuzzy EER models: a semantics-preserving approach ⋮ The complexity of computing the behaviour of lattice automata on infinite trees ⋮ Reasoning on UML class diagrams ⋮ An Access Control Language Based on Term Rewriting and Description Logic ⋮ Debugging incoherent terminologies ⋮ Optimizing terminological reasoning for expressive description logics ⋮ Tractable reasoning and efficient query answering in description logics: The DL-Lite family ⋮ A tableau decision procedure for $\mathcal{SHOIQ}$ ⋮ Reasoning in description logics by a reduction to disjunctive datalog ⋮ The fluted fragment with transitive relations ⋮ Metamodeling and metaquerying in \texttt{OWL 2 QL} ⋮ Pay-as-you-go consequence-based reasoning for the description logic $\mathcal{SROIQ} $ ⋮ Generalized Satisfiability for the Description Logic $\mathcal{ALC}$ ⋮ Experimental analysis of some computation rules in a simple parallel reasoning system for the ALC description logic ⋮ Query answering under probabilistic uncertainty in Datalog$+/-$ ontologies ⋮ Answering regular path queries in expressive description logics via alternating tree-automata ⋮ The impact of transitive closure on the expressiveness of navigational query languages on unlabeled graphs ⋮ The complexity of finite model reasoning in description logics ⋮ Towards a functional approach to modular ontologies using institutions ⋮ GeoMergeP: geographic information integration through enriched ontology matching ⋮ Annotation theories over finite graphs ⋮ Semantic identification: balancing between complexity and validity ⋮ An investigation of parametrized difference revision operators ⋮ Checking content consistency of integrated web documents ⋮ Ontological aspects of the implementation of norms in agent-based electronic institutions ⋮ Multi-source multiple change on belief bases ⋮ Certain information granule system as a result of sets approximation by fuzzy context ⋮ Link key candidate extraction with relational concept analysis ⋮ Query answering DL-lite knowledge bases from hidden datasets ⋮ A Connection Calculus for the Description Logic $$ {\mathcal{ALC}} $$ ⋮ Blocking and other enhancements for bottom-up model generation methods ⋮ Splitting and updating hybrid knowledge bases ⋮ An algebraic view on p-admissible concrete domains for lightweight description logics ⋮ The Fusemate logic programming system ⋮ Categories: How I Learned to Stop Worrying and Love Two Sorts ⋮ Normative Systems Represented as Hybrid Knowledge Bases ⋮ Query Answering with DBoxes is Hard ⋮ Distributed Parameter Learning for Probabilistic Ontologies ⋮ Ontology Learning from Interpretations in Lightweight Description Logics ⋮ Enhancing probabilistic model checking with ontologies ⋮ Approximate Unification in the Description Logic $$\mathcal {FL}_0$$ ⋮ Query inseparability for $\mathcal{ALC}$ ontologies ⋮ Rational closure for all description logics ⋮ Optimizing the computation of overriding in $\mathcal{DL}^{\mathsf{N}}$ ⋮ Using model theory to find decidable and tractable description logics with concrete domains ⋮ Logical separability of labeled data examples under ontologies ⋮ Description logics with concrete domains and general concept inclusions revisited ⋮ On the decidability status of fuzzy $\mathcal {A}\mathcal {L}\mathcal {C}$ with general concept inclusions ⋮ Speeding up operations on feature terms using constraint programming and variable symmetry ⋮ Statistics of RDF store for querying knowledge graphs ⋮ Learning with cone-based geometric models and orthologics ⋮ Formally verified tableau-based reasoners for a description logic ⋮ Absorption for ABoxes ⋮ Inconsistency-tolerant reasoning with OWL DL ⋮ Fixed-point semantics for barebone relational concept analysis

This page was built for publication: