Search by property

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

• SAT Encoding of Unification in EL  + (10-04)

• Unification in the Description Logic EL Without the Top Concept  + (11-01)
• Complementation and Inclusion of Weighted Automata on Infinite Trees: Revised Version  + (11-02)
• Towards a Tableau Algorithm for Fuzzy ALC with Product T-norm  + (11-03)
• Finding Finite Herbrand Models  + (11-04)
• Unification in the Description Logic EL w.r.t. Cycle-Restricted TBoxes  + (11-05)
• Undecidability of Fuzzy Description Logics  + (11-06)
• Solving Language Equations and Disequations Using Looping Tree Automata with Colors  + (12-01)
• SAT Encoding of Unification in ELH_R^+ w.r.t. Cycle-Restricted Ontologies  + (12-02)
• Computing Minimal EL-Unifiers is Hard  + (12-03)
• Consistency in Fuzzy Description Logics over Residuated De Morgan Lattices  + (12-04)
• A Goal-Oriented Algorithm for Unification in ELH_R^+ w.r.t. Cycle-Restricted Ontologies  + (12-05)
• Hidden Units, Equivalences and Implications (Poster Presentation)  + (12-05)
• On Confident GCIs of Finite Interpretations  + (12-06)
• On the Complexity of Temporal Query Answering  + (13-01)
• A General Form of Attribute Exploration  + (13-02)
• Learning Formal Definitions for Snomed CT from Text  + (13-03)
• Exploration by Confidence  + (13-04)
• Temporal Query Answering w.r.t. DL-Lite-Ontologies  + (13-05)
• Most Specific Generalizations w.r.t. General EL-TBoxes  + (13-06)
• Hybrid Unification in the Description Logic EL  + (13-07)
• Verification of Golog Programs over Description Logic Actions  + (13-08)
• Goedel Description Logics: Decidability in the Absence of the Finitely-Valued Model Property  + (13-09)
• On the Decidability of Verifying LTL Properties of Golog Programs  + (13-10)
• Model Exploration by Confidence with Completely Specified Counterexamples  + (13-11)
• LATPub721  + (13-12)
• Runtime Verification Using a Temporal Description Logic Revisited  + (14-01)
• The Complexity of Fuzzy Description Logics over Finite Lattices with Nominals  + (14-02)
• Matching with respect to general concept inclusions in the Description Logic EL  + (14-03)
• Conjunctive Query Answering in Rough EL  + (14-04)
• Towards Parallel Repair Using Decompositions  + (14-05)
• Reasoning with Temporal Properties over Axioms of DL-Lite  + (14-06)