Abstract is missing.
- Justification LogicSergei N. Artëmov. 1-4 [doi]
- Voting in Combinatorial Domains: What Logic and AI Have to SayJérôme Lang. 5-7 [doi]
- Strongly Equivalent Temporal Logic ProgramsFelicidad Aguado, Pedro Cabalar, Gilberto Pérez, Concepción Vidal. 8-20 [doi]
- Consistency Preservation and Crazy Formulas in BMSGuillaume Aucher. 21-33 [doi]
- Propositional Clausal Defeasible LogicDavid Billington. 34-47 [doi]
- Complexity and Succinctness Issues for Linear-Time Hybrid LogicsLaura Bozzelli, Ruggero Lanotte. 48-61 [doi]
- Optimal Tableaux for Right Propositional Neighborhood Logic over Linear OrdersDavide Bresolin, Angelo Montanari, Pietro Sala, Guido Sciavicco. 62-75 [doi]
- Normal Form Nested ProgramsAnnamaria Bria, Wolfgang Faber, Nicola Leone. 76-88 [doi]
- A Logic for Closed-World InteractionJan Broersen, Rosja Mastop, John-Jules Ch. Meyer, Paolo Turrini. 89-99 [doi]
- Declarative Semantics for Revision Programming and Connections to Active Integrity ConstraintsLuciano Caroprese, Miroslaw Truszczynski. 100-112 [doi]
- Recovering Consistency by Forgetting InconsistencySylvie Coste-Marquis, Pierre Marquis. 113-125 [doi]
- On the Credal Structure of Consistent ProbabilitiesFabio Cuzzolin. 126-139 [doi]
- A Fluent Calculus Semantics for ADL with Plan ConstraintsConrad Drescher, Michael Thielscher. 140-152 [doi]
- Computational Complexity of Semi-stable Semantics in Abstract Argumentation FrameworksPaul E. Dunne, Martin Caminada. 153-165 [doi]
- Query Answering in the Description Logic Horn-Thomas Eiter, Georg Gottlob, Magdalena Ortiz, Mantas Simkus. 166-179 [doi]
- Accommodative Belief RevisionSatu Eloranta, Raul Hakli, Olli Niinivaara, Matti Nykänen. 180-191 [doi]
- Reasoning about Typicality in Preferential Description LogicsLaura Giordano, Valentina Gliozzi, Nicola Olivetti, Gian Luca Pozzato. 192-205 [doi]
- Counting Complexity of Minimal Cardinality and Minimal Weight AbductionMiki Hermann, Reinhard Pichler. 206-218 [doi]
- Uniform Interpolation by Resolution in Modal LogicAndreas Herzig, Jérôme Mengin. 219-231 [doi]
- GOAL Agents Instantiate Intention LogicKoen iV. indriks, Wiebe van der Hoek. 232-244 [doi]
- Linear Exponentials as Resource Operators: A Decidable First-order Linear Logic with Bounded ExponentialsNorihiro Kamide. 245-257 [doi]
- Fibrational Semantics for Many-Valued Logic Programs: Grounds for Non-GroundnessEkaterina Komendantskaya, John Power. 258-271 [doi]
- Confluence OperatorsSébastien Konieczny, Ramón Pino Pérez. 272-284 [doi]
- A Game-Theoretic Measure of Argument Strength for Abstract ArgumentationPaul-Amaury Matt, Francesca Toni. 285-297 [doi]
- A Tableau for RoBCTLJohn C. McCabe-Dansted. 298-310 [doi]
- A Proof-Theoretic Approach to Deciding Subsumption and Computing Least Common Subsumer in w.r.t. Hybrid TBoxesNovak Novakovic. 311-323 [doi]
- Extending Carinto the Description Logics of the FamilyMagdalena Ortiz. 324-337 [doi]
- How to Restore Compactness into Probabilistic Logics?Aleksandar Perovic, Zoran Ognjanovic, Miodrag Raskovic, Zoran Markovic. 338-348 [doi]
- Combining Modes of Reasoning: An Application of Abstract ArgumentationHenry Prakken. 349-361 [doi]
- Cheap Boolean Role Constructors for Description LogicsSebastian Rudolph, Markus Krötzsch, Pascal Hitzler. 362-374 [doi]
- Improved Second-Order Quantifier Elimination in Modal LogicRenate A. Schmidt. 375-388 [doi]
- Literal Projection for First-Order LogicChristoph Wernhard. 389-402 [doi]
- Meta Level Reasoning and Default ReasoningYi Zhou, Yan Zhang. 403-415 [doi]
- Rule Calculus: Semantics, Axioms and ApplicationsYi Zhou, Yan Zhang. 416-428 [doi]