10-14 June 2012
Rome, Italy
Rome, Italy
13th International Conference on
Principles of Knowledge Representation and Reasoning
Principles of Knowledge Representation and Reasoning
CFP out
abstract
submission
submission
paper
submission
submission
author response
Jan 11-13
Jan 11-13
notification
early registration
opens
opens
camera
ready
ready
late registration
opens
opens
conference
Nov 30
Dec 9
Feb 3
Feb 10
Mar 4
Apr 15
Jun 10-14
We received 202 paper submissions to the conference of which 53 (26%)
were accepted to the main technical program. Following the highly
successful introduction of short papers to the KR conference in 2010,
we accepted an additional 18 high-quality papers, which will appear
as shortened papers in the conference proceedings and will be
presented at the conference in poster form.
KR2012 Accepted Papers
Ranking sets of possibly interacting objects using Shapley extensions
Compactness and Its Implications for Qualitative Spatial and Temporal Reasoning
Complexity-Sensitive Decision Procedures for Abstract Argumentation
Strong Equivalence of Qualitative Optimization Problems
Efficiently Computable Datalog^E Programs
Model Based Horn Contraction
Ontology Evolution under Semantic Constraints
Temporal Composite Actions with Constraints
Acyclicity Conditions and their Application to Query Answering in Description Logics
Stable models in generalized possibilistic logic
Ambiguous Language and Differences in Beliefs
Automated Verification of Epistemic Properties for General Game Playing
An Abstraction Technique for the Verification of Artifact-Centric Systems
Undecidability of Fuzzy Description Logics
Belief revision within fragments of propositional logic
Non-Uniform Data Complexity of Query Answering in Description Logics
An Automata-Theoretic Approach to Uniform Interpolation and Approximation in the Description Logic EL
Abstracting Abstraction in Search with Applications to Planning
An Axiomatic Framework for Influence Diagram Computation with Partially Ordered Utilities
Fixed-Parameter Algorithms for Finding Minimal Models
Rewriting Ontological Queries into Small Nonrecursive Datalog Programs
On Unit-Refutation Complete Formulae with Existentially Quantified Variables
Declarative Entity Resolution via Matching Dependencies and Answer Set Programs
Practical Reasoning with Nominals in the EL Family of Description Logics
Logic Programs with Intensional Functions
Paradoxes of Multiple Elections: An Approximation Approach
Conflict-Based Diagnosis of Discrete Event Systems: Theory and Practice
A Bipolar Framework for Combining Beliefs about Vague Propositions
Horn Belief Contraction: Remainders, Envelopes and Complexity
Fixpoints and Iterated Updates in Abstract Argumentation
A generic querying algorithm for greedy sets of existential rules
Query Containment in Description Logics Reconsidered
Abstract Normative Systems: Semantics and Proof Theory
Synthesizing agent protocols for LTL specifications against multiple partially-observable environments
High Performance Query Answering over DL-Lite Ontologies
Paraconsistent Hybrid Theories
Bounded Situation Calculus Action Theories and Decidable Verification
Conjunctive Query Answering with OWL 2 QL
On the Small-Scope Hypothesis for Testing Answer-Set Programs
Only-Knowing Meets Nonmonotonic Modal Logic
Homogeneous logical proportions: Their unicity and their role in similarity-based prediction
Answer Set Programming via Mixed Integer Programming
Credibility limited revision operators in propositional logic
Belief revision with sensing and fallible actions
JASP: a framework for integrating Answer Set Programming with Java
Stable Models of Formulas with Intensional Functions
Generalized ontology-based production systems
From Knowledge Represented in Frame-based Languages to Declarative Representation & Reasoning via Answer Set Programming
Specifying and Reasoning with Underspecified Knowledge Bases Using Answer Set Programming
Robust Equivalence Models for Semantic Updates of Answer-Set Programs
Implicit Constraints for Qualitative Spatial and Temporal Reasoning
The Winograd Schema Challenge
Ordered Epistemic Logic
KR2012 Accepted Short Papers
Search Strategy Simulation in
Constraint Booleanization
Forgetting in Logic Programs under Strong Equivalence
The Complexity of Explaining Negative Query Answers in DL-Lite
Justification Masking in Ontologies
Extending Unification in EL towards General TBoxes
Modelling Time and Reliability in Structured Argumentation Frameworks
Towards Parallel Nonmonotonic Reasoning with Billions of Facts
Worst-case Optimal Reasoning with Forest Logic Programs
Exchanging Description Logic Knowledge Bases
Efficient Support for Medical Argumentation
Achieving completeness in bounded model checking of action theories in ASP
Assertion Absorption in Object Queries over Knowledge Bases
Revising partial pre-orders with partial pre-orders: A unit-based revision framework
Compositional Belief Merging
Solving Puzzles Described in English by Automated Translation to Answer Set Programming and Learning how to do that Translation
Thinking inside the box: A comprehensive spatial representation for video analysis
Weighted Attacks in Argumentation Frameworks
Stream Reasoning with Answer Set Programming