Abstract is missing.
- Towards Reactive Multi-Context SystemsGerhard Brewka. 1-10 [doi]
- Logic Programming in the 1970sRobert Kowalski. 11-22 [doi]
- Integrating Temporal Extensions of Answer Set ProgrammingFelicidad Aguado, Gilberto Pérez, Concepción Vidal. 23-35 [doi]
- Forgetting under the Well-Founded SemanticsJosé Júlio Alferes, Matthias Knorr, Kewen Wang. 36-41 [doi]
- The Fourth Answer Set Programming Competition: Preliminary ReportMario Alviano, Francesco Calimeri, Günther Charwat, Minh Dao-Tran, Carmine Dodaro, Giovambattista Ianni, Thomas Krennwallner, Martin Kronegger, Johannes Oetsch, Andreas Pfandler, Jörg Pührer, Christoph Redl, Francesco Ricca, Patrik Schneider, Martin Schwengerer, Lara Katharina Spendier, Johannes Peter Wallner, Guohui Xiao. 42-53 [doi]
- WASP: A Native ASP Solver Based on Constraint LearningMario Alviano, Carmine Dodaro, Wolfgang Faber, Nicola Leone, Francesco Ricca. 54-66 [doi]
- The Complexity Boundary of Answer Set Programming with Generalized Atoms under the FLP SemanticsMario Alviano, Wolfgang Faber. 67-72 [doi]
- ARVis: Visualizing Relations between Answer SetsThomas Ambroz, Günther Charwat, Andreas Jusits, Johannes Peter Wallner, Stefan Woltran. 73-78 [doi]
- Symbolic System Synthesis Using Answer Set ProgrammingBenjamin Andres, Martin Gebser, Torsten Schaub, Christian Haubelt, Felix Reimann, Michael Glaß. 79-91 [doi]
- Accurate Computation of Sensitizable Paths Using Answer Set ProgrammingBenjamin Andres, Matthias Sauer, Martin Gebser, Tobias Schubert, Bernd Becker, Torsten Schaub. 92-101 [doi]
- Hex Semantics via Approximation Fixpoint TheoryChristian Antic, Thomas Eiter, Michael Fink. 102-115 [doi]
- Encoding Higher Level Extensions of Petri Nets in Answer Set ProgrammingSaadat Anwar, Chitta Baral, Katsumi Inoue. 116-121 [doi]
- Cplus 2ASP: Computing Action Language ${\cal C}$ + in Answer Set ProgrammingJoseph Babb, Joohyung Lee. 122-134 [doi]
- Towards Answer Set Programming with SortsEvgenii Balai, Michael Gelfond, Yuanlin Zhang. 135-147 [doi]
- Prolog and ASP Inference under One RoofMarcello Balduccini, Yuliya Lierler, Peter Schüller. 148-160 [doi]
- Event-Object Reasoning with Curated Knowledge Bases: Deriving Missing InformationChitta Baral, Nguyen Ha Vo. 161-167 [doi]
- Towards Query Answering in Relational Multi-Context SystemsRosamaria Barilaro, Michael Fink, Francesco Ricca, Giorgio Terracina. 168-173 [doi]
- Spectra in Abstract Argumentation: An Analysis of Minimal ChangeRingo Baumann, Gerhard Brewka. 174-186 [doi]
- Normalizing Cardinality Rules Using Merging and Sorting ConstructionsJori Bomanson, Tomi Janhunen. 187-199 [doi]
- Experience Based Nonmonotonic ReasoningDaniel Borchmann. 200-205 [doi]
- An ASP Application in Integrative Biology: Identification of Functional Gene UnitsPhilippe Bordron, Damien Eveillard, Alejandro Maass, Anne Siegel, Sven Thiele. 206-218 [doi]
- Evaluating Answer Set Clause Learning for General Game PlayingTimothy Joseph Cerexhe, Orkunt Sabuncu, Michael Thielscher. 219-232 [doi]
- VCWC: A Versioning Competition Workflow CompilerGünther Charwat, Giovambattista Ianni, Thomas Krennwallner, Martin Kronegger, Andreas Pfandler, Christoph Redl, Martin Schwengerer, Lara Katharina Spendier, Johannes Peter Wallner, Guohui Xiao. 233-238 [doi]
- A Sequential Model for Reasoning about Bargaining in Logic ProgramsWu Chen, Dongmo Zhang, Maonian Wu. 239-244 [doi]
- Ectocarpus Siliculosus Using Answer Set ProgrammingGuillaume Collet, Damien Eveillard, Martin Gebser, Sylvain Prigent, Torsten Schaub, Anne Siegel, Sven Thiele. 245-256 [doi]
- Negation as a Resource: A Novel View on Answer Set SemanticsStefania Costantini, Andrea Formisano. 257-263 [doi]
- AGM-Style Belief Revision of Logic Programs under Answer Set SemanticsJames P. Delgrande, Pavlos Peppas, Stefan Woltran. 264-276 [doi]
- Efficient Approximation of Well-Founded Justification and Well-Founded DominationChristian Drescher, Toby Walsh. 277-289 [doi]
- Approximate Epistemic Planning with Postdiction as Answer-Set ProgrammingManfred Eppe, Mehul Bhatt, Frank Dylla. 290-303 [doi]
- Combining Equilibrium Logic and Dynamic LogicLuis Fariñas del Cerro, Andreas Herzig, Ezgi Iraz Su. 304-316 [doi]
- ActHEX: Implementing HEX Programs with Action AtomsMichael Fink, Stefano Germano, Giovambattista Ianni, Christoph Redl, Peter Schüller. 317-322 [doi]
- Debugging Answer-Set Programs with Ouroboros - Extending the SeaLion PluginMelanie Frühstück, Jörg Pührer, Gerhard Friedrich. 323-328 [doi]
- Game Semantics for Non-monotonic Intensional Logic ProgrammingChrysida Galanaki, Christos Nomikos, Panos Rondogiannis. 329-341 [doi]
- Matchmaking with Answer Set ProgrammingMartin Gebser, Thomas Glase, Orkunt Sabuncu, Torsten Schaub. 342-347 [doi]
- Ricochet Robots: A Transverse ASP BenchmarkMartin Gebser, Holger Jost, Roland Kaminski, Philipp Obermeier, Orkunt Sabuncu, Torsten Schaub, Marius Schneider. 348-360 [doi]
- Decidability and Implementation of Parametrized Logic ProgramsRicardo Gonçalves, José Júlio Alferes. 361-373 [doi]
- Non-monotonic Temporal GoalsRicardo Gonçalves, Matthias Knorr, João Leite, Martin Slota. 374-386 [doi]
- On Equivalent Transformations of Infinitary Formulas under the Stable Model SemanticsAmelia Harrison, Vladimir Lifschitz, Miroslaw Truszczynski. 387-394 [doi]
- An Application of ASP to the Field of Second Language AcquisitionDaniela Inclezan. 395-400 [doi]
- Turner's Logic of Universal Causation, Propositional Logic, and Logic ProgrammingJianmin Ji, Fangzhen Lin. 401-413 [doi]
- Concrete Results on Abstract RulesMarkus Krötzsch, Despoina Magka, Ian Horrocks. 414-426 [doi]
- Linear Logic Programming for Narrative GenerationChris Martens, Anne-Gwenn Bosser, João F. Ferreira, Marc Cavazza. 427-432 [doi]
- Implementing Informal Semantics of ASPArtur Mikitiuk, Miroslaw Truszczynski. 433-438 [doi]
- Implementing Belief Change in the Situation Calculus and an ApplicationMaurice Pagnucco, David Rajaratnam, Hannes Strass, Michael Thielscher. 439-451 [doi]
- Debugging Non-ground ASP Programs with Choice Rules, Cardinality and Weight ConstraintsAxel Polleres, Melanie Frühstück, Gottfried Schenner, Gerhard Friedrich. 452-464 [doi]
- Conflict-Based Program Rewriting for Solving Configuration ProblemsAnna Ryabokon, Gerhard Friedrich, Andreas A. Falkner. 465-478 [doi]
- Program Updating by Incremental and Answer Subsumption TablingAri Saptawijaya, Luís Moniz Pereira. 479-484 [doi]
- Characterization Theorems for Revision of Logic ProgramsNicolas Schwind, Katsumi Inoue. 485-498 [doi]
- Flexible Combinatory Categorial Grammar Parsing Using the CYK Algorithm and Answer Set ProgrammingPeter Schüller. 499-511 [doi]
- Early Recovery in Logic Program UpdatesMartin Slota, Martin Baláz, João Leite. 512-517 [doi]
- Preference Handling for Belief-Based Rational DecisionsSamy Sá, João Alcântara. 518-523 [doi]
- Logic-Based Techniques for Data Cleaning: An Application to the Italian National Healthcare SystemGiorgio Terracina, Alessandra Martello, Nicola Leone. 524-529 [doi]
- Justifications for Logic ProgrammingCarlos Viegas Damásio, Anastasia Analyti, Grigoris Antoniou. 530-542 [doi]
- Belief Change in Nonmonotonic Multi-Context SystemsYisong Wang, Zhiqiang Zhuang, Kewen Wang. 543-555 [doi]
- On Optimal Solutions of Answer Set Optimization ProblemsYing Zhu, Miroslaw Truszczynski. 556-568 [doi]