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
- Temporal reasoning with DatalogMTL + (Temporal reasoning with DatalogMTL)
- Temporalising Tractable Description Logics + (Temporalising Tractable Description Logics)
- Temporalizing Ontology-Based Data Access + (Temporalizing Ontology-Based Data Access)
- Temporalizing Rewritable Query Languages over Knowledge Bases + (Temporalizing Rewritable Query Languages over Knowledge Bases)
- Temporally Attributed Description Logics + (Temporally Attributed Description Logics)
- Tempus Fugit - Towards an Ontology Update Language + (Tempus Fugit - Towards an Ontology Update Language)
- Term Rewriting Systems + (Term Rewriting Systems)
- Term Rewriting Systems + (Term Rewriting Systems)
- Term Rewriting Systems + (Term Rewriting Systems)
- Term Rewriting Systems + (Term Rewriting Systems)
- Term Rewriting Systems + (Term Rewriting Systems)
- Term Rewriting Systems + (Term Rewriting Systems)
- Term Rewriting and All That + (Term Rewriting and All That)
- Term Rewriting and All That + (Term Rewriting and All That)
- Termersetzungssysteme, Skript zur Vorlesung + (Termersetzungssysteme, Skript zur Vorlesung)
- Terminological Cycles in KL-ONE-based Knowledge Representation Languages + (Terminological Cycles in KL-ONE-based Knowledge Representation Languages)
- Terminological Cycles in KL-ONE-based Knowledge Representation Languages + (Terminological Cycles in KL-ONE-based Knowledge Representation Languages)
- Terminological Cycles in a Description Logic with Existential Restrictions + (Terminological Cycles in a Description Logic with Existential Restrictions)
- Terminological Cycles in a Description Logic with Existential Restrictions + (Terminological Cycles in a Description Logic with Existential Restrictions)
- Terminological Knowledge Representation: A Proposal for a Terminological Logic + (Terminological Knowledge Representation: A Proposal for a Terminological Logic)
- Terminological Logics with Modal Operators + (Terminological Logics with Modal Operators)
- Terminological Logics with Modal Operators + (Terminological Logics with Modal Operators)
- Terminological Reasoning in SHIQ with Ordered Binary Decision Diagrams + (Terminological Reasoning in SHIQ with Ordered Binary Decision Diagrams)
- Terminologie und Multilinguales Semantic Web in Symbiose – TBX, RDF und OWL + (Terminologie und Multilinguales Semantic Web in Symbiose – TBX, RDF und OWL)
- Terminologische Logiken + (Terminologische Logiken)
- Terminology Harmonization in Industry Classification Standards + (Terminology Harmonization in Industry Classification Standards)
- Terminology Meets the Multilingual Semantic Web – Terms as Labels of Concepts + (Terminology Meets the Multilingual Semantic Web – Terms as Labels of Concepts)
- Terminology-based patterns for natural language definitions in ontologies + (Terminology-based patterns for natural language definitions in ontologies)
- The 10, 000 Facets of MDP Model Checking + (The 10, 000 Facets of MDP Model Checking)
- The 2019 Comparison of Tools for the Analysis of Quantitative Formal Models - (QComp 2019 Competition Report) + (The 2019 Comparison of Tools for the Analysis of Quantitative Formal Models - (QComp 2019 Competition Report))
- The 21st International Workshop on Description Logics 2008 + (The 21st International Workshop on Description Logics 2008)
- The 21st International Workshop on Description Logics 2008 + (The 21st International Workshop on Description Logics 2008)
- The ASPARTIX System Suite + (The ASPARTIX System Suite)
- The Abstract Expressive Power of First-Order and Description Logics with Concrete Domains + (The Abstract Expressive Power of First-Order and Description Logics with Concrete Domains)
- The Basics of Display Calculi + (The Basics of Display Calculi)
- The Bayesian Description Logic BEL + (The Bayesian Description Logic BEL)
- The Bayesian Ontology Language BEL + (The Bayesian Ontology Language BEL)
- The Bayesian Ontology reasoner is BORN! + (The Bayesian Ontology reasoner is BORN!)
- The Boolean Solution Problem from the Perspective of Predicate Logic – Extended Version + (The Boolean Solution Problem from the Perspective of Predicate Logic – Extended Version)
- The Boolean Solution Problem from the Perspective of Predicate Logic + (The Boolean Solution Problem from the Perspective of Predicate Logic)
- The Boundary between Decidable and Undecidable Fragments of the Fluent Calculus + (The Boundary between Decidable and Undecidable Fragments of the Fluent Calculus)
- The Combined Approach to Query Answering Beyond the OWL 2 Profiles + (The Combined Approach to Query Answering Beyond the OWL 2 Profiles)
- The Combined Approach to Query Answering in Horn-ALCHOIQ + (The Combined Approach to Query Answering in Horn-ALCHOIQ)
- The Combined Approach to Query Answering in Horn-ALCHOIQ + (The Combined Approach to Query Answering in Horn-ALCHOIQ)
- The Combined Approach to Query Answering in Horn-ALCHOIQ + (The Combined Approach to Query Answering in Horn-ALCHOIQ)
- The Combined Approach to Query Answering in Horn-ALCHOIQ + (The Combined Approach to Query Answering in Horn-ALCHOIQ)
- The Combined Approach to Query Answering in Horn-ALCHOIQ + (The Combined Approach to Query Answering in Horn-ALCHOIQ)
- The Combined Approach to Query Answering in Horn-ALCHOIQ (Extended Abstract) + (The Combined Approach to Query Answering in Horn-ALCHOIQ (Extended Abstract))
- The Complexity of Answering Conjunctive and Navigational Queries over OWL 2 EL Knowledge Bases + (The Complexity of Answering Conjunctive and Navigational Queries over OWL 2 EL Knowledge Bases)
- The Complexity of Computing the Behaviour of Lattice Automata on Infinite Trees + (The Complexity of Computing the Behaviour of Lattice Automata on Infinite Trees)
- The Complexity of Computing the Behaviour of Weighted Büchi Automata over Lattices + (The Complexity of Computing the Behaviour of Weighted Büchi Automata over Lattices)