http://www.scs.ryerson.ca/~kr2010/accepted_papers.html

Please make your plans to register and attend KR-2010. Registration is organized by AAAI. Please follow the instructions provided on that Web page.

The authors of accepted papers who need a formal invitation letter to participate may request a copy of a letter from AAAI. AAAI will normally provide these letters as part of KR-2010 registration service. However, AAAI will only issue invitation letters for accepted authors and registered attendees.

The list of accepted (regular and short) papers

•Robert Kelvey, Sara Miner More, Pavel Naumov and Benjamin Sapp. (4) Independence and Functional Dependence Relations on Secrets

•Gerhard Brewka and Stefan Woltran. (5) Abstract Deliberation Frameworks

•Minyi Li, Quoc Bao Vo and Ryszard Kowalczyk. (7) An Efficient Approach for Preference Aggregation with CP-nets

•Ringo Baumann, Gerhard Brewka, Hannes Strass, Michael Thielscher and Vadim Zaslawski. (8) State Defaults and Ramifications in the Unifying Action Calculus

•Ofer Arieli. (9) On the Application of the Disjunctive Syllogism in Paraconsistent Logics Based on Four States of Belief

•David Poole. (11) Towards a Logic of Feature-based Semantic Science Theories

•Nadia Creignou, Johannes Schmidt and Michael Thomas. (24) Complexity of Propositional Abduction for Restricted Sets of Boolean Functions

•Guohui Xiao, Yue Ma, Guilin Qi and Zuoquan Lin. (25) Computing Inconsistency Measurements under Multi-Valued Semantics by Partial Max-SAT solvers

•Thomas Eiter, Michael Fink, Peter Schüller and Antonius Weinzierl. (39) Finding Explanations of Inconsistency in Multi-Context Systems

•Ofer Arieli, Arnon Avron and Anna Zamansky. (41) Maximally Paraconsistent Three-Valued Logics

•Giuseppe De Giacomo, Yves Lesperance and Adrian Pearce. (46) Situation calculus-based programs for representing and reasoning about game structures

•Reinhard Pichler, Stefan Rümmele, Stefan Szeider and Stefan Woltran. (47) Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth is not Enough

•Stuart Shapiro. (48) Set-Oriented Logical Connectives

•Sajjad Siddiqi and Jinbo Huang. (49) New Advances in Sequential Diagnosis

•Franz Baader, Meghyn Bienvenu, Carsten Lutz and Frank Wolter. (77) Query and Predicate Emptiness in Description Logics

•Minh Dao-Tran, Thomas Eiter, Michael Fink and Thomas Krennwallner. (78) Distributed Nonmonotonic Multi-Context Systems

•Thomas Eiter, Michael Fink and Joao Moura. (80) Paracoherent Answer Set Programming

•Carsten Lutz and Lutz Schröder. (82) Probabilistic Description Logics for Subjective Uncertainty

•Martin Gebser, Carito Guziolowski, Mihail Ivanchev, Torsten Schaub, Anne Siegel, Philippe Veber and Sven Thiele. (84) Repair and Prediction (under Inconsistency) in Large Biological Networks with Answer Set Programming

•Michael Bartholomew and Joohyung Lee. (88) A Decidable Class of Groundable Formulas in the General Theory of Stable Models

•Claudio Masolo. (91) A theory of levels based on complete foundation

•Joseph Halpern. (92) From Causal Models To Counterfactual Structures

•Daniele Porello and Ulle Endriss. (93) Modelling Combinatorial Auctions in Linear Logic

•Francesco Belardinelli and Alessio Lomuscio. (94) The Interaction of Time and Knowledge in a First-order Logic for Multi-Agent Systems

•James Delgrande and Renata Wassermann. (96) Horn Clause Contraction Functions: Belief Set and Belief Base Approaches

•Jean-François Condotta and Christophe Lecoutre. (97) A Class of df-consistencies for Qualitative Constraint Networks

•Vaishak Belle and Gerhard Lakemeyer. (99)) Multi-Agent Only-Knowing Revisited

•Yan Zhang and Yi Zhou. (103) On the Progression Semantics and Boundedness of Answer Set Programs

•Wolfgang Dvorak, Reinhard Pichler and Stefan Woltran. (106) Towards Fixed-Parameter Tractable Algorithms for Argumentation

•Yi Zhou and Yan Zhang. (108) Forgetting Revisited

•Sanjiang Li. (109) A Layered Graph Representation for Complex Regions

•Grigoris Antoniou, Constantinos Papatheodorou and Antonis Bikakis. (112) Reasoning about Context in Ambient Intelligence Environments: A Report from the Field

•Yuxiao Hu and Hector Levesque. (113) A Completeness Result for Reasoning about One-Dimensional Planning Problems

•Samantha Kleinberg and Bud Mishra. (116) The Temporal Logic of Token Causes

•Hannaneh Hajishirzi and Eyal Amir. (118) Reasonig about Deterministic Actions with Probabilistic Prior and Application to Stochastic Filtering

•Hans van Ditmarsch, Jan van Eijck and William Wu. (136) One hundred prisoners and a lightbulb - logic and computation

•Rafael Peñaloza and Barış Sertkaya. (138) On the Complexity of Axiom Pinpointing

•Roman Kontchakov, Carsten Lutz, David Toman, Frank Wolter and Michael Zakharyaschev. (143) The Combined Approach to Query Answering in DL-Lite

•Gabriele Kern-Isberner and Matthias Thimm. (145) Novel Semantical Approaches to Relational Probabilistic Conditionals

•Guilin Qi and Zhizheng Zhang. (148) Preferential Semantics for Plausible Subsumption in Possibility Theory

•Boris Konev, Carsten Lutz, Denis Ponomaryov and Frank Wolter. (154) Decomposing Description Logic Ontologies

•Antonino Rotolo, Guido Governatori, Guido Boella and Leendert van der Torre. (155) Lex minus dixit quam voluit, lex magis dixit quam voluit: A formal study on legal interpretation

•Giuseppe De Giacomo, Fabio Patrizi and Sebastian Sardina. (159) Generalized planning with loops under strong fairness constraints

•Visara Urovi, Stefano Bromuri, Kostas Stathis and Alexander Artikis. (166) Run-Time Services for Norm-Governed Systems

•Birte Glimm and Sebastian Rudolph. (169) Status QIO: Conjunctive Query Entailment is Decidable

•Emilia Oikarinen and Stefan Woltran. (170) Characterizing Strong Equivalence for Argumentation Frameworks

•Agata Ciabattoni and Pavel Rusnok. (173) On the classical content of Goedel logic with strong negation and its applications to a fuzzy medical expert system

•Henri Prade and Gilles Richard. (177) Reasoning with logical proportions

•Michael Thielscher. (178) Integrating Action Calculi and AgentSpeak: Closing the Gap

•Marcello Balduccini and Sara Girotto. (181) Formalizing Psychological Knowledge in Answer Set Programming

•RAMZI BEN LARBI, Sébastien Konieczny and Pierre Marquis. (182) A Characterization of Optimality Criteria for Decision Making under Complete Ignorance

•Sébastien Konieczny, Mattia Medina Grespan and Ramon Pino Perez. (184) Taxonomy of Improvement Operators and the Problem of Minimal Change

•Meghyn Bienvenu, Jérôme Lang and Nic Wilson. (188) From preference logics to preference languages, and back

•Ronen Brafman, Francesca Rossi, Domenico Salvagnin, Kristen Brent Venable and Toby Walsh. (193) Finding the next solution in constraint- and preference-based knowledge representation formalisms

•Jean-François BAGET, Michel LECLERE and Marie-Laure MUGNIER. (197) Walking the decidability line for rules with existential variables

•Michael Gruninger. (199) Ontologies for Dates and Duration

•Bernardo Cuenca Grau and Boris Motik. (200) Pushing the Limits of Reasoning over Ontologies with Hidden Content

•Magdalena Ortiz, Sebastian Rudolph and Mantas Simkus. (204) Worst-case Optimal Reasoning for the Horn-DL Fragments of OWL 1 and 2

•Roman Kontchakov, Ian Pratt-Hartmann and Michael Zakharyaschev. (209) Interpreting Topological Logics over Euclidean Spaces

•Cerami Marco, Francesc Esteva and Felix Bou. (213) Decidability of a Description Logic over infinite-valued Product Logic

•guillaume aucher. (217) characterizing updates in dynamic epistemic logic

•Matthew Horridge and Bijan Parsia. (221) From Justifications Towards Proofs For Ontology Engineering

•Bijan Parsia and Thomas Schneider. (223) The modular structure of an ontology: an empirical study

•Ganesh Ram Santhanam, Samik Basu and Vasant Honavar. (229) Efficient Dominance Testing for Unconditional Preferences

•Thomas Icard, Eric Pacuit and Yoav Shoham. (237) Joint revision of belief and intention

•Shirin Sohrabi, Jorge A. Baier and Sheila A. McIlraith. (251) Diagnosis as Planning Revisited

•Riccardo Rosati and Alessandro Almatelli. (254) Improving query answering over DL-Lite ontologies

•Zhe Wang, Kewen Wang and Rodney Topor. (255) Revising General Knowledge Bases in Description Logics

•Joseph Halpern and Rafael Pass. (258) I Don't Want to Think About it Now: Decision Theory With Costly Computation