Search by property
From International Center for Computational Logic
This page provides a simple browsing interface for finding entities described by a property and a named value. Other available search interfaces include the page property search, and the ask query builder.
List of results
- A General Form of Attribute Exploration +
- A Goal-Oriented Algorithm for Unification in ELH_R^+ w.r.t. Cycle-Restricted Ontologies +
- Adding Causal Relationships to DL-based Action Formalisms +
- Complementation and Inclusion of Weighted Automata on Infinite Trees +
- Complementation and Inclusion of Weighted Automata on Infinite Trees: Revised Version +
- Computing Boundaries for Reasoning in Sub-Ontologies +
- Computing Minimal EL-Unifiers is Hard +
- Conjunctive Query Answering in Rough EL +
- Consistency in Fuzzy Description Logics over Residuated De Morgan Lattices +
- Error-Tolerant Reasoning in the Description Logic EL +
- Exploration by Confidence +
- Finding Finite Herbrand Models +
- Goedel Description Logics: Decidability in the Absence of the Finitely-Valued Model Property +
- Hybrid Unification in the Description Logic EL +
- Integrate Action Formalisms into Linear Temporal Description Logics +
- LATPub702 +
- LATPub703 +
- LATPub721 +
- Learning Formal Definitions for Snomed CT from Text +
- Matching with respect to general concept inclusions in the Description Logic EL +
- Model Exploration by Confidence with Completely Specified Counterexamples +
- Most Specific Generalizations w.r.t. General EL-TBoxes +
- On Confident GCIs of Finite Interpretations +
- On the Complexity of Axiom Pinpointing in Description Logics +
- On the Complexity of Temporal Query Answering +
- On the Decidability of Verifying LTL Properties of Golog Programs +
- Putting ABox Updates into Action +
- Reasoning with Temporal Properties over Axioms of DL-Lite +
- Runtime Verification Using a Temporal Description Logic Revisited +
- SAT Encoding of Unification in EL +
- SAT Encoding of Unification in ELH_R^+ w.r.t. Cycle-Restricted Ontologies +
- Solving Language Equations and Disequations Using Looping Tree Automata with Colors +
- Temporal Query Answering w.r.t. DL-Lite-Ontologies +
- The Complexity of Fuzzy Description Logics over Finite Lattices with Nominals +
- Towards Parallel Repair Using Decompositions +
- Towards a Tableau Algorithm for Fuzzy ALC with Product T-norm +
- Undecidability of Fuzzy Description Logics +
- Unification in the Description Logic EL Without the Top Concept +
- Unification in the Description Logic EL w.r.t. Cycle-Restricted TBoxes +
