Invited Talks

• 
  Sergei N. Artëmov: Justification Logic. 1-4
• 
  Jérôme Lang: Voting in Combinatorial Domains: What Logic and AI Have to Say. 5-7

Regular Papers

• 
  Felicidad Aguado, Pedro Cabalar, Gilberto Pérez, Concepción Vidal: Strongly Equivalent Temporal Logic Programs. 8-20
• 
  Guillaume Aucher: Consistency Preservation and Crazy Formulas in BMS. 21-33
• 
  David Billington: Propositional Clausal Defeasible Logic. 34-47
• 
  Laura Bozzelli, Ruggero Lanotte: Complexity and Succinctness Issues for Linear-Time Hybrid Logics. 48-61
• 
  Davide Bresolin, Angelo Montanari, Pietro Sala, Guido Sciavicco: Optimal Tableaux for Right Propositional Neighborhood Logic over Linear Orders. 62-75
• 
  Annamaria Bria, Wolfgang Faber, Nicola Leone: Normal Form Nested Programs. 76-88
• 
  Jan Broersen, Rosja Mastop, John-Jules Ch. Meyer, Paolo Turrini: A Logic for Closed-World Interaction. 89-99
• 
  Luciano Caroprese, Miroslaw Truszczynski: Declarative Semantics for Revision Programming and Connections to Active Integrity Constraints. 100-112
• 
  Sylvie Coste-Marquis, Pierre Marquis: Recovering Consistency by Forgetting Inconsistency. 113-125
• 
  Fabio Cuzzolin: On the Credal Structure of Consistent Probabilities. 126-139
• 
  Conrad Drescher, Michael Thielscher: A Fluent Calculus Semantics for ADL with Plan Constraints. 140-152
• 
  Paul E. Dunne, Martin Caminada: Computational Complexity of Semi-stable Semantics in Abstract Argumentation Frameworks. 153-165
• 
  Thomas Eiter, Georg Gottlob, Magdalena Ortiz, Mantas Simkus: Query Answering in the Description Logic Horn-. 166-179
• 
  Satu Eloranta, Raul Hakli, Olli Niinivaara, Matti Nykänen: Accommodative Belief Revision. 180-191
• 
  Laura Giordano, Valentina Gliozzi, Nicola Olivetti, Gian Luca Pozzato: Reasoning about Typicality in Preferential Description Logics. 192-205
• 
  Miki Hermann, Reinhard Pichler: Counting Complexity of Minimal Cardinality and Minimal Weight Abduction. 206-218
• 
  Andreas Herzig, Jérôme Mengin: Uniform Interpolation by Resolution in Modal Logic. 219-231
• 
  Koen iV. indriks, Wiebe van der Hoek: GOAL Agents Instantiate Intention Logic. 232-244
• 
  Norihiro Kamide: Linear Exponentials as Resource Operators: A Decidable First-order Linear Logic with Bounded Exponentials. 245-257
• 
  Ekaterina Komendantskaya, John Power: Fibrational Semantics for Many-Valued Logic Programs: Grounds for Non-Groundness. 258-271
• 
  Sébastien Konieczny, Ramón Pino Pérez: Confluence Operators. 272-284
• 
  Paul-Amaury Matt, Francesca Toni: A Game-Theoretic Measure of Argument Strength for Abstract Argumentation. 285-297
• 
  John Christopher McCabe-Dansted: A Tableau for RoBCTL. 298-310
• 
  Novak Novakovic: A Proof-Theoretic Approach to Deciding Subsumption and Computing Least Common Subsumer in w.r.t. Hybrid TBoxes. 311-323
• 
  Magdalena Ortiz: Extending Carinto the Description Logics of the Family. 324-337
• 
  Aleksandar Perovic, Zoran Ognjanovic, Miodrag Raskovic, Zoran Markovic: How to Restore Compactness into Probabilistic Logics?. 338-348
• 
  Henry Prakken: Combining Modes of Reasoning: An Application of Abstract Argumentation. 349-361
• 
  Sebastian Rudolph, Markus Krötzsch, Pascal Hitzler: Cheap Boolean Role Constructors for Description Logics. 362-374
• 
  Renate A. Schmidt: Improved Second-Order Quantifier Elimination in Modal Logic. 375-388
• 
  Christoph Wernhard: Literal Projection for First-Order Logic. 389-402
• 
  Yi Zhou, Yan Zhang: Meta Level Reasoning and Default Reasoning. 403-415
• 
  Yi Zhou, Yan Zhang: Rule Calculus: Semantics, Axioms and Applications. 416-428

last updated on Sat May 18 05:20:30 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page