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

• Unification of Concept Terms in Description Logics: Revised Version  + (LTCS-98-07)
• A PSpace-algorithm for deciding ALCNI_R^+-satisfiability  + (LTCS-98-08)
• Computing Least Common Subsumers in Description Logics with Existential Restrictions  + (LTCS-98-09)
• The Guarded Fragment of Conceptual Graphs  + (LTCS-98-10)
• On the Relation between Descripion Logics and Conceptual Graphs  + (LTCS-98-11)
• The Complexity of Reasoning with Concrete Domains (Revised Version)  + (LTCS-99-01)
• Representing and Reasoning on Conceptual Queries Over Image Databases  + (LTCS-99-02)
• A Database Approach for Modeling and Querying Video Data  + (LTCS-99-03)
• On the Complexity of Terminological Reasoning  + (LTCS-99-04)
• A NEXPTIME-complete Description Logic Strictly Contained in C^2  + (LTCS-99-05)
• Rewriting Concepts using Terminologies  + (LTCS-99-06)
• Matching in Description Logics with Existential Restrictions  + (LTCS-99-07)
• A Description Logic with Transitive and Converse Roles, Role Hierarchies and Qualifying Number Restrictions  + (LTCS-99-08)
• A PSpace-algorithm for ALCQI-satisfiability  + (LTCS-99-09)
• PSpace Reasoning for DLs with Qualifying Number Restrictions  + (LTCS-99-11)
• Matching Concept Descriptions with Existential Restrictions Revisited  + (LTCS-99-13)
• Optimisation of Terminological Reasoning  + (LTCS-99-14)
• Query Containment Using a DLR ABox  + (LTCS-99-15)
• Techreport3049  + (LTCS-Report 19-09)
• On the Complexity and Expressiveness of Description Logics with Counting  + (LTCS-Report 19-09)
• On the Abstract Expressive Power of Description Logics with Concrete Domains (Extended Version)  + (LTCS-Report 23-02)
• A Multi-Dimensional Terminological Knowledge Representation Language  + (MPI-I-93-212)
• A Multi-Dimensional Terminological Knowledge Representation Language  + (MPI-I-95-2-005)
• LATPub37  + (SWP--92--12)
• 17. WLP: Workshop Logische Programmierung, TU Dresden, December 11–13, 2002  + (TUD--FI03--03)

• Different Approaches to the Semantics of Workflow  + (TUD-FI01-04)

• riss 2010 Solver Description  + (Technical Report 2010-02)
• Search Space Splitting with Lookahead  + (Technical Report 2012-04)
• An Efficient Encoding of the at-most-one Constraint  + (Technical Report 2013-04)
• Deciding the Word Problem in the Union of Equational Theories  + (UIUCDCS-R-98-2073)
• Towards Nonmonotonic Reasoning on Hierarchical Knowledge  + (WV--02--09)
• A generalized resolution theorem  + (WV--03--13)
• Default reasoning over domains and concept hierarchies  + (WV--03--14)
• Corollaries on the fixpoint completion: studying the stable semantics by means of the Clark completion  + (WV--03--15)
• A Normalization Algorithm for Automated First-Order Value Iteration  + (WV--03--16)
• Generalized Ultrametric Spaces in Quantitative Domain Theory  + (WV--04--02)
• From the Calculus of Structures to Term Rewriting Systems  + (WV--04--03)
• Plans as Formulae with a Non-commutative Logical Operator - Planning as Concurrency  + (WV--04--06)
• A Calculus of Order and Interaction  + (WV-01-01)
• MELL in the Calculus of Structures  + (WV-01-03)
• Properties of a Logical System in the Calculus of Structures  + (WV-01-06)
• Continuity of Semantic Operators in Logic Programming and Their Approximation by Artificial Neural Networks  + (WV-01-07)
• A1-Unification  + (WV-01-08)
• Combining A1- and AC1-Unification Sharing Unit  + (WV-01-09)
• Convergence Classes and Spaces of Partial Functions  + (WV-02-02)
• Two Restrictions on Contraction  + (WV-02-04)
• Resolution and Logic Programming in Algebraic Domains: Negation and Defaults  + (WV-02-05)
• A System of Interaction and Structure  + (WV-02-10)
• Atomic Cut Elimination for Classical Logic  + (WV-02-11)
• Contexts, Concepts, and Logic of Domains  + (WV-02-12)
• Circular Belief in Logic Programming Semantics  + (WV-02-13)