header
10-14 June 2012
Rome, Italy
13th International Conference on
Principles of Knowledge Representation and Reasoning
CFP out
abstract
submission
paper
submission
author response
Jan 11-13
notification
early registration
opens
camera
ready
late registration
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

Stefano Moretti and Alexis Tsoukiàs. Ranking sets of possibly interacting objects using Shapley extensions
Jinbo Huang. Compactness and Its Implications for Qualitative Spatial and Temporal Reasoning
Wolfgang Dvorak, Matti Järvisalo, Johannes Peter Wallner and Stefan Woltran. Complexity-Sensitive Decision Procedures for Abstract Argumentation
Wolfgang Faber, Mirek Truszczynski and Stefan Woltran. Strong Equivalence of Qualitative Optimization Problems
Nicola Leone, Marco Manna, Giorgio Terracina and Pierfrancesco Veltri. Efficiently Computable Datalog^E Programs
Zhiqiang Zhuang and Maurice Pagnucco. Model Based Horn Contraction
Bernardo Cuenca Grau, Ernesto Jimenez-Ruiz, Evgeny Kharlamov and Dmitriy Zheleznyakov. Ontology Evolution under Semantic Constraints
Patrick Doherty, Jonas Kvarnström and Andrzej Szalas. Temporal Composite Actions with Constraints
Bernardo Cuenca Grau, Ian Horrocks, Markus Krötzsch, Clemens Kupke, Despoina Magka, Boris Motik and Zhe Wang. Acyclicity Conditions and their Application to Query Answering in Description Logics
Didier Dubois, Henri Prade and Steven Schockaert. Stable models in generalized possibilistic logic
Joseph Halpern and Willemien Kets. Ambiguous Language and Differences in Beliefs
Sebastian Haufe and Michael Thielscher. Automated Verification of Epistemic Properties for General Game Playing
Francesco Belardinelli, Alessio Lomuscio and Fabio Patrizi. An Abstraction Technique for the Verification of Artifact-Centric Systems
Stefan Borgwardt and Rafael Peñaloza. Undecidability of Fuzzy Description Logics
Nadia Creignou, Odile Papini, Reinhard Pichler and Stefan Woltran. Belief revision within fragments of propositional logic
Carsten Lutz and Frank Wolter. Non-Uniform Data Complexity of Query Answering in Description Logics
Carsten Lutz, Inanc Seylan and Frank Wolter. An Automata-Theoretic Approach to Uniform Interpolation and Approximation in the Description Logic EL
Christer Bäckström and Peter Jonsson. Abstracting Abstraction in Search with Applications to Planning
Nic Wilson and Radu Marinescu. An Axiomatic Framework for Influence Diagram Computation with Partially Ordered Utilities
Martin Lackner and Andreas Pfandler. Fixed-Parameter Algorithms for Finding Minimal Models
Georg Gottlob and Thomas Schwentick. Rewriting Ontological Queries into Small Nonrecursive  Datalog Programs
Lucas Bordeaux, Mikolas Janota, Joao Marques-Silva and Pierre Marquis. On Unit-Refutation Complete Formulae with Existentially Quantified Variables
Zeinab Bahmani, Leopoldo Bertossi, Solmaz Kolahi and Laks Lakshmanan. Declarative Entity Resolution via Matching Dependencies and Answer Set Programs
Yevgeny Kazakov, Markus Krötzsch and Frantisek Simancik. Practical Reasoning with Nominals in the EL Family of Description Logics
Vladimir Lifschitz. Logic Programs with Intensional Functions
Vincent Conitzer and Lirong Xia. Paradoxes of Multiple Elections: An Approximation Approach
Grastien Alban, Patrik Haslum and Sylvie Thiebaux. Conflict-Based Diagnosis of Discrete Event Systems: Theory and Practice
Jonathan Lawry and Didier Dubois. A Bipolar Framework for Combining Beliefs about Vague Propositions
Kira Adaricheva, Robert Sloan, Gyorgy Turan and Balazs Szorenyi. Horn Belief Contraction: Remainders, Envelopes and Complexity
Davide Grossi. Fixpoints and Iterated Updates in Abstract Argumentation
Michaë l Thomazo, Jean-François Baget, Marie-Laure Mugnier and Sebastian Rudolph. A generic querying algorithm for greedy sets of existential rules
Meghyn Bienvenu, Carsten Lutz and Frank Wolter. Query Containment in Description Logics Reconsidered
Silvano Colombo Tosatto, Guido Boella, Leon Van Der Torre and Serena Villata. Abstract Normative Systems: Semantics and Proof Theory
Giuseppe De Giacomo, Paolo Felli and Alessio Lomuscio. Synthesizing agent protocols for LTL specifications against multiple partially-observable environments
Mariano Rodriguez-Muro and Diego Calvanese. High Performance Query Answering over DL-Lite Ontologies
Michael Fink. Paraconsistent Hybrid Theories
Giuseppe De Giacomo, Yves Lespérance and Fabio Patrizi. Bounded Situation Calculus Action Theories and Decidable Verification
Stanislav Kikot, Roman Kontchakov and Michael Zakharyaschev. Conjunctive Query Answering with OWL 2 QL
Johannes Oetsch, Michael Prischink, Jörg Pührer, Martin Schwengerer and Hans Tompits. On the Small-Scope Hypothesis for Testing Answer-Set Programs
Gerhard Lakemeyer and Hector J. Levesque. Only-Knowing Meets Nonmonotonic Modal Logic
Henri Prade and Gilles Richard. Homogeneous logical proportions: Their unicity and their role in similarity-based prediction
Guohua Liu, Tomi Janhunen and Ilkka Niemela. Answer Set Programming via Mixed Integer Programming
Richard Booth, Eduardo Ferme, Sébastien Konieczny and Ramon Pino Perez. Credibility limited revision operators in propositional logic
James Delgrande and Hector Levesque. Belief revision with sensing and fallible actions
Onofrio Febbraro, Giovanni Grasso, Nicola Leone and Francesco Ricca. JASP: a framework for integrating  Answer Set Programming with Java
Michael Bartholomew and Joohyung Lee. Stable Models of Formulas with Intensional Functions
Riccardo Rosati and Enrico Franconi. Generalized ontology-based production systems
Chitta Baral and Shanshan Liang. From Knowledge Represented in Frame-based Languages to Declarative Representation & Reasoning via Answer Set Programming
Tran Cao Son and Vinay Chaudhri. Specifying and Reasoning with Underspecified Knowledge Bases Using Answer Set Programming
Martin Slota and Joao Leite. Robust Equivalence Models for Semantic Updates of Answer-Set Programs
Jochen Renz. Implicit Constraints for Qualitative Spatial and Temporal Reasoning
Hector Levesque, Ernest Davis and Leora Morgenstern. The Winograd Schema Challenge
Hanne Vlaeminck, Joost Vennekens, Maurice Bruynooghe and Marc Denecker. Ordered Epistemic Logic


KR2012 Accepted Short Papers

Jinbo Huang. Search Strategy Simulation in Constraint Booleanization
Yisong Wang, Yan Zhang, Yi Zhou and Mingyi Zhang. Forgetting in Logic Programs under Strong Equivalence
Diego Calvanese, Magdalena Ortiz, Mantas Simkus and Giorgio Stefanoni. The Complexity of Explaining Negative Query Answers in DL-Lite
Matthew Horridge, Bijan Parsia and Ulrike Sattler. Justification Masking in Ontologies
Franz Baader, Stefan Borgwardt and Barbara Morawska. Extending Unification in EL towards General TBoxes
Maximiliano Celmo David Budán, Mauro Gómez Lucero, Carlos Iván Chesñevar and Guillermo Ricardo Simari. Modelling Time and Reliability in Structured Argumentation Frameworks
Ilias Tachmazidis, Grigoris Antoniou, Giorgos Flouris and Spyros Kotoulas. Towards Parallel Nonmonotonic Reasoning with Billions of Facts
Cristina Feier. Worst-case Optimal Reasoning with Forest Logic Programs
Marcelo Arenas, Elena Botoeva, Diego Calvanese, Vladislav Ryzhikov and Evgeny Sherkhonov. Exchanging Description Logic Knowledge Bases
Robert Craven, Francesca Toni, Adrian Hadad and Matthew Williams. Efficient Support for Medical Argumentation
Laura Giordano, Alberto Martelli and Daniele Theseider Dupre'. Achieving completeness in bounded model checking of action theories in ASP
Jiewen Wu, Alexander Hudek, David Toman and Grant Weddell. Assertion Absorption in Object Queries over Knowledge Bases
Jianbing Ma, Salem Benferhat and Weiru Liu. Revising  partial pre-orders with partial pre-orders: A unit-based  revision framework
Patricia Everaere, Sébastien Konieczny and Pierre Marquis. Compositional Belief Merging
Chitta Baral and Juraj Dzifcak. Solving Puzzles Described in English by Automated Translation to Answer Set Programming and Learning how to do that Translation
Anthony G. Cohn, Jochen Renz and Muralikrishna Sridhar. Thinking inside the box: A comprehensive spatial representation for video analysis
Sylvie Coste-Marquis, Sébastien Konieczny, Pierre Marquis and Mohand Akli Ouali. Weighted Attacks in Argumentation Frameworks
Martin Gebser, Torsten Grote, Roland Kaminski, Philipp Obermeier, Orkunt Sabuncu and Torsten Schaub. Stream Reasoning with Answer Set Programming