Table of Contents

• Query Answering over Description Logic OntologiesDiego Calvanese. 1-17 [doi]
• Tools for the Investigation of Substructural and Paraconsistent LogicsAgata Ciabattoni, Lara Spendier. 18-32 [doi]
• Non-classical Planning with a Classical Planner: The Power of TransformationsHector Geffner. 33-47 [doi]
• Opportunities for Argument-Centric Persuasion in Behaviour ChangeAnthony Hunter. 48-61 [doi]
• The Fuzzy Description Logic $\mathsf{G}\text{-}{\mathcal{F\!L}_0} $ with Greatest Fixed-Point SemanticsStefan Borgwardt, José A. Leyva Galano, Rafael Peñaloza. 62-76 [doi]
• Tight Complexity Bounds for Reasoning in the Description Logic $\mathcal{BE{\kern-.1em}L}$Ismail Ilkan Ceylan, Rafael Peñaloza. 77-91 [doi]
• Relevant Closure: A New Form of Defeasible Reasoning for Description LogicsGiovanni Casini, Thomas Meyer, Kodylan Moodley, Riku Nortje. 92-106 [doi]
• Error-Tolerant Reasoning in the Description Logic $\mathcal{E{\kern-.1em}L}$Michel Ludwig, Rafael Peñaloza. 107-121 [doi]
• Sub-propositional Fragments of the Interval Temporal Logic of Allen's RelationsDavide Bresolin, Emilio Munoz-Velasco, Guido Sciavicco. 122-136 [doi]
• SAT Modulo Graphs: AcyclicityMartin Gebser, Tomi Janhunen, Jussi Rintanen. 137-151 [doi]
• Enumerating Prime Implicants of Propositional Formulae in Conjunctive Normal FormSaïd Jabbour, Joao Marques-Silva, Lakhdar Sais, Yakoub Salhi. 152-165 [doi]
• Improving the Normalization of Weight Rules in Answer Set ProgramsJori Bomanson, Martin Gebser, Tomi Janhunen. 166-180 [doi]
• Logical Foundations of Possibilistic KeysHenning Köhler, Uwe Leck, Sebastian Link, Henri Prade. 181-195 [doi]
• Possibilistic Boolean Games: Strategic Reasoning under Incomplete InformationSofie De Clercq, Steven Schockaert, Martine De Cock, Ann Nowé. 196-209 [doi]
• LEG Networks for Ranking FunctionsChristian Eichhorn, Gabriele Kern-Isberner. 210-223 [doi]
• Logics for Approximating Implication Problems of Saturated Conditional IndependenceHenning Köhler, Sebastian Link. 224-238 [doi]
• Finitary S5-TheoriesTran Cao Son, Enrico Pontelli, Chitta Baral, Gregory Gelfond. 239-252 [doi]
• Efficient Program Transformers for Translating LCC to PDLPere Pardo, Enrique Sarrión-Morillo, Fernando Soler-Toscano, Fernando R. Velázquez-Quesada. 253-266 [doi]
• On the Expressiveness of the Interval Logic of Allen's Relations Over Finite and Discrete Linear OrdersLuca Aceto, Dario Della Monica, Anna Ingólfsdóttir, Angelo Montanari, Guido Sciavicco. 267-281 [doi]
• Only-Knowing à la Halpern-Moses for Non-omniscient Rational Agents: A Preliminary ReportDimitris Askounis, Costas D. Koutras, Christos Moyzes, Yorgos Zikos. 282-296 [doi]
• A Complexity Assessment for Queries Involving Sufficient and Necessary CausesPedro Cabalar, Jorge Fandiño, Michael Fink. 297-310 [doi]
• Inductive Learning of Answer Set ProgramsMark Law, Alessandra Russo, Krysia Broda. 311-325 [doi]
• Stable Models of Fuzzy Propositional FormulasJoohyung Lee, Yi Wang. 326-339 [doi]
• A Free Logic for Stable Models with Partial Intensional FunctionsPedro Cabalar, Luis Fariñas del Cerro, David Pearce, Agustín Valverde. 340-354 [doi]
• Constructive Models for Contraction with Intransitive Plausibility IndifferencePavlos Peppas, Mary-Anne Williams. 355-367 [doi]
• Four Floors for the Theory of Theory Change: The Case of Imperfect DiscriminationHans Rott. 368-382 [doi]
• Revisiting Postulates for Inconsistency MeasuresPhilippe Besnard. 383-396 [doi]
• A Translation-Based Approach for Revision of Argumentation FrameworksSylvie Coste-Marquis, Sébastien Konieczny, Jean-Guy Mailly, Pierre Marquis. 397-411 [doi]
• Preserving Strong Equivalence while ForgettingMatthias Knorr, José Júlio Alferes. 412-425 [doi]
• EL OntologiesThomas Eiter, Michael Fink, Daria Stepanova 0001. 426-441 [doi]
• A Prioritized Assertional-Based Revision for DL-Lite Knowledge BasesSalem Benferhat, Zied Bouraoui, Odile Papini, Eric Würbel. 442-456 [doi]
• Modular Paracoherent Answer SetsGiovanni Amendola, Thomas Eiter, Nicola Leone. 457-471 [doi]
• Action Theories over Generalized Databases with Equality ConstraintsFabio Patrizi, Stavros Vassos. 472-485 [doi]
• A Dynamic View of Active Integrity ConstraintsGuillaume Feuillade, Andreas Herzig. 486-499 [doi]
• Similarity Orders from Causal EquationsJohannes Marti, Riccardo Pinosio. 500-513 [doi]
• Verification of Context-Sensitive Knowledge and Action BasesDiego Calvanese, Ismail Ilkan Ceylan, Marco Montali, Ario Santoso. 514-528 [doi]
• System aspmt2smt: Computing ASPMT Theories by SMT SolversMichael Bartholomew, Joohyung Lee. 529-542 [doi]
• A Library of Anti-unification AlgorithmsAlexander Baumgartner, Temur Kutsia. 543-557 [doi]
• The D-FLAT System for Dynamic Programming on Tree DecompositionsMichael Abseher, Bernhard Bliem, Günther Charwat, Frederico Dusberger, Markus Hecher, Stefan Woltran. 558-572 [doi]
• ACUOS: A System for Modular ACU Generalization with Subtyping and InheritanceMaría Alpuente, Santiago Escobar, Javier Espert, José Meseguer. 573-581 [doi]
• Drawing Euler Diagrams from Region Connection Calculus Specifications with Local SearchFrançois Schwarzentruber, Jin-Kao Hao. 582-590 [doi]
• Probabilistic Abstract Dialectical FrameworksSylwia Polberg, Dragan Doder. 591-599 [doi]
• Argumentative Aggregation of Individual OpinionsCosmina Croitoru. 600-608 [doi]
• Measuring Dissimilarity between Judgment SetsMarija Slavkovik, Thomas Ågotnes. 609-617 [doi]
• Exploiting Answer Set Programming for Handling Information Diffusion in a Multi-Social-Network ScenarioGiuseppe Marra, Francesco Ricca, Giorgio Terracina, Domenico Ursino. 618-627 [doi]
• Reasoning about Dynamic Normative SystemsMax Knobbout, Mehdi Dastani, John-Jules Ch. Meyer. 628-636 [doi]
• A Modal Logic of Knowledge, Belief, and EstimationCostas D. Koutras, Christos Moyzes, Yorgos Zikos. 637-646 [doi]
• A Logic for Belief ContractionKonstantinos Georgatos. 647-656 [doi]
• Logic Foundations of the OCL Modelling LanguageEnrico Franconi, Alessandro Mosca, Xavier Oriol, Guillem Rull, Ernest Teniente. 657-664 [doi]
• Constraint-Based Algorithm for Computing Temporal InvariantsJussi Rintanen. 665-673 [doi]
• Answer Set Solver BackdoorsEmilia Oikarinen, Matti Järvisalo. 674-683 [doi]
• Incremental SAT-Based Method with Native Boolean Cardinality Handling for the Hamiltonian Cycle ProblemTakehide Soh, Daniel Le Berre, Stéphanie Roussel, Mutsunori Banbara, Naoyuki Tamura. 684-693 [doi]
• Revisiting Reductants in the Multi-adjoint Logic Programming FrameworkPascual Julián Iranzo, Jesús Medina, Manuel Ojeda-Aciego. 694-702 [doi]