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
- Rechnen mit DNA - Eine Einführung in Theorie und Praxis + (Thomas)
- Logics for Reasoning about Preferences, Uncertainty, and Vagueness + (Thomas)
- A Uniform Account of Realizability in Abstract Argumentation + (Thomas)
- A Glimpse on Gerhard Brewka's Contributions to Artificial Intelligence + (Thomas)
- Characterizing Realizability in Abstract Argumentation + (Thomas)
- The classification of homomorphism homogeneous tournaments + (Thomas)
- Finite-Cliquewidth Sets of Existential Rules – Toward a General Criterion for Decidable yet Highly Expressive Querying + (Thomas)
- Proceedings of the Joint Ontology Workshops 2022 Episode VIII: The Svear Sommar of Ontology, Jönköping, Sweden. + (Tiago)
- Preference-driven Control over Incompleteness of Knowledge Graph Query Answers + (Till)
- The Basics of Display Calculi + (Tim)
- From Display to Labelled Proofs for Tense Logics + (Tim)
- Automating Agential Reasoning: Proof-Calculi and Syntactic Decidability for STIT Logics + (Tim)
- Syntactic Interpolation for Tense Logics and Bi-Intuitionistic Logic via Nested Sequents + (Tim)
- On the Correspondence between Nested Calculi and Semantic Systems for Intuitionistic Logics + (Tim)
- Nested Sequents for Intuitionistic Modal Logics via Structural Refinement + (Tim)
- Refining Labelled Systems for Modal and Constructive Logics with Applications + (Tim)
- A Framework for Intuitionistic Grammar Logics + (Tim)
- Automating Reasoning with Standpoint Logic via Nested Sequents + (Tim)
- Uniform and Modular Sequent Systems for Description Logics + (Tim)
- Connecting Proof Theory and Knowledge Representation: Sequent Calculi and the Chase with Existential Rules + (Tim)
- Nested Sequents for Intermediate Logics: The Case of Gödel-Dummett Logics + (Tim)
- Nested Sequents for Quantified Modal Logics + (Tim)
- Derivation-Graph-Based Characterizations of Decidable Existential Rule Sets + (Tim)
- Constructive Interpolation and Concept-Based Beth Definability for Description Logics via Sequents + (Tim)
- Proof Theory and Decision Procedures for Deontic STIT Logics + (Tim)
- Taking Bi-Intuitionistic Logic First-Order: A Proof-Theoretic Investigation via Polytree Sequents + (Tim)
- Unifying Sequent Systems for Gödel-Löb Provability Logic via Syntactic Transformations + (Tim)
- On Explicit Solutions to Fixed-Point Equations in Propositional Dynamic Logic + (Tim)
- Internal and External Calculi: Ordering the Jungle without Being Lost in Translations + (Tim)
- A Spectrum of Approximate Probabilistic Bisimulations + (Timm)
- QUITE: Quantifying Uncertainty in Natural Language Text in Bayesian Reasoning Scenarios + (Timo Pierre)
- Abstract Domains for Database Manipulating Processes + (Tobias)
- Checking Equivalence for Reo Networks + (Tobias)
- Clause Simplifications in Search-Space Decomposition-Based SAT Solvers + (Tobias)
- Determinization and Limit-Determinization of Emerson-Lei Automata + (Tobias)
- Distributed wait state tracking for runtime MPI deadlock detection + (Tobias)
- Efficient Feature Parameterisation for Visual SLAM Using Inverse Depth Bundles + (Tobias)
- From Emerson-Lei Automata to Deterministic, Limit-Deterministic or Good-for-MDP Automata + (Tobias)
- Generic CDCL - A Formalization of Modern Propositional Satisfiability Solvers + (Tobias)
- Generic CDCL - A Formalization of Modern Propositional Satisfiability Solvers + (Tobias)
- Planar Features for Visual SLAM + (Tobias)
- Smoke Test Planning using Answer Set Programming + (Tobias)
- Validating Unsatisfiability Results of Clause Sharing Parallel SAT Solvers + (Tobias)
- Discovering Implicational Knowledge in Wikidata + (Tom)
- Discovering Implicational Knowledge in Wikidata + (Tom)
- Discovering Implicational Knowledge in Wikidata + (Tom)
- The Exploration Game + (Tom)
- Interactively Discovering Implicational Knowledge in Wikidata + (Tom)
- A Note on Limited Pushdown Alphabets in Stateless Deterministic Pushdown Automata + (Tomáš)
- A note on controllability of deterministic context-free systems + (Tomáš)
- A Note on Undecidability of Observation Consistency for Non-Regular Languages + (Tomáš)
- Bounded Number of Parallel Productions in Scattered Context Grammars with Three Nonterminals + (Tomáš)
- Regulated Nondeterminism in Pushdown Automata: The Non-Regular Case + (Tomáš)
- Simple restriction in context-free rewriting + (Tomáš)
- Comparison of Two Context-Free Rewriting Systems with Simple Context-Checking Mechanisms + (Tomáš)
- On Pure Multi-Pushdown Automata that Perform Complete Pushdown Pops + (Tomáš)
- On the Terminating Derivation Mode in Cooperating Distributed Grammar Systems with Forbidding Components + (Tomáš)
- On context-free rewriting with a simple restriction and its computational completeness + (Tomáš)
- On the descriptional complexity of scattered context grammars + (Tomáš)
- A Note on the Generative Power of Some Simple Variants of Context-Free Grammars Regulated by Context Conditions + (Tomáš)
- Regulated Nondeterminism in PDAs: The Non-Regular Case + (Tomáš)
- Descriptional Complexity of Three-Nonterminal Scattered Context Grammars: An Improvemen + (Tomáš)
