ICLP 2012: Accepted papers

Ordering is according submission number. Full papers will be published in a special issue of TPLP. Technical communications instead will be published in a LIPICS (Schloss Dagstuhl) issue.

Full papers

  1. Miguel Areias and Ricardo Rocha. Towards Multi-Threaded Local Tabling Using a Common Table Space
  2. Bernhard Bliem, Michael Morak and Stefan Woltran. D-FLAT: Declarative Problem Solving Using Tree Decompositions and Answer-Set Programming
  3. Amit Metodi and Michael Codish. Compiling Finite Domain Constraints to SAT with BEE
  4. Max Ostrowski and Torsten Schaub. ASP modulo CSP: The clingcon system
  5. Muhammad Islam, C.R. Ramakrishnan and I.V. Ramakrishnan. Inference in Probabilistic Logic Programs with Continuous Random Variables
  6. Martin Gebser, Benjamin Kaufmann and Torsten Schaub. Multi-threaded ASP Solving with clasp
  7. Neng-Fa Zhou and Christian Theil Have. Efficient Tabling of Structured Data with Enhanced Hash-Consing
  8. Vladimir Lifschitz, Karl Pichotta and Fangkai Yang. Relational Theories with Null Values and Non-Herbrand Stable Models
  9. German Vidal. Annotation of Logic Programs for Independent AND-Parallelism by Partial Evaluation
  10. Gregory Duck. SMCHR: Satisfiability Modulo Constraint Handling Rules
  11. Marina De Vos, Doga Gizem Kisa, Johannes Oetsch, Jörg Pührer and Hans Tompits. Annotating Answer-Set Programs in LANA
  12. Iliano Cervesato. An Improved Proof-Theoretic Compilation of Logic Programs
  13. Thomas Eiter, Michael Fink, Thomas Krennwallner and Christoph Redl. Conflict-driven ASP Solving with External Sources
  14. Andrey Gorlin, C. R. Ramakrishnan and Scott Smolka. Model Checking with Probabilistic Tabled Logic Programming
  15. Mario Alviano, Wolfgang Faber, Nicola Leone and Marco Manna. Disjunctive Datalog with Existential Quantifiers: Semantics, Decidability, and Complexity Issues
  16. Joseph Babb and Joohyung Lee. Module Theorem for the General Theory of Stable Models
  17. Rémy Haemmerlé. Diagrammatic confluence for Constraint Handling Rules
  18. Jose F. Morales, Rémy Haemmerlé, Manuel Carro and Manuel Hermenegildo. Lightweight Compilation of (C)LP to JavaScript
  19. Chitta Baral, Juraj Dzifcak, Marcos Gonzalez and Aaron Gottesman. Typed Answer Set Programming Lambda Calculus and Corresponding Inverse Lambda Algorithms
  20. Michael Maher. The Relative Expressiveness of Defeasible Logics

Technical Communications

  1. Nuno Lopes, Sabrina Kirrane, Antoine Zimmermann, Axel Polleres and Alessandra Mileo. A Logic Programming approach for Access Control over RDF
  2. Hendrik Blockeel, Bart Bogaerts, Maurice Bruynooghe, Broes De Cat, Stef De Pooter, Marc Denecker, Anthony Labarre, Jan Ramon and Sicco Verwer. Modeling Machine Learning and Data Mining Problems with FO(·)
  3. Felicidad Aguado, Pedro Cabalar, Martín Diéguez, Gilberto Pérez and Concepcion Vidal. Paving the Way for Temporal Grounding
  4. Michael Morak and Stefan Woltran. Preprocessing of Complex Non-Ground Rules in Answer Set Programming
  5. Vladimir Lifschitz. Two-Valued Logic Programs
  6. Marina De Vos, Julian Padget, Vivana Novelli and Dina D’Ayala. LOG-IDEAH: ASP for Architectonic Asset Preservation
  7. Holger Hoos, Roland Kaminski, Torsten Schaub and Marius Schneider. aspeed: ASP-based Solver Scheduling
  8. Zsolt Zombori, János Csorba and Péter Szeredi. Static Type Inference for the Q language using Constraint Logic Programming
  9. Enrico Pontelli, Tiep Le, Hieu Nguyen and Tran Cao Son. ASP at Work: An ASP Implementation of PhyloWS
  10. Massimiliano Cattafi, Rosa Herrero, Marco Gavanelli, Maddalena Nonato and Juan José Ramos Gonzalez. Improving Quality and Efficiency in Home Health Care: an application of Constraint Logic Programming for the Ferrara NHS unit
  11. Johannes Oetsch, Jörg Pührer and Hans Tompits. An FLP-Style Answer-Set Semantics for Abstract-Constraint Programs with Disjunctions
  12. Marc Denecker, Yuliya Lierler, Mirek Truszczynski and Joost Vennekens. A Tarskian Semantics for Answer Set Programming
  13. Broes De Cat, Marc Denecker and Peter Stuckey. Lazy model expansion by incremental grounding
  14. Wlodek Drabent. Logic + control: An example
  15. Taisuke Sato and Philipp Meyer. Tabling for infinite probability computation
  16. Michael Hanus. Improving Lazy Non-Deterministic Computations by Demand Analysis
  17. Bryan Silverthorn, Yuliya Lierler and Marius Schneider. Surviving Solver Sensitivity: An ASP Practitioner’s Guide
  18. Sergio Greco, Francesca Spezzano and Irina Trubitsyna. On the Termination of Logic Programs with Function Symbols
  19. Elvira Albert, Puri Arenas and Miguel Gomez-Zamalloa. Towards Testing Concurrent Objects in CLP
  20. Mutsunori Banbara, Naoyuki Tamura and Katsumi Inoue. Generating Event-Sequence Test Cases by Answer SetProgramming with the Incidence Matrix
  21. Christian Drescher and Toby Walsh. Answer Set Solving with Lazy Nogood Generation
  22. Jia-Huai You, John Morris and Yi Bi. Reconciling Well-Founded Semantics of DL-Programs and AggregatePrograms
  23. Joohyung Lee and Yunsong Meng. Stable Models of Formulas with Generalized Quantifiers
  24. Xiaoping Chen, Guoqiang Jin and Fangkai Yang. Extending C+ with Composite Actions for Robotic Task Planning
  25. Paul Tarau. Deriving a Fast Inverse of the Generalized Cantor N-tupling Bijection
  26. Benjamin Andres, Benjamin Kaufmann, Oliver Matheis and Torsten Schaub. Unsatisfiability-based optimization in clasp
  27. Slim Abdennadher and Nada Sharaf. Visualization of Constraint Handling Rules through Source-to-Source Transformation
  28. Marco Maratea, Luca Pulina and Francesco Ricca. Applying Machine Learning Techniques to ASP Solving
  29. Nathaniel Filardo and Jason Eisner. Flexible Solvers for Finite Arithmetic Circuits
  30. Giovanni Bacci, Marco Comini, Marco A. Feliú and Alicia Villanueva. The additional difficulties for the automatic synthesis of specifications posed by logic features in functional-logic languages
  31. Shanshan Liang, Nguyen Ha Vo and Chitta Baral. Answering Why and How questions with respect to a frame-based knowledge base: a preliminary report
  32. Emilio Jesús Gallego Arias and James B. Lipton. Logic Programming in Tabular Allegories
  33. Juan Carlos Nieves and Helena Lindgren. Possibilistic Nested Logic Programs
  34. Florian Schanda and Martin Brain. Using Answer Set Programming in the Development of Verified Software
  35. Marcello Balduccini. An Answer Set Solver for non-Herbrand Programs: Progress Report
  36. Veronica Dahl, Bradley Coleman, Emilio Miralles and Erez Maharshak. CHR for Social Responsibility
  37. Rafael Del Vado Vírseda, Fernando Pérez Morente and Marcos Miguel García Toledo. A Concurrent Operational Semantics for Constraint Functional Logic Programming