Regular Papers

• 
  Régis Alenda, Nicola Olivetti: Preferential Semantics for the Logic of Comparative Similarity over Triangular and Metric Models. 1-13
• 
  Régis Alenda, Nicola Olivetti, Gian Luca Pozzato: Nested Sequent Calculi for Conditional Logics. 14-27
• 
  Ofer Arieli: Conflict-Tolerant Semantics for Argumentation Frameworks. 28-40
• 
  Dimitris Askounis, Costas D. Koutras, Yorgos Zikos: Knowledge Means 'All', Belief Means 'Most'. 41-53
• 
  Guillaume Aucher, Bastien Maubert, François Schwarzentruber: Generalized DEL-Sequents. 54-66
• 
  Philippe Balbiani, Antoun Yaacoub: Deciding the Bisimilarity Relation between Datalog Goals. 67-79
• 
  Harald Beck, Thomas Eiter, Thomas Krennwallner: Inconsistency Management for Traffic Regulations: Formalization and Complexity Results. 80-93
• 
  Mikkel Birkegaard Andersen, Thomas Bolander, Martin Holm Jensen: Conditional Epistemic Planning. 94-106
• 
  Richard Booth, Thomas Meyer, Ivan José Varzinczak: PTL: A Propositional Typicality Logic. 107-119
• 
  Laura Bozzelli, Hans P. van Ditmarsch, Sophie Pinchinat: The Complexity of One-Agent Refinement Modal Logic. 120-133
• 
  Luciano Caroprese, Irina Trubitsyna, Miroslaw Truszczynski, Ester Zumpano: The View-Update Problem for Indefinite Databases. 134-146
• 
  Davide Ciucci, Didier Dubois: Three-Valued Logics for Incomplete Information and Epistemic Logic. 147-159
• 
  Thomas Eiter, Michael Fink, Thomas Krennwallner, Christoph Redl, Peter Schüller: Exploiting Unfounded Sets for HEX-Program Evaluation. 160-175
• 
  Masood Feyzbakhsh Rankooh, Ali Mahjoob, Gholamreza Ghassem-Sani: Using Satisfiability for Non-optimal Temporal Planning. 176-188
• 
  Marc Finthammer, Christoph Beierle: How to Exploit Parametric Uniformity for Maximum Entropy Reasoning in a Relational Probabilistic Logic. 189-201
• 
  Enrico Franconi, Volha Kerhet, Nhung Ngo: Exact Query Reformulation with First-Order Ontologies and Databases. 202-214
• 
  Alfredo Gabaldon: A Selective Semantics for Logic Programs with Preferences. 215-227
• 
  Laura Giordano, Valentina Gliozzi, Nicola Olivetti, Gian Luca Pozzato: A Minimal Model Semantics for Nonmonotonic Reasoning. 228-241
• 
  Lluis Godo, Enrico Marchioni, Pere Pardo: Extending a Temporal Defeasible Argumentation Framework with Possibilistic Weights. 242-254
• 
  Joanna Golinska-Pilarek: On Decidability of a Logic for Order of Magnitude Qualitative Reasoning with Bidirectional Negligibility. 255-266
• 
  Sarah Holbrook, Pavel Naumov: Fault Tolerance in Belief Formation Networks. 267-280
• 
  Naoya Inoue, Kentaro Inui: Large-Scale Cost-Based Abduction in Full-Fledged First-Order Predicate Logic with Cutting Plane Inference. 281-293
• 
  Patrick Krümpelmann, Gabriele Kern-Isberner: Belief Base Change Operations for Answer Set Programming. 294-306
• 
  Karsten Lehmann, Anni-Yasmin Turhan: A Framework for Semantic-Based Similarity Measures for $\mathcal{ELH}$ -Concepts. 307-319
• 
  Björn Lellmann, Dirk Pattinson: Sequent Systems for Lewis' Conditional Logics. 320-332
• 
  Laurent Perrussel, Jerusa Marchi, Jean-Marc Thévenin, Dongmo Zhang: Relevant Minimal Change in Belief Update. 333-345
• 
  Abdallah Saffidine: Minimal Proof Search for Modal Logic K Model Checking. 346-358
• 
  François Schwarzentruber, Srdjan Vesic, Tjitze Rienstra: Building an Epistemic Logic for Argumentation. 359-371
• 
  Martin Slota, João Leite: A Unifying Perspective on Knowledge Updates. 372-384
• 
  Richard Stocker, Louise A. Dennis, Clare Dixon, Michael Fisher: Verifying Brahms Human-Robot Teamwork Models. 385-397
• 
  Nicolas Troquard, Dirk Walther: On Satisfiability in ATL with Strategy Contexts. 398-410
• 
  Bart Verheij: Jumping to Conclusions - A Logico-Probabilistic Foundation for Defeasible Rule-Based Arguments. 411-423
• 
  Srdjan Vesic, Leendert van der Torre: Beyond Maxi-Consistent Argumentation Operators. 424-436
• 
  Nitin Yadav, Sebastian Sardiña: Reasoning about Agent Programs Using ATL-Like Logics. 437-449
• 
  Nitin Yadav, Sebastian Sardiña: Qualitative Approximate Behavior Composition. 450-462
• 
  Anna Zamansky: A Preferential Framework for Trivialization-Resistant Reasoning with Inconsistent Information. 463-475

System Descriptions

• 
  Julien Balax, Florence Dupin de Saint-Cyr, David Villard: DebateWEL: An Interface for Debating with Enthymemes and Logical Formulas. 476-479
• 
  Minh Dao-Tran, Thomas Eiter, Michael Fink, Gerald Weidinger, Antonius Weinzierl: OMiGA : An Open Minded Grounding On-The-Fly Answer Set Solver. 480-483
• 
  Marco Maratea, Luca Pulina, Francesco Ricca: The Multi-Engine ASP Solver me-asp. 484-487
• 
  Matthias Nickles: A System for the Use of Answer Set Programming in Reinforcement Learning. 488-491
• 
  Dmitry Tishkovsky, Renate A. Schmidt, Mohammad Khodadadi: The Tableau Prover Generator MetTeL2. 492-495

last updated on Mon May 20 02:24:51 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page