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
- Explorations into Belief State Compression + (Ali Elhalawaty)
- Temporal Logics with Probabilistic Distributions + (Alisa Kovtunova)
- Can A.I. Provably Explain Itself? A gentle Introduction to Description Logics + (Alisa Kovtunova)
- In the Hand of the Beholder: Comparing Interactive Proof Visualizations + (Alisa Kovtunova)
- Learning Description Logic Ontologies via Queries + (Ana Ozaki)
- Metric Temporal Description Logics with Interval-Rigid Names + (Ana Ozaki)
- Attributed Description Logics: Ontologies for Knowledge Graphs + (Ana Ozaki)
- Notes on Computational Learning Theory and the problem of learning CNFs + (Ana Ozaki)
- Learning Ontologies with Epistemic Reasoning: The EL Case + (Ana Ozaki)
- Finite Base Contraction and Expansion via Models - The ALC case + (Ana Ozaki)
- Querying Wikidata with GraphQL + (Anas Shahab)
- On Mono- and Multilingual Word embeddings for NLP + (Anatoly Zelenin)
- Question Answering Systems + (Anatoly Zelenin)
- Question Answering over Real-World Knowledge Graphs + (Anatoly Zelenin)
- From Classical to Consistent Query Answering under Existential Rules + (Andreas Pieris)
- SHACL validation over DL-Lite, ELHI and Horn-SHIQ ontologies (or calculating the core chase layer-by-layer) + (Anouk Michelle Oudshoorn)
- A Distributed Blockchain Model of Selfish Mining + (Ansgar Fehnker)
- Monotone Monadic SNP 2: Proof of the Universal-algebraic Dichotomy Conjecture + (Antoine Mottet)
- Introduction to p-adic numbers and analysis + (Anton Claußnitzer)
- Minesweeper goes Kaboom (in ASP) - and what makes it difficult + (Antonio Hentschke)
- Finding p-indecomposable Functions + (Artem Revenko)
- Cyclic Proof Theory + (Bahareh Afshari (University of Gothenburg))
- Modal Separation Logic: an ongoing quest for elementary complexity + (Bartosz Bednarczyk)
- Worst-Case Optimal Querying of Very Expressive Description Logics with Path Expressions and Succinct Counting + (Bartosz Bednarczyk)
- "Most of" leads to undecidability: Failure of adding frequencies to LTL + (Bartosz Bednarczyk)
- Exploiting forwardness: Satisfiability and Query-Entailment in Forward Guarded Fragment + (Bartosz Bednarczyk)
- On Classical Decidable Logics extended with Percentage Quantifiers and Arithmetics + (Bartosz Bednarczyk)
- The Price of Selfishness: Conjunctive Query Entailment for ALCSelf is 2EXPTIME-hard + (Bartosz Bednarczyk)
- Database-Inspired Reasoning Problems in Description Logics With Path Expressions + (Bartosz Bednarczyk)
- How I made my research more VISIBLE? Undecidability Results for ALC Extended with Visibly Pushdown Path Expressions. + (Bartosz Bednarczyk)
- Data Complexity in Expressive Description Logics With Path Expressions + (Bartosz Bednarczyk)
- PhD Defense of Bartosz Bednarczyk + (Bartosz Bednarczyk)
- Verification of Knowledge-Based Programs over Description Logic Actions + (Benjamin Zarrieß)
- Verification of Golog Programs over Description Logic Actions + (Benjamin Zarrieß)
- Complexity of Projection with Stochastic Actions in a Probabilistic Description Logic + (Benjamin Zarrieß)
- Logical Foundations of Linked Data Anonymisation + (Bernardo Cuenca Grau)
