ICLP 2013 Slides

 

   

Invited Talks

  1. Pascal Hitzler. Recent Advances Concerning OWL and Rules (Video)

  2. Torsten Schaub. Experiencing Answer Set Programming at Work, Today and Tomorrow (Video)

  3. Hans van Ditmarsch. Dynamic Epistemic Logic and Lying (Video)

  4. C. R. Ramakrishnan. Probabilistic Tabled Logic Programming with Application to Model Checking (Video)

Most Influential Paper from 1993

  1. Anthony Bonner and Michael Kifer. 20 Years of Transaction Logic

Most Influential Paper from 2013

  1. Thomas Eiter and Michael Fink. Uniform Equivalence of Logic Programs Under the Stable Model Semantics

Monday

Session 1: Datalog and Databases

  1. Mirjana Mazuran, Edoardo Serra and Carlo Zaniolo. A Declarative Extension of Horn Clauses, and its Significance for Datalog and its Applications

  2. Georg Gottlob, Marco Manna and Andreas Pieris. Combining Decidability Paradigms for Existential Rules

Session 2: Semantics

  1. Vladimir Lifschitz and Fangkai Yang. Lloyd-Topor Completion and General Stable Models

  2. Jia-Huai You, Heng Zhang and Yan Zhang. Disjunctive Logic Programs with Existential Quantification in Rule Heads

  3. Michael Bartholomew and Joohyung Lee. On the Stable Model Semantics with Intensional Functions

Session 3: Analysis

  1. Alejandro Arbelaez, Philippe Codognet and Charlotte Truchet. Using Sequential Runtime Distributions for the Parallel Speedup Prediction of SAT f Local Search

  2. Senlin Liang and Michael Kifer. A Practical Analysis of Non-Termination in Large Logic Programs
    Sergio Greco, Cristian Molinaro and Irina Trubitsyna. Logic Programming with Function Symbols: Checking Termination of Bottom-up Evaluation Through Program Adornments

  3. Elvira Albert, Maria Garcia de La Banda, Miguel Gomez-Zamalloa, José Miguel Rojas and Peter Stuckey. A CLP Heap Solver for Test Case Generation

Tuesday

Session 4: ASP & solvers

  1. Rehan Aziz, Geoffrey Chu and Peter Stuckey. Stable Model Semantics for Founded Bounds

  2. Mario Alviano and Rafael Peñaloza. Fuzzy answer sets approximations

Session 5: Non-Monotonic Reasoning & Knowledge Representation

  1. Michael Maher. Relative Expressiveness of Defeasible Logics II

  2. Jon Sneyers, Daniel De Schreye and Thom Fruehwirth. Probabilistic Legal Reasoning in CHRiSM

  3. Rolf Schwitter. The Jobs Puzzle: Taking on the Challenge via Controlled Natural Language Processing

TechComm 1: Knowledge Representation & Reasoning, Events and Actions

  1. Dimitar Shterionov, Theofrastos Mantadelis and Gerda Janssens. Pattern-Based Compaction for ProbLog Inference

  2. Lenz Belzner. Action Programming In Rewriting Logic

  3. Ana Sofia Gomes and Jose Julio Alferes. Extending Transaction Logic with External Actions

  4. Dalal Alrajeh, Rob Miller, Alessandra Russo and Sebastian Uchitel. Reasoning about Triggered Scenarios in Logic Programming

  5. Pieter Van Hertum, Joost Vennekens, Bart Bogaerts, Jo Devriendt and Marc Denecker. The effects of buying a new car: an extension of the IDP Knowledge Base System

  6. Paulo Shakarian, Gerardo Simari and Devon Callahan. Reasoning about Complex Networks: A Logic Programming Approach

  7. Viviana Mascardi and Davide Ancona. Attribute Global Types for Dynamic Checking of Protocols in Logic-based Multiagent Systems

TechComm 2: Analysis & Transformation, Constraint Processing & SAT

  1. Alejandro Serrano, Pedro Lopez-Garcia, Francisco Bueno and Manuel Hermenegildo. Sized Type Analysis for Logic Programs

  2. Lunjin Lu. Towards Parametrizing Logic Program Analysis: Two Examples

  3. Amira Zaki, Thom Fruehwirth and Slim Abdennadher. Towards Inverse Execution of Constraint Handling Rules

  4. Michael Hanus. Adding Plural Arguments to Curry Programs

  5. Vivek Nigam, Giselle Reis and Leonardo Lima. Checking Proof Transformations with ASP

  6. Said Jabbour, Lakhdar Sais and Yakoub Salhi. A Pigeon-Hole Based Encoding of Cardinality Constraints

  7. Amir Aavani, Eugenia Ternovska and David Mitchell. Problem Solving with the Enfragmo System

TechComm 3: ASP-based Systems, Systems & Tools

  1. Tony Ribeiro, Katsumi Inoue and Gauvain Bourgne. Combining Answer Set Programs for Adaptive and Reactive Reasoning

  2. Arne Koenig and Torsten Schaub. Monitoring and Visualizing Answer Set Solving

  3. Jianmin Ji, Fangzhen Lin and Jia-Huai You. Computing Loops with at Most One External Support Rule for Basic Logic Programs with Arbitrary Constraint Atoms

  4. Saadat Anwar, Chitta Baral and Katsumi Inoue. Encoding Petri Nets in Answer Set Programming for Simulation Based Reasoning

  5. Marcello Balduccini and Yuliya Lierler. Integration Schemas for Constraint Answer Set Programming: a Case Study

  6. Edison Mera and Jan Wielemaker. Porting and refactoring Prolog programs: the PROSYN case study

TechComm 4: Datalog & Databases, Non-Monotonic Reasoning, Semantics

  1. Werner Nutt, Sergey Paramonov and Ognjen Savkovic. An ASP Approach to Query Completeness Reasoning

  2. Vinay Chaudhri, Stijn Heymans, Son Tran and Michael Wessel. Object-Oriented Knowledge Bases in Logic Programming

  3. Claudia Schulz and Francesca Toni. ABA-Based Answer Set Justification

  4. Ari Saptawijaya and Lui¬s Moniz Pereira. Tabled Abduction in Logic Programs

  5. Vernon Asuncion, Yan Zhang, Heng Zhang and Yi Zhou. Constructive Circumscription

  6. Davide Ancona and Agostino Dovier. co-LP: Back to the Roots


Wednesday

Session 6: Knowledge Representation & Reasoning

  1. Broes De Cat and Maurice Bruynooghe. Detection and Exploitation of Functional Dependencies For Model Generation

  2. Joachim Jansen, Gerda Janssens and Albert Jorissen. Compiling Input FO(·) Inductive Definitions into Tabled Prolog Rules for IDP3

Session 7: Applications

  1. Roland Kaminski, Torsten Schaub, Anne Siegel and Santiago Videla. Minimal Intervention Strategies in Logical Signaling Networks with Answer Set Programming

  2. Mutsunori Banbara, Takehide Soh, Naoyuki Tamura, Katsumi Inoue and Torsten Schaub. Answer Set Programming as a Modeling Language for Course Timetabling

  3. Esra Erdem, Volkan Patoglu, Zeynep Gozen Saribatur, Peter Schüller and Tansel Uras. Finding Optimal Plans for Multiple Teams of Robots through a Mediator: A Logic- Based Approach

Session 8: Implementations

  1. Tom Schrijvers, Bart Demoen, Benoit Desouter and Jan Wielemaker. Delimited Continuations for Prolog

  2. Graeme Gange, Jorge A. Navas, Peter Schachte, Harald Sondergaard and Peter J. Stuckey. Failure Tabled Constraint Logic Programming by Interpolation

  3. Paul Tarau. Compact Serialization of Prolog Terms (with Catalan Skeletons, Cantor Tupling and Goedel Numberings)

Thursday

Session 9: Multi-Agent Systems & Business Processes

  1. Jiefei Ma, Frank Le, David Wood, Alessandra Russo and Jorge Lobo. A declarative approach for distributed computing: specification, execution and analysis

  2. Laura Giordano, Alberto Martelli, Matteo Spiotta and Daniele Theseider Dupre’. Business Process Verification with Constraint Temporal Answer Set Programming

Session 10: Systems & Tools

  1. Paula-Andra Busoniu, Johannes Oetsch, Jörg Pührer, Peter Skocovský and Hans Tompits. SeaLion: An Eclipse-based IDE for Answer-Set Programming with Advanced Debugging Support

  2. Marcello Balduccini. ASP with non-Herbrand Partial Functions: a Language and System for Practical Use

  3. Vítor Santos Costa and David Vaz. BigYAP: Exo-compilation meets UDI