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
- Finite and algorithmic model theory + (Finite and algorithmic model theory: Locality (Vorlesung))
- Finite and algorithmic model theory + (Finite and algorithmic model theory: Model checking on graphs with bounded degree and NP-completeness of FO1 and C1 (Vorlesung))
- Finite and algorithmic model theory + (Finite and algorithmic model theory: NO EXERCISES (Entfällt))
- Finite and algorithmic model theory + (Finite and algorithmic model theory: No exercises (Entfällt))
- Finite and algorithmic model theory + (Finite and algorithmic model theory: No lecture (Entfällt))
- Finite and algorithmic model theory + (Finite and algorithmic model theory: Proving E-F Games (Vorlesung))
- Finite and algorithmic model theory + (Finite and algorithmic model theory: Q&A (Übung))
- Finite and algorithmic model theory + (Finite and algorithmic model theory: The last lecture [recap] (Vorlesung))
- Finite and algorithmic model theory + (Finite and algorithmic model theory: The missing proofs on 0-1 law + Intro to EF Games (Vorlesung))
- Finite and algorithmic model theory + (Finite and algorithmic model theory: Tilings and undecidability of FO (Vorlesung))
- Finite and algorithmic model theory + (Finite and algorithmic model theory: Zero-One Laws of FO (Vorlesung))
- Finite-Cliquewidth Sets of Existential Rules: Toward a General Criterion for Decidable yet Highly Expressive Querying + (Finite-Cliquewidth Sets of Existential Rules: Toward a General Criterion for Decidable yet Highly Expressive Querying)
- First-Order Rule Learning Through a Pulsed Neural Network + (First-Order Rule Learning Through a Pulsed Neural Network)
- Fixed-Domain Reasoning for Description Logics + (Fixed-Domain Reasoning for Description Logics)
- Flexible Dispute Derivations with Forward and Backward Arguments for Assumption-Based Argumentation + (Flexible Dispute Derivations with Forward and Backward Arguments for Assumption-Based Argumentation)
- Fluted Logic with Counting + (Fluted Logic with Counting)
- Forgetting Atoms and Arguments + (Forgetting Atoms and Arguments)
- Formale Systeme + (Formale Systeme: 1. Begrüßung und Einleitung (Vorlesung))
- Formale Systeme + (Formale Systeme: 1. Formale Sprachen (Vorlesung))
- Formale Systeme + (Formale Systeme: 1. Vorlesung: Formale Sprachen (Vorlesung))
- Formale Systeme + (Formale Systeme: 1. Übungsblatt (Übung))
- Formale Systeme + (Formale Systeme: 1. Übungsblatt (Übung))
- Formale Systeme + (Formale Systeme: 1. Übungsblatt (Übung))
- Formale Systeme + (Formale Systeme: 10. Grenzen regulärer Sprachen / Probleme für Automaten (Vorlesung))
- Formale Systeme + (Formale Systeme: 10. Grenzen regulärer Sprachen / Probleme regulärer Sprachen (Vorlesung))
- Formale Systeme + (Formale Systeme: 10. Vorlesung: Grenzen regulärer Sprachen / Probleme regulärer Sprachen (Vorlesung))
- Formale Systeme + (Formale Systeme: 10. Übungsblatt (Übung))
- Formale Systeme + (Formale Systeme: 10. Übungsblatt (Übung))
- Formale Systeme + (Formale Systeme: 10. Übungsblatt (Übung))
- Formale Systeme + (Formale Systeme: 11. Von regulären zu kontextfreien Sprachen (Vorlesung))
- Formale Systeme + (Formale Systeme: 11. Von regulären zu kontextfreien Sprachen (Vorlesung))
- Formale Systeme + (Formale Systeme: 11. Vorlesung: Von regulären zu kontextfreien Sprachen (Vorlesung))
- Formale Systeme + (Formale Systeme: 11. Übungsblatt (Übung))
- Formale Systeme + (Formale Systeme: 11. Übungsblatt (Übung))
- Formale Systeme + (Formale Systeme: 11. Übungsblatt (Übung))
- Formale Systeme + (Formale Systeme: 12. Das Wortproblem für kontextfreie Sprachen (Vorlesung))
- Formale Systeme + (Formale Systeme: 12. Das Wortproblem für kontextfreie Sprachen (Vorlesung))
- Formale Systeme + (Formale Systeme: 12. Vorlesung: Das Wortproblem für kontextfreie Sprachen (Vorlesung))
- Formale Systeme + (Formale Systeme: 12. Übungsblatt (Übung))
- Formale Systeme + (Formale Systeme: 12. Übungsblatt (Übung))
- Formale Systeme + (Formale Systeme: 12. Übungsblatt (Übung))
- Formale Systeme + (Formale Systeme: 13. Das Pumping Lemma kontextfreier Sprachen (Vorlesung))
- Formale Systeme + (Formale Systeme: 13. Das Pumping-Lemma für kontextfreie Sprachen (Vorlesung))
- Formale Systeme + (Formale Systeme: 13. Vorlesung: Das Pumping-Lemma für kontextfreie Sprachen (Vorlesung))
- Formale Systeme + (Formale Systeme: 13. Übungsblatt (Übung))
- Formale Systeme + (Formale Systeme: 13. Übungsblatt (Übung))
- Formale Systeme + (Formale Systeme: 13. Übungsblatt (Übung))
- Formale Systeme + (Formale Systeme: 14. Abschlusseigenschaften kontextfreier Sprachen (Vorlesung))
- Formale Systeme + (Formale Systeme: 14. Abschlusseigenschaften kontextfreier Sprachen (Vorlesung))
- Formale Systeme + (Formale Systeme: 14. Vorlesung: Abschlusseigenschaften kontextfreier Sprachen (Vorlesung))
- Formale Systeme + (Formale Systeme: 14. Übungsblatt (Übung))
- Formale Systeme + (Formale Systeme: 14. Übungsblatt (Übung))
- Formale Systeme + (Formale Systeme: 15. Einleitung Kellerautomaten (Vorlesung))