Suche mittels Attribut
Aus International Center for Computational Logic
Diese Seite stellt eine einfache Suchoberfläche zum Finden von Objekten bereit, die ein Attribut mit einem bestimmten Datenwert enthalten. Andere verfügbare Suchoberflächen sind die Attributsuche sowie der Abfragengenerator.
Liste der Ergebnisse
- Automated Reencoding of Boolean Formulas + (Automated Reencoding of Boolean Formulas)
- Automatic Verification of Liveness Properties of Randomized Systems + (Automatic Verification of Liveness Properties of Randomized Systems)
- Automatic flow classification using machine learning + (Automatic flow classification using machine learning)
- Automating Agential Reasoning: Proof-Calculi and Syntactic Decidability for STIT Logics + (Automating Agential Reasoning: Proof-Calculi and Syntactic Decidability for STIT Logics)
- Automating Reasoning with Standpoint Logic via Nested Sequents + (Automating Reasoning with Standpoint Logic via Nested Sequents)
- Autonomous, Model-Based Diagnosis Agents + (Autonomous, Model-Based Diagnosis Agents)
- Axiom Dependency Hypergraphs for Fast Modularisation and Atomic Decomposition + (Axiom Dependency Hypergraphs for Fast Modularisation and Atomic Decomposition)
- Axiom Pinpointing in General Tableaux + (Axiom Pinpointing in General Tableaux)
- Axiom Pinpointing in General Tableaux + (Axiom Pinpointing in General Tableaux)
- Axiom Pinpointing in General Tableaux + (Axiom Pinpointing in General Tableaux)
- Axiom Pinpointing is Hard + (Axiom Pinpointing is Hard)
- Axiomatizing EL^-Expressible Terminological Knowledge from Erroneous Data + (Axiomatizing EL^-Expressible Terminological Knowledge from Erroneous Data)
- Axiomatizing EL^_gfp-General Concept Inclusions in the Presence of Untrusted Individuals + (Axiomatizing EL^_gfp-General Concept Inclusions in the Presence of Untrusted Individuals)
- BCU Mathematics Contest 2001 — Problems and Solutions + (BCU Mathematics Contest 2001 — Problems and Solutions)
- BDD-Based Decision Procedures for K + (BDD-Based Decision Procedures for K)
- BDD-based Reasoning in the Fluent Calculus – First Results (Extended Abstract) + (BDD-based Reasoning in the Fluent Calculus – First Results (Extended Abstract))
- Knowledge Representation and Reasoning Seminar + (Bachelor Defense by Sebastian Hahn on 'Modulospiel', Research Talk by Emmanuelle-Anna Dietz on 'A Computational Logic Approach to Syllogisms in Human Reasoning')
- Theoretische Informatik und Logik + (Bachelor-How-To (ein Service des iFSR))
- Backward Responsibility in Transition Systems Using General Power Indices + (Backward Responsibility in Transition Systems Using General Power Indices)
- Algorithmic Game Theory + (Bank holiday)
- Models of Concurrent Systems + (Barbed Congruence)
- Basic Description Logics + (Basic Description Logics)
- Concurrency Theory + (Basic Observables)
- Foundations of Semantic Web Technologies + (Basics of Logic)
- Foundations of Semantic Web Technologies + (Basics of Logic)
- Bayesian Description Logics + (Bayesian Description Logics)
- Be lazy and don’t care: Faster CTL model checking for recursive state machines + (Be lazy and don’t care: Faster CTL model checking for recursive state machines)
- Beam Me Up! - LaTeX-Beamer For Those Who Already Know + (Beam Me Up! - LaTeX-Beamer For Those Who Already Know)
- Begabtenförderung im MINT-Bereich + (Begabtenförderung im MINT-Bereich)
- Behind the secrets of large language models + (Behind the secrets of large language models)
- Benchmark libraries for argumentation + (Benchmark libraries for argumentation)
- Theoretische Informatik und Logik + (Berechenbarkeit und Unentscheidbarkeit)
- Theoretische Informatik und Logik + (Berechenbarkeit und Unentscheidbarkeit)
- Theoretische Informatik und Logik + (Berechenbarkeit und Unentscheidbarkeit)
- Theoretische Informatik und Logik + (Besprechung Musterklausur)
- Formale Systeme + (Besprechung Musterklausur)
- Formale Systeme + (Besprechung Musterklausur)
- Theoretische Informatik und Logik + (Besprechung Probeklausur)
- Formale Systeme + (Besprechung der Musterklausur)
- Theoretische Informatik und Logik + (Besprechung der Musterklausur)
- Formale Systeme + (Besprechung der Probeklausur)
- Theoretische Informatik und Logik + (Besprechung der Übungsklausur)
- Formale Systeme + (Besprechung offener Fragen)
- Beyond ALCreg: Exploring Non-Regular Extensions of PDL with Description Logics Features + (Beyond ALCreg: Exploring Non-Regular Extensions of PDL with Description Logics Features)
- Theoretische Informatik und Logik + (Beziehungen zwischen Komplexitätsklassen / Effizient lösbare Probleme)
- Big BiRD: A Large, Fine-Grained, Bigram Relatedness Dataset for Examining Semantic Composition + (Big BiRD: A Large, Fine-Grained, Bigram Relatedness Dataset for Examining Semantic Composition)
- Models of Concurrent Systems + (Bisimilarity)
- Concurrency Theory + (Bisimilarity Algorithms for Finite State Systems)
- Concurrency Theory + (Bisimilarity Roundup: Induction and Coinduction [https://www.cs.unibo.it/~sangio/DOC_public/CoinBookPart2.pdf (Slides by Davide Sangiorgi)])
- Concurrency Theory + (Bisimilarity and All That)
- Models of Concurrent Systems + (Bisimilarity and Interaction (Part 1))