Table of Contents

• Frontmatter, Table of Contents, List of Authors [doi]
• Introduction to the Technical Communications of the 28th International Conference on Logic Programming Special IssueAgostino Dovier, Vítor Santos Costa. [doi]
• Simulation Unification: Beyond Querying Semistructured Data (Invited Talk)François Bry, Sebastian Schaffert. 1-13 [doi]
• Modeling Machine Learning and Data Mining Problems with FO(·)Hendrik Blockeel, Bart Bogaerts, Maurice Bruynooghe, Broes de Cat, Stef De Pooter, Marc Denecker, Anthony Labarre, Jan Ramon, Sicco Verwer. 14-25 [doi]
• Answering Why and How questions with respect to a frame-based knowledge base: a preliminary reportChitta Baral, Nguyen Ha Vo, Shanshan Liang. 26-36 [doi]
• Applying Machine Learning Techniques to ASP SolvingMarco Maratea, Luca Pulina, Francesco Ricca. 37-48 [doi]
• An Answer Set Solver for non-Herbrand Programs: Progress ReportMarcello Balduccini. 49-60 [doi]
• Stable Models of Formulas with Generalized Quantifiers (Preliminary Report)Joohyung Lee, Yunsong Meng. 61-71 [doi]
• Using Answer Set Programming in the Development of Verified SoftwareFlorian Schanda, Martin Brain. 72-85 [doi]
• Generating Event-Sequence Test Cases by Answer Set Programming with the Incidence MatrixMutsunori Banbara, Naoyuki Tamura, Katsumi Inoue. 86-97 [doi]
• Towards Testing Concurrent Objects in CLPElvira Albert, Puri Arenas, Miguel Gómez-Zamalloa. 98-108 [doi]
• Visualization of CHR through Source-to-Source TransformationSlim Abdennadher, Nada Sharaf. 109-118 [doi]
• Static Type Inference for the Q language using Constraint Logic ProgrammingZsolt Zombori, János Csorba, Péter Szeredi. 119-129 [doi]
• Improving Lazy Non-Deterministic Computations by Demand AnalysisMichael Hanus. 130-143 [doi]
• The additional difficulties for the automatic synthesis of specifications posed by logic features in functional-logic languagesGiovanni Bacci, Marco Comini, Marco A. Feliú, Alicia Villanueva. 144-153 [doi]
• A Concurrent Operational Semantics for Constraint Functional Logic ProgrammingRafael del Vado Vírseda, Fernando Pérez Morente, Marcos Miguel García Toledo. 154-163 [doi]
• Surviving Solver Sensitivity: An ASP Practitioner's GuideBryan Silverthorn, Yuliya Lierler, Marius Schneider. 164-175 [doi]
• aspeed: ASP-based Solver SchedulingHolger Hoos, Roland Kaminski, Torsten Schaub, Marius Thomas Schneider. 176-187 [doi]
• Answer Set Solving with Lazy Nogood GenerationChristian Drescher, Toby Walsh. 188-200 [doi]
• Lazy Model Expansion by Incremental GroundingBroes de Cat, Marc Denecker, Peter J. Stuckey. 201-211 [doi]
• Unsatisfiability-based optimization in claspBenjamin Andres, Benjamin Kaufmann, Oliver Matheis, Torsten Schaub. 211-221 [doi]
• An FLP-Style Answer-Set Semantics for Abstract-Constraint Programs with DisjunctionsJohannes Oetsch, Jörg Pührer, Hans Tompits. 222-234 [doi]
• Reconciling Well-Founded Semantics of DL-Programs and Aggregate ProgramsJia-Huai You, John Morris, Yi Bi. 235-246 [doi]
• Preprocessing of Complex Non-Ground Rules in Answer Set ProgrammingMichael Morak, Stefan Woltran. 247-258 [doi]
• Two-Valued Logic ProgramsVladimir Lifschitz. 259-266 [doi]
• Possibilistic Nested Logic ProgramsJuan Carlos Nieves, Helena Lindgren. 267-276 [doi]
• A Tarskian Informal Semantics for Answer Set ProgrammingMarc Denecker, Yuliya Lierler, Miroslaw Truszczynski, Joost Vennekens. 277-289 [doi]
• Paving the Way for Temporal GroundingFelicidad Aguado, Pedro Cabalar, Martín Diéguez, Gilberto Pérez, Concepción Vidal. 290-300 [doi]
• Logic + control: An exampleWlodzimierz Drabent. 301-311 [doi]
• Deriving a Fast Inverse of the Generalized Cantor N-tupling BijectionPaul Tarau. 312-322 [doi]
• On the Termination of Logic Programs with Function SymbolsSergio Greco, Francesca Spezzano, Irina Trubitsyna. 323-333 [doi]
• Logic Programming in Tabular AllegoriesEmilio Jesús Gallego Arias, James Lipton. 334-347 [doi]
• Tabling for infinite probability computationTaisuke Sato, Philipp Meyer. 348-358 [doi]
• ASP at Work: An ASP Implementation of PhyloWSTiep Le, Hieu Nguyen, Enrico Pontelli, Tran Cao Son. 359-369 [doi]
• CHR for Social ResponsibilityVerónica Dahl, Bradley Coleman, J. Emilio Miralles, Erez Maharshak. 370-380 [doi]
• A Logic Programming approach for Access Control over RDFNuno Lopes 0002, Sabrina Kirrane, Antoine Zimmermann, Axel Polleres, Alessandra Mileo. 381-392 [doi]
• LOG-IDEAH: ASP for Architectonic Asset PreservationViviana Novelli, Marina De Vos, Julian A. Padget, Dina D'Ayala. 393-403 [doi]
• Extending C+ with Composite Actions for Robotic Task PlanningXiaoping Chen, Guoqiang Jin, Fangkai Yang. 404-414 [doi]
• Improving Quality and Efficiency in Home Health Care: an application of Constraint Logic Programming for the Ferrara NHS unitMassimiliano Cattafi, Rosa Herrero, Marco Gavanelli, Maddalena Nonato, Federico Malucelli. 415-424 [doi]
• A Flexible Solver for Finite Arithmetic CircuitsNathaniel Wesley Filardo, Jason Eisner. 425-438 [doi]
• Software Model Checking by Program SpecializationEmanuele De Angelis. 439-444 [doi]
• Temporal Answer Set ProgrammingMartín Diéguez. 445-450 [doi]
• A Gradual Polymorphic Type System with Subtyping for PrologSpyros Hadjichristodoulou. 451-457 [doi]
• ASP modulo CSP: The clingcon systemMax Ostrowski. 458-463 [doi]
• An ASP Approach for the Optimal Placement of the Isolation Valves in a Water Distribution SystemAndrea Peano. 464-468 [doi]
• Answer Set Programming with External SourcesChristoph Redl. 469-475 [doi]
• Together, Is Anything Possible? A Look at Collective Commitments for AgentsBen Wright. 476-480 [doi]