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
- The Undecidability of System NEL + (The Undecidability of System NEL)
- The Undecidability of the Entailment Problem in the Fluent and the Situation Calculus + (The Undecidability of the Entailment Problem in the Fluent and the Situation Calculus)
- Concurrency Theory + (The Untold Story of Hennessy and Milner)
- The Varieties of Ought-implies-Can and Deontic STIT Logic + (The Varieties of Ought-implies-Can and Deontic STIT Logic)
- The WHILE Hierarchy of Program Schemes is Infinite + (The WHILE Hierarchy of Program Schemes is Infinite)
- The Weak Completion Semantics and Counter Examples + (The Weak Completion Semantics and Counter Examples)
- The Weak Completion Semantics and Counterexamples + (The Weak Completion Semantics and Counterexamples)
- The Weak Completion Semantics and Equality + (The Weak Completion Semantics and Equality)
- Logical Modelling + (The Web Ontology Language)
- Seminar: Logical Modelling + (The Web-Ontology Language and Protege)
- Foundations of Semantic Web Technologies + (The Web: Needles in a Haystack)
- The Well-Founded Semantics is a Stratified Fitting Semantics + (The Well-Founded Semantics is a Stratified Fitting Semantics)
- The cf2 Argumentation Semantics Revisited + (The cf2 Argumentation Semantics Revisited)
- The cf2 argumentation semantics revisited + (The cf2 argumentation semantics revisited)
- The classification of homomorphism homogeneous tournaments + (The classification of homomorphism homogeneous tournaments)
- The draculasp System: Default Reasoning about Actions and Change Using Logic and Answer Set Programming + (The draculasp System: Default Reasoning about Actions and Change Using Logic and Answer Set Programming)
- The effect of tossing coins in omega-automata + (The effect of tossing coins in omega-automata)
- The instance problem and the most specific concept in the description logic EL w.r.t. terminological cycles with descriptive semantics + (The instance problem and the most specific concept in the description logic EL w.r.t. terminological cycles with descriptive semantics)
- Finite and algorithmic model theory (22/23) + (The last exercise session about ???)
- Finite and algorithmic model theory + (The last lecture [recap])
- Finite and algorithmic model theory + (The missing proofs on 0-1 law + Intro to EF Games)
- Concurrency Theory + (The pi-Calculus)
- The role of pragmatics in solving the Winograd Schema Challenge + (The role of pragmatics in solving the Winograd Schema Challenge)
- The two cultures: mashing up Web 2.0 and the Semantic Web + (The two cultures: mashing up Web 2.0 and the Semantic Web)
- The variance-penalized stochastic shortest path problem + (The variance-penalized stochastic shortest path problem)
- Seminar Logic-Based Knowledge Representation + (Theorem Proving)
- Theorem Proving for Metric Temporal Logic over the Naturals + (Theorem Proving for Metric Temporal Logic over the Naturals)
- Theorem Proving with LEAN + (Theorem Proving with LEAN)
- Theorem Proving with LEAN + (Theorem Proving with LEAN)
- Theorem Proving with LEAN + (Theorem Proving with LEAN)
- Theorem Proving with LEAN + (Theorem Proving with LEAN)
- Theoretische Informatik + (Theoretische Informatik)
- Theoretische Informatik und Logik + (Theoretische Informatik und Logik)
- Theoretische Informatik und Logik + (Theoretische Informatik und Logik)
- Theoretische Informatik und Logik + (Theoretische Informatik und Logik)
- Theoretische Informatik und Logik + (Theoretische Informatik und Logik)
- Theoretische Informatik und Logik + (Theoretische Informatik und Logik)
- Theoretische Informatik und Logik + (Theoretische Informatik und Logik)
- Theoretische Informatik und Logik + (Theoretische Informatik und Logik)
- Theoretische Informatik und Logik + (Theoretische Informatik und Logik)
- Third Conceptual Structures Tool Interoperability Workshop (CS-TIW 2008) + (Third Conceptual Structures Tool Interoperability Workshop (CS-TIW 2008))
- Tight Complexity Bounds for Reasoning in the Description Logic BEL + (Tight Complexity Bounds for Reasoning in the Description Logic BEL)
- Finite and algorithmic model theory + (Tilings and undecidability of FO)
- Complexity Theory + (Time Complexity)
- Complexity Theory + (Time Complexity)
- Complexity Theory + (Time Complexity)
- Complexity Theory + (Time Complexity)
- Complexity Theory + (Time Complexity)
- Complexity Theory + (Time Complexity and Polynomial Time)
- Complexity Theory + (Time Complexity and Polynomial Time)
- Complexity Theory + (Time Complexity and Polynomial Time)
- Foundations of Complexity Theory + (Time Complexity and Polynomial Time)
- Complexity Theory + (Time Complexity and Polynomial Time)
- Complexity Theory + (Time Complexity and Polynomial Time)