Table of Contents

• Preferences, Planning and ControlRonen I. Brafman. 2-5
• Beyond Nash Equilibrium: Solution Concepts for the 21st CenturyJoseph Y. Halpern. 6-15
• Reasoning about Agent DeliberationNatasha Alechina, Mehdi Dastani, Brian Logan, John-Jules Ch. Meyer. 16-26
• A Logical Framework to Represent and Reason about Graded Preferences and IntentionsAna Casali, Lluis Godo, Carles Sierra. 27-37
• A Logical Account of Institutions: From Acceptances to Norms via LegislatorsEmiliano Lorini, Dominique Longin. 38-48
• Dynamic Logic on Games with Structured StrategiesR. Ramanujam, Sunil Easaw Simon. 49-58
• Promises Kept, Promises Broken: An Axiomatic and Quantitative Treatment of FulfillmentGerardo I. Simari, Matthias Broecheler, V. S. Subrahmanian, Sarit Kraus. 59-69
• Taming the Infinite Chase: Query Answering under Expressive Relational ConstraintsAndrea Calì, Georg Gottlob, Michael Kifer. 70-80
• Accuracy and Efficiency of Fixpoint Methods for Approximate Query Answering in Locally Complete DatabasesAlvaro Cortés-Calabuig, Marc Denecker, Ofer Arieli, Maurice Bruynooghe. 81-91
• Injecting the How into the What: Investigating a Finite Classical LogicTimothy L. Hinrichs, Michael R. Genesereth. 92-192
• Approximate Reasoning in First-Order Logic TheoriesJohan Wittocx, Maarten Mariën, Marc Denecker. 103-112
• Making Decisions through Preference-Based ArgumentationLeila Amgoud, Yannis Dimopoulos, Pavlos Moraitis. 113-123
• Revision of an Argumentation SystemClaudette Cayrol, Florence Dupin de Saint-Cyr, Marie-Christine Lagasquie-Schiex. 124-134
• An Abstract Argumentation Framework with Varied-Strength AttacksDiego C. Martínez, Alejandro Javier García, Guillermo Ricardo Simari. 135-144
• Equilibria in Social Belief RemovalRichard Booth, Thomas Meyer. 145-155
• Horn Clause Belief Change: Contraction FunctionsJames P. Delgrande. 156-165
• Linking Iterated Belief Change Operations to Nonmonotonic ReasoningGabriele Kern-Isberner. 166-176
• Improvement OperatorsSébastien Konieczny, Ramón Pino Pérez. 177-187
• Scenario Update Applied to Causal ReasoningFlorence Dupin de Saint-Cyr. 188-197
• Defaults and Normality in Causal StructuresJoseph Y. Halpern. 198-208
• On Notions of Causality and Distributed KnowledgeRon van der Meyden. 209-219
• Complexity of Abduction in the EL Family of Lightweight Description LogicsMeghyn Bienvenu. 220-230
• Path-Based Identification Constraints in Description LogicsDiego Calvanese, Giuseppe De Giacomo, Domenico Lembo, Maurizio Lenzerini, Riccardo Rosati. 231-241
• View-Based Query Answering over Description Logic OntologiesDiego Calvanese, Giuseppe De Giacomo, Maurizio Lenzerini, Riccardo Rosati. 242-251
• Unions of Conjunctive Queries in SHOQBirte Glimm, Ian Horrocks, Ulrike Sattler. 252-262
• Model-Theoretic Characterization of Asher and Vieu s Ontology of MereotopologyTorsten Hahmann, Michael Gruninger. 263-273
• RIQ and SROIQ Are Harder than SHOIQYevgeny Kazakov. 274-284
• Can You Tell the Difference Between DL-Lite Ontologies?Roman Kontchakov, Frank Wolter, Michael Zakharyaschev. 285-295
• Representing Structured Objects using Description GraphsBoris Motik, Bernardo Cuenca Grau, Ian Horrocks, Ulrike Sattler. 296-306
• How Many Toes Do I Have? Parthood and Number Restrictions in Description LogicsLutz Schröder, Dirk Pattinson. 307-317
• Ontology Generation through the Fusion of Partial Reuse and Relation ExtractionNwe Ni Tun, Jin Song Dong. 318-328
• Peer-to-Peer Query Answering with Inconsistent KnowledgeArnold Binas, Sheila A. McIlraith. 329-339
• How to Choose Weightings to Avoid Collisions in a Restricted Penalty LogicNathalie Chetcuti-Sperandio, Sylvain Lagrue. 340-347
• Conflict-Based Merging OperatorsPatricia Everaere, Sébastien Konieczny, Pierre Marquis. 348-357
• Measuring Inconsistency through Minimal Inconsistent SetsAnthony Hunter, Sébastien Konieczny. 358-366
• Inconsistency Management PoliciesMaria Vanina Martinez, Francesco Parisi, Andrea Pugliese, Gerardo I. Simari, V. S. Subrahmanian. 367-377
• A First Experimental Demonstration of Massive Knowledge InfusionLoizos Michael, Leslie G. Valiant. 378-389
• A Principled Framework for Modular Web Rule Bases and Its SemanticsAnastasia Analyti, Grigoris Antoniou, Carlos Viegas Damásio. 390-400
• Computing Loops with at Most One External Support RuleXiaoping Chen, Jianmin Ji, Fangzhen Lin. 401-410
• Belief Revision of Logic Programs under Answer Set SemanticsJames P. Delgrande, Torsten Schaub, Hans Tompits, Stefan Woltran. 411-421
• Conflict-Driven Disjunctive Answer Set SolvingChristian Drescher, Martin Gebser, Torsten Grote, Benjamin Kaufmann, Arne König, Max Ostrowski, Torsten Schaub. 422-432
• Notions of Strong Equivalence for Logic Programs with Ordered DisjunctionWolfgang Faber, Hans Tompits, Stefan Woltran. 433-443
• On Loop Formulas with VariablesJoohyung Lee, Yunsong Meng. 444-453
• Answer Set Programming with FunctionsFangzhen Lin, Yisong Wang. 454-465
• Default Theory of Defeasible EntailmentAlexander Bochman. 466-475
• Semantic Preferential SubsumptionKatarina Britz, Johannes Heidema, Thomas Meyer. 476-484
• Embedding Approaches to Combining Rules and Ontologies into Autoepistemic LogicJos de Bruijn, Thomas Eiter, Hans Tompits. 485-495
• Computing Default Extensions by Reductions on OREspen H. Lian, Arild Waaler. 496-506
• A Lexicographic Inference for Partially Preordered Belief BasesSafa Yahi, Salem Benferhat, Sylvain Lagrue, Mariette Sérayet, Odile Papini. 507-517
• On the Complexity of Planning Operator SubsumptionPatrick Eyerich, Michael Brenner, Bernhard Nebel. 518-527
• Deductive Planning with Inductive LoopsMartin Magnusson, Patrick Doherty. 528-534
• Planning Graphs and Propositional Clause-LearningJussi Rintanen. 535-543
• On the Relative Expressiveness of ADL and Golog: The Last Piece in the PuzzleGabriele Röger, Malte Helmert, Bernhard Nebel. 544-550
• Relational Preference Rules for ControlRonen I. Brafman. 552-559
• Reasoning with Qualitative Preferences and Cardinalities using Generalized CircumscriptionPatrick Doherty, Andrzej Szalas. 560-570
• Dealing with Incomplete Agents Preferences and an Uncertain Agenda in Group Decision Making via Sequential Majority VotingMaria Silvia Pini, Francesca Rossi, Kristen Brent Venable, Toby Walsh. 571-578
• Preference Modeling by Weighted Goals with Max AggregationJoel Uckelman, Ulle Endriss. 579-588
• A Logic for Non-Terminating Golog ProgramsJens Claßen, Gerhard Lakemeyer. 589-599
• ConGolog, Sin Trans: Compiling ConGolog into Basic Action Theories for Planning and BeyondChristian Fritz, Jorge A. Baier, Sheila A. McIlraith. 600-610
• Complex Epistemic Modalities in the Situation CalculusRyan F. Kelly, Adrian R. Pearce. 611-620
• Proving Goal AchievabilityFangzhen Lin. 621-628
• Cartesian Situations and Knowledge Decomposition in the Situation CalculusRonald P. A. Petrick. 629-639
• Behavior Composition in the Presence of FailureSebastian Sardiña, Fabio Patrizi, Giuseppe De Giacomo. 640-650
• Action Theory Erasure and Minimal ChangeIvan José Varzinczak. 651-661
• First-Order Strong Progression for Local-Effect Basic Action TheoriesStavros Vassos, Gerhard Lakemeyer, Hector J. Levesque. 662-672
• Formalising Temporal Constraints on Part-Whole RelationsAlessandro Artale, Nicola Guarino, C. Maria Keet. 673-683
• LTL over Description Logic AxiomsFranz Baader, Silvio Ghilardi, Carsten Lutz. 684-694
• Time Representation and Temporal Reasoning from the Perspective of Non-Standard AnalysisPhilippe Balbiani. 695-704
• A Complete First-Order Logic of Knowledge and TimeFrancesco Belardinelli, Alessio Lomuscio. 705-714
• Automated Complexity Proofs for Qualitative Spatial and Temporal CalculiJochen Renz, Jason Jingshi Li. 715-723
• Identifying Objects Over Time with Description LogicsDavid Toman, Grant E. Weddell. 724-732