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

• Solving Language Equations and Disequations Using Looping Tree Automata with Colors  + (See http://lat.inf.tu-dresden.de/research/reports.html.)
• A Goal-Oriented Algorithm for Unification in ELH_R^+ w.r.t. Cycle-Restricted Ontologies  + (See http://lat.inf.tu-dresden.de/research/reports.html.)
• Computing Minimal EL-Unifiers is Hard  + (See http://lat.inf.tu-dresden.de/research/reports.html.)
• SAT Encoding of Unification in ELH_R^+ w.r.t. Cycle-Restricted Ontologies  + (See http://lat.inf.tu-dresden.de/research/reports.html.)
• Learning Formal Definitions for Snomed CT from Text  + (See http://lat.inf.tu-dresden.de/research/reports.html.)
• Exploration by Confidence  + (See http://lat.inf.tu-dresden.de/research/reports.html.)
• Model Exploration by Confidence with Completely Specified Counterexamples  + (See http://lat.inf.tu-dresden.de/research/reports.html.)
• A General Form of Attribute Exploration  + (See http://lat.inf.tu-dresden.de/research/reports.html.)
• Goedel Description Logics: Decidability in the Absence of the Finitely-Valued Model Property  + (See http://lat.inf.tu-dresden.de/research/reports.html.)
• Verification of Golog Programs over Description Logic Actions  + (See http://lat.inf.tu-dresden.de/research/reports.html.)
• Reasoning with Temporal Properties over Axioms of DL-Lite  + (See http://lat.inf.tu-dresden.de/research/reports.html.)
• Matching with respect to general concept inclusions in the Description Logic EL  + (See http://lat.inf.tu-dresden.de/research/reports.html.)
• Dismatching and Local Disunification in EL  + (See http://lat.inf.tu-dresden.de/research/reports.html.)
• LATPub702  + (See http://lat.inf.tu-dresden.de/research/reports.html.)
• LATPub703  + (See http://lat.inf.tu-dresden.de/research/reports.html.)
• Most Specific Generalizations w.r.t. General EL-TBoxes  + (See http://lat.inf.tu-dresden.de/research/reports.html.)
• LATPub721  + (See http://lat.inf.tu-dresden.de/research/reports.html.)
• Hybrid Unification in the Description Logic EL  + (See http://lat.inf.tu-dresden.de/research/reports.html.)
• On the Complexity of Temporal Query Answering  + (See http://lat.inf.tu-dresden.de/research/reports.html.)
• Conjunctive Query Answering in Rough EL  + (See http://lat.inf.tu-dresden.de/research/reports.html.)
• Towards Parallel Repair Using Decompositions  + (See http://lat.inf.tu-dresden.de/research/reports.html.)
• Error-Tolerant Reasoning in the Description Logic EL  + (See http://lat.inf.tu-dresden.de/research/reports.html.)
• The Complexity of Fuzzy Description Logics over Finite Lattices with Nominals  + (See http://lat.inf.tu-dresden.de/research/reports.html.)
• Runtime Verification Using a Temporal Description Logic Revisited  + (See http://lat.inf.tu-dresden.de/research/reports.html.)
• Combining Constraint Solving  + (See http://link.springer.de/link/service/series/0558/tocs/t2002.htm)
• Unification in a Description Logic with Inconsistency and Transitive Closure of Roles  + (See http://sunsite.informatik.rwth-aachen.de/Publications/CEUR-WS/Vol-53/)

• A Database Approach for Modeling and Querying Video Data  + (See http://www-lti.informatik.rwth-aachen.de/Forschung/Papers.html)
• Representing and Reasoning on Conceptual Queries Over Image Databases  + (See http://www-lti.informatik.rwth-aachen.de/Forschung/Papers.html)
• The Guarded Fragment of Conceptual Graphs  + (See http://www-lti.informatik.rwth-aachen.de/Forschung/Papers.html)

• Computing Least Common Subsumers in Description Logics with Existential Restrictions  + (See http://www-lti.informatik.rwth-aachen.de/Forschung/Papers.html.)
• PSpace Reasoning for DLs with Qualifying Number Restrictions  + (See http://www-lti.informatik.rwth-aachen.de/Forschung/Papers.html.)
• A PSpace-algorithm for ALCQI-satisfiability  + (See http://www-lti.informatik.rwth-aachen.de/Forschung/Papers.html.)
• The Complexity of Reasoning with Concrete Domains (Revised Version)  + (See http://www-lti.informatik.rwth-aachen.de/Forschung/Papers.html.)
• A Description Logic for Vague Knowledge  + (See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html)
• Optimisation of Terminological Reasoning  + (See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html)
• Rewriting Concepts using Terminologies  + (See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html)
• Matching in Description Logics with Existential Restrictions  + (See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html)
• On the Relation between Descripion Logics and Conceptual Graphs  + (See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.)
• Structural Subsumption Considered from an Automata Theoretic Point of View  + (See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.)
• Query Containment Using a DLR ABox  + (See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.)
• Matching Concept Descriptions with Existential Restrictions Revisited  + (See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.)
• The Complexity of Reasoning with Boolean Modal Logics (Extended Version)  + (See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.)
• Interval-based Temporal Reasoning with General TBoxes  + (See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.)
• NExpTime-complete Description Logics with Concrete Domains  + (See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.)
• Computing Least Common Subsumers in ALEN  + (See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.)
• A Tableaux Algorithm for the Clique Guarded Fragment, Preliminary Version  + (See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.)
• Rewriting Concepts Using Terminologies – Revisited  + (See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.)
• Modal Logic and the two-variable fragment  + (See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.)
• Adding Numbers to the SHIQ Description Logic—First Results  + (See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.)
• A Tableau Calculus for Temporal Description Logic: The Constant Domain Case  + (See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.)
• Optimised Reasoning for SHIQ  + (See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.)
• The Inverse Method Implements the Automata Approach for Modal Satisfiability  + (See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.)
• Unification in a Description Logic with Transitive Closure of Roles  + (See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.)