Kategorie:Veranstaltung
Aus International Center for Computational Logic
The category of events. Seiten in dieser Kategorie nutzen das Formular „Veranstaltung“.
Seiten in der Kategorie „Veranstaltung“
Folgende 200 Seiten sind in dieser Kategorie, von 241 insgesamt.
(vorherige Seite) (nächste Seite)1
2
A
- A diamond in the rough: Theorizing column stores
- A Dichotomy for Evaluating Simple Regular Path Queries
- A Distributed Blockchain Model of Selfish Mining
- A pragmatic approach to translation: Vocabulary alignment through Multiagent Interaction and Observation
- A proof of CSP Dichotomy conjecture
- A Semantic Characterization of Belief Base Revision for Arbitrary Monotonic Logics
- A Single Approach to Decide Chase Termination on Linear Existential Rules
- A.M.B.R.O.S.I.A. - Conferring Immortality on Distributed Applications
- Adaptive Language Interaction
- Adding Threshold Concepts to the Description Logic EL
- Advances in Abstract Argumentation - Expressiveness and Dynamics
- An Implementation of a Labelling-based Algorithm for the cf2 Argumentation Semantics
- An Introduction to Wikidata
- Answering Temporal Conjunctive Queries over DL Ontologies
- ASNP: a tame fragment of existential second-order logic
- ASPARTIX-D Ready for the Competition
- Attributed Description Logics: Ontologies for Knowledge Graphs
- Augmenting human cognition in collaborative knowledge collections
- Automata, Logic, Algebra... What do they have in common?
- Automatic Extraction of Compositional Matrix-Space Models of Language
- Automatic translation of clinical trial eligibility criteria into formal queries
B
C
- Can A.I. Provably Explain Itself? A gentle Introduction to Description Logics
- Characterization of the Expressivity of Existential Rule Queries
- Chasing Sets: How to Use Existential Rules for Expressive Reasoning
- Chasing Sets: How to Use Existential Rules for Expressive Reasoning (Extended Abstract)
- Checking Chase Termination over Ontologies of Existential Rules with Equality
- Chile – A Trip Report
- Classification of the finite polymorphism-homogeneous tournaments with loops
- Closed-World Semantics for Conjunctive Queries with Negation over ELH bottom Ontologies
- Codifying Logical Fragments in ASP - A General Knowledge Base Approach
- Complexity of Projection with Stochastic Actions in a Probabilistic Description Logic
- Compositional Matrix-Space Models: Learning Methods and Evaluation
- Conceptual Visualization and Navigation Methods for Polyadic Formal Concept Analysis
- Constraint Propagation and Pebble Games
- Containment of Monadic Datalog
- Context Reasoning for Role-Based Models
D
E
- Efficient Model Construction for Horn Logic with VLog
- Efficient Model Construction for Horn Logic with VLog: Extended Abstract
- Efficiently Solving Unbounded Integer Programs in the context of SMT Solvers
- Embodied Terminology: Language, Knowledge, and Cognition
- EMCL Student Workshop 2017
- EMCL Student Workshop Summer 2010
- Employing DL-Lite reasoners for fuzzy query answering: Take a FLite!
- Enabling Fine-grained RDF Data Completeness Assessment
- Ensuring Soundness for SPARQL with Negation Using Completeness Statements
- Enterprise Management in the Presence of Data
- EPCL PhD Workshop
- EPCL PhD Workshop 2012
- EPCL PhD Workshop 2014
- Epistemic Answer Set Programming
- Explaining Answer Sets using Argumentation Theory
- Explaining neural network reasoning
- Exploiting forwardness: Satisfiability and Query-Entailment in Forward Guarded Fragment
- Explorations into Belief State Compression
- Extending Datalog with Sets Using an Encoding in Existential Rules
- Extending EL++ with Linear Constraints on the Probability of Axioms
- Extending Matching in Description Logics
F
- Faceted Answer-Set Navigation
- Finding p-indecomposable Functions
- Fixed Domain Reasoning for Description Logics
- Framework for the Specification and Execution of parallel Clustering Algorithms
- From Classical to Consistent Query Answering under Existential Rules
- From Horn-SRIQ to Datalog: A Data-Independent Transformation that Preserves Assertion Entailment
- Functional models and Data Complexity for FL0
G
I
- ICCL Summer School 'Bridging the Gap between Human and Automated Reasoning', September 18-29, 2017, Dresden
- ICCL Summer School 2005
- ICCL Summer School 2006
- ICCL Summer School 2008
- ICCL Summer School 2010
- ICCL Summer School 2013
- ICCL Summer School 2015
- Image schemas in computational concept invention
- Imprecise Probabilities in Decision-making
- Improved Answer-Set Programming Encodings for Abstract Argumentation
- Inconsistency Handling in Ontology-Mediated Query Answering
- Inconsistency Values for Logic Programs under Answer Set Semantics
- Integrating Semantic Web in the Real World: A journey between two cities
- Integration and Evaluation of an ASP-Solver as an Alternative Reasoning Backend in the Rulewerk Toolkit
- Interface between Logical Analysis of Data and Formal Concept Analysis
- Intertranslatability of Labeling-based Argumentation Semantics
- Introducing a Semantic Web Portal for Everyone
- Introducing Existential Rules and Module Extraction
- Introducing the Gitlab installation on https://iccl-share.inf.tu-dresden.de
- Introduction to p-adic numbers and analysis
K
L
- Learning Description Logic Ontologies via Queries
- Learning in Fuzzy Description Logics
- Learning Ontologies with Epistemic Reasoning: The EL Case
- Learning Word Representation in Compositional Matrix-Space Models
- Lecture on Partition Width
- Logic for Database Systems Implementation (or Life beyond Lite Logics and CQ/UCQ)
- Logic on MARS: Ontologies for Generalised Property Graphs
- Logical Foundations of Linked Data Anonymisation
- Lyndon words and density of runs
M
- Making Repairs in Description Logics More Gentle
- Making sense of conflicting defeasible rules in the controlled natural language ACE: design of a system with support for existential quantification using skolemization
- Managing and Consuming Completeness Information for RDF Data Sources
- Membership Constraints in Formal Concept Analysis
- Metric Temporal Description Logics with Interval-Rigid Names
- Mining DL ontologies
- Mixing Description Logics in Privacy-Preserving Ontology Publishing
- Modal Separation Logic: an ongoing quest for elementary complexity
- Modeling Computational Properties of Description Logics in ASP
- Modeling Concept Learning Problems with Second-Order Description Logics
- Modelling Dynamics in Semantic Web Knowledge Graphs with Formal Concept Analysis
- Monotone Monadic SNP 1: Classical Results and Applications
- Monotone Monadic SNP 2: Proof of the Universal-algebraic Dichotomy Conjecture
- Most Probable Explanations for Probabilistic Database Queries
- Musings on the Semantics of SPARQL
N
- News about Reasoning with Bit-Vectors
- NextClosures: Parallel Computation of the Canonical Base
- Not too Big, Not too Small ... Complexities of Fixed-Domain Reasoning in First-Order and Description Logics
- Notation3 Logic: From informal to formal semantics
- Notes on Computational Learning Theory and the problem of learning CNFs
O
- On Computing Explanations in Argumentation
- On inconsistency-minimizing, paraconsistent reasoning in knowledge bases
- On Mono- and Multilingual Word embeddings for NLP
- On the Complexity of k-Piecewise Testability and the Depth of Automata
- On the Complexity of Synthesis of nop-Free Boolean Petri Nets.
- On the Complexity of Universality for Partially Ordered NFAs
- On the Expressive Power of Description Logics with Cardinality Constraints on Finite and Infinite Sets
- Ontological Modelling in Wikidata
- Ontologies for Knowledge Graphs: Breaking the Rules
- Ontology Evolution trough Interaction
- Ontology-Based Query Answering for Probabilistic Temporal Data
- Ontology-Driven Software Development in the Context of the Semantic Web (Project Thesis)
P
- Past, Current and Future Trends in Description Logic
- Pattern-based ontology modeling and some of its implications for Description Logics research
- Positivity-Hardness and Saturation Points in Markov Decision Processes
- Preserving Constraints with the Stable Chase
- Privacy-Preserving Ontology Publishing for EL Instance Stores
- Projection in a Description Logic of Context with Actions
- Provenance and Probabilities in Relational Databases
Q
- Quantitative Versions of the Chomsky-Schützenberger Theorem
- Quantum Computing and the Limits of the Efficiently Computable
- Query Rewriting for DL-Lite with n-ary Concrete Domains
- Query Stability in Data-aware Business Processes
- Querying Probabilistic Ontologies
- Question Answering over Real-World Knowledge Graphs
- Question Answering Systems
- Quine's Fluted Fragment
R
- Reasonable Highly Expressive Query Languages
- Reasoning about disclosure in data integration in the presence of source constraints
- Relbacoess
- Report on research visit to NRC
- Restricted Chase (Non)Termination for Existential Rules with Disjunctions
- Restricted Chase Acyclicity: A Novel Acyclicity Notion for Description Logics
- Revisiting Circumscription
S
- Satisfiability in the Triguarded Fragment of First-Order Logic
- Satisfiability of temporal logics with concrete domain
- SCF2 - an Argumentation Semantics for Rational Human Judgments on Argument Acceptability
- SEABirds: An AHP Approach to Solve the Angry Birds AI Challenge
- Searching for Structural Similarities in Large Graphs
- Second Workshop on Human Reasoning and Computational Logic
- Selected Advances in Data Semantics
- Semantic Search for Novel Information
- Seminar 08.04.2021
- Seminar 08.07.2021
- Seminar 15.04.2021
- Seminar 15.07.2021
- Seminar 16.09.2021
- Seminar 17.06.2021
- Seminar 18.03.2021
- Seminar 20.05.2021
- Seminar 22.07.2021
- Seminar 24.06.2021
- Seminar 29.04.2021
- Seminar 29.07.2021
- Seminar talk, title: "Practical Linked Data Access via SPARQL: The Case of Wikidata"
- Similarity search in metric spaces: New indexing techniques for similarity search in metric spaces
- Smoke Test Planning using Answer Set Programming
- Software Implementation for Taxonomy Browsing and Ontology Evaluation for the case of Wikidata
- Solving Angry Birds with Reinforcement Learning
- Solving Datalog(S) Problems with Lazy-Grounding ASP Solving
- Solving Problems Exponentially Faster: Implementing a Nondeterministic Universal Turing Machine Using DNA
- SOQE 2017
- SQID: Reasonable Wikidata
- Standpoint logic: a multi-modal logic for reasoning within semantic indeterminacy
