Definitive Program of ICLP08    
  and affiliated workshops    
  Tuesday 9th December 2008    
8:30 – 9:00     Registration (Aula 4)
  Sala Convegni Sala Florio    
9:00 – 10:30 Tutorial 1 Tutorial 2    
  Tom Schrijvers: Constraint Handling Rules, a Tutorial for (Prolog) Programmers Angelo Montanari: Back to Interval Temporal Logics    
10:30 – 10:50 Coffee Break (aula 4) Coffee Break (Sala Colonne)    
10:50 – 12:20 Tutorial 3 Tutorial 4    
  Carla Piazza and Alberto Policriti: Systems Biology: Models and Logics Peter O'Hearn: Separation Logic Tutorial    
12:20 – 12:30 Walk to the castle Walk to the castle    
12:30 – 13:45 Welcome Lunch (castle) Welcome Lunch (castle)    
  Sala Parlamento (castle)      
13:45 – 14:00 ICLP Opening      
  20 Years of Stable Model Semantics      
14:00 – 14:15 Opening of 20 Y of SMS      
  Invited Session      
  Session Chair: M. Truszczynski      
14:15 – 15:00 Michael Gelfond: Authorization and Obligation Policies in Dynamic Systems      
15:00 – 15:45 Vladimir Lifschitz: Twelve Definitions of a Stable Model      
15:45 – 16:25 David Pearce: Sixty Years of Stable Models      
16:25 – 16:45 Coffee Break      
16:45 – 17:30 Nicola Leone: The DLV Project: a Tour from Theory and Research to Applications and Market      
  Position papers session      
  Session Chair: A. Formisano      
17:30 – 17:45 Ilkka Niemela: Answer Set Programming without Unstratified Negation      
17:45 – 18:00 Victor Marek: Quo Vadis Answer Set Programming?      
18:00 – 18:15 Chitta Baral: Using Answer Set Programming for Knowledge Representation and Reasoning: Future Directions      
18:15 – 18:30 Marc Denecker: Building a Knowledge Base System for an Integration of Logic Programming and Classical Logic      
18:30 – 18:45 Torsten Schaub: Here's the Beef: Answer Set Programming!      
18:45 – 19:00 Thomas Eiter: SMS and ASP: Hype or TST?      
19:00 – 19:10 Closing      
  Wednesday 10th December 2008    
  Sala Convegni      
8:30 – 9:30 Invited speaker 1      
  Session Chair: E. Pontelli      
  Pedro Domingos: Learning, Logic, and Probability: A Unified View      
  Session 1: Applications I   Sala degli Atti
  Session Chair: P. Torroni   Workshop WG17
9:30 – 9:55 Martin Gebser, Torsten Schaub, Sven Thiele, Bjoern Usadel and Philippe Veber: Detecting Inconsistencies in Large Influence Networks with Answer Set Programming   9:30 Introduction
9:55 – 10:20 Alessandra Mileo, Davide Merico and Roberto Bisiani: A Logic Programming Approach to Home Monitoring for Risk Prevention in Assisted Living     Approval of the Minutes of the Oporto meeting.
10:20 – 10:45 Georg Boenn, Martin Brain, Marina De Vos and John Fitch: Automatic Composition of Melodic and Harmonic Music by Answer Set Programming     Approval of the Agenda.
10:45 – 11:10 Coffee Break (Posters Group 1) Coffee Break (Posters Group 1) Coffee Break (Posters Group 1)
    Sala Florio    
  Session 2: Algorithms, Systems, Implementations I Doctoral consortium    
  Session Chair: M. Hermenegildo Session Chairs: D. Warren, T. Schrijvers    
11:10 – 11:35 Angelika Kimmig, Vitor Santos Costa, Ricardo Rocha, Bart Demoen and Luc De Raedt: On the efficient execution of Prolog programs Ole Torp Lassen: Biosequence Analysis in PRISM   Paulo Moura: Technical Report on DCGs: progress report
11:35 – 12:00 Terrance Swift and Rui Marques: Concurrent and Local Evaluation of Normal Programs Francesco Santini: Managing Quality of Service with Soft Constraints    
12:00 – 12:25 Martin Gebser, Roland Kaminski, Benjamin Kaufmann, Max Ostrowski, Torsten Schaub and Sven Thiele: Engineering an Incremental ASP Solver Jose Santos. TopLog: ILP using a logic program declarative bias    
12:25 – 14:00 Lunch Break Lunch Break Lunch Break
  Session 3: Semantics and Foundations I      
  Session Chair: T. Janhunen      
14:00 – 14:25 Victor Marek and Jeffrey Remmel: On the continuity of Gelfond-Lifschitz operator and other applications of proof-theory in ASP proof-theory in ASP Markus Triska. Generalising Constraint Solving over Finite Domains   Japanese Contribution on Globals.
14:25 – 14:50 Joseph Near, William Byrd and Daniel Friedman: AlphaleanTAP: A Declarative Theorem Prover for First-Order Classical Logic Fabio Parisini. Bi-dimensional domains for the Non-overlapping Rectangles Constraint    
14:50 – 15:15 Alexis Saurin: Towards Ludics Programming: Interactive Proof Search Giorgio Gosti. Resolving CSP with naming games   Roger Scowen and Paulo Moura: Corrigenda
15:15 – 15:40 Luciano Caroprese and Mirek Truszczynski: Declarative Semantics for Active Integrity Constraints Raffaele Cipriano. On the hybridization of constraint programming and local search techniques: models and software tools    
15:40 – 16:00 Coffee Break (Posters Group 2) Coffee Break (Posters Group 2) Coffee Break (Posters Group 2)
  Session 4: Analysis & Transformations      
  Session Chair: J. Gallagher      
16:00 - 16:25 Valerio Senni, Alberto Pettorossi and Maurizio Proietti.: A Folding Algorithm for Eliminating Existential Variables from Constraint Logic Programs Francois Degrave. Development of an automatic testing environment for Mercury   Other business
16:25 – 16:50 Eric Trias, Jorge Navas, Elena S. Ackley, Stephanie Forrest and Manuel Hermenegildo: Negative Ternary Set-Sharing Aliaksei Tsitovich. Detection of Security Vulnerabilities using Guided Model Checking    
16:50 – 17:15 Maria Alpuente, Santiago Escobar and Jose Iborra: Termination of Narrowing using Dependency Pairs Giovanni Pirrotta. Extracting and reasoning about web data   Resolutions
17:15 – 17:40 Christian Schulte and Peter Stuckey. Dynamic Analysis of Bounds versus Domain Propagation Romain Beauxis. Probabilistic and concurrent models for network and security    
  Sala degli Atti Sala degli Atti Sala degli Atti
18:00 – 19:45 Prolog Programming Contest Prolog Programming Contest Prolog Programming Contest
  Thursday 11th December 2008    
  Sala Convegni      
  Invited speaker 2      
  Session Chair: M.G. de la Banda      
8:30 – 9:30 Vitor Santos Costa: The Life of a Logic Programming System      
  Session 5: Semantics and Foundations II      
  Session Chair: T. Schaub      
9:30 – 9:55 Yuliya Lierler: Abstract Answer Set Solvers      
9:55 – 10:20 Guohua Liu and Jia-Huai You: Lparse Programs Revisited: Semantics and Representation of Aggregates      
10:20 – 10:45 Jeroen Janssen, Stijn Heymans, Dirk Vermeir and Martine De Cock: Compiling fuzzy answer set programs to fuzzy propositional theories      
10:45 – 11:10 Coffee Break (Posters Group 3) Coffee Break (Posters Group 3) Coffee Break (Posters Group 3)
  Session 6: Semantics and Foundations III   Sala Atti
  Session Chair: M. Truszczynski      
11:10 – 11:35 Pedro Cabalar: Partial Functions and Equality in Answer Set Programming   Tom Schrijvers and Bart Demoen: Uniting the Prolog Community
11:35 – 12:00 Francesco Calimeri, Susanna Cozza, Giovambattista Ianni and Nicola Leone: Computable Functions in ASP: Theory and Implementation      
12:00 – 12:25 Piero Bonatti and Sabrina Baselice: Composing normal programs with function symbols      
12:25 – 14:00 Lunch Break Lunch Break Lunch Break
  Sala Convegni Sala Florio Sala Colonne
  ICLP Short Papers Group 2 ICLP Short Papers Group 1 All posters
14:00 – 14:50 Session Chair: M. Carro Session Chair: A. Dal Palù    
  Tom Schrijvers, Vitor Santos Costa, Jan Wielemaker and Bart Demoen: Towards Typed Prolog Fabrizio Riguzzi: Inference with Logic Programs with Annotated Disjunctions under the Well Founded Semantics (poster)    
  Bart Demoen and Phuong-Lan Nguyen: Environment Reuse in the WAM Joohyung Lee, Vladimir Lifschitz and Ravi Palla: Safe Formulas in the General Theory of Stable Models    
  Paul Tarau: Logic Engines and Interactors Jorge A. Perez and Camilo Rueda: Non-determinism and Probabilities in Timed Concurrent Constraint Programming    
  Jorge Costa and Ricardo Rocha: Global Storing Mechanisms for Tabled Evaluation Jesus Aranda, Jorge A. Perez, Camilo Rueda and Frank Valencia: Stochastic Behavior and Explicit Discrete Time in Concurrent Constraint Programming    
  Paulo Moura, Ricardo Rocha and Sara C. Madeira: Thread-Based Competitive Or-Parallelism (Extended Abstract) Stephen Muggleton, Jose Santos and Alireza Tamaddoni-Nezhad: TopLog: ILP using a logic program declarative bias    
14:55 – 15:45 ICLP Short Papers Group 4 ICLP Short Papers Group 3    
  Session Chair: A. Pettorossi Session Chair: A. Formisano    
  Raffaele Cipriano, Agostino Dovier and Jacopo Mauro: Compiling and Executing Declarative Modeling Languages to Gecode Francesco Buccafurri, Gianluca Caminiti and Rosario Laurendi: A Logic Language with Stable Model Semantics for Social Reasoning    
  Michael Codish, Peter Stuckey and Vitaly Lagoon: Telecommunications Feature Subscription as a Partial Order Constraint Problem Owen Cliffe, Marina De Vos, Martin Brain and Julian Padget: ASPViz: Declarative Visualisation and Animation Using Answer Set Programming    
  Hakim Belhaouari and Frederic Peschanski: A Constraint Logic Programming Approach to Automated Testing Tomi Janhunen: Removing Redundancy from Answer Set Programs    
  Jon Sneyers: Turing-complete Subclasses of CHR Uwe Egly, Sarah Alice Gaggl and Stefan Woltran: ASPARTIX: Implementing Argumentation Frameworks Using Answer-Set Programming    
  Stefano Bistarelli, Fabio Gadducci, Javier Larrosa and Emma Rollon: A soft approach to multi-objective optimization Carlos Damasio, Anh Han The and Carroline D.P Kencana Ramli: An implementation of extended P-log using XASP.    
15:50 – 16:20 ICLP Short Papers Group 6 ICLP Short Papers Group 5    
  Session Chair: M. Codish Session Chair: A. King    
  Wim Vanhoof and Francois Degrave: An algorithm for sophisticated code matching in logic programs Giulio Piancastelli and Andrea Omicini: A Multi-Theory Logic Language for the World Wide Web    
  German Vidal: Trace Analysis for Predicting the Effectiveness of Partial Evaluation Sebastien Siva, James Lu and Hantao Zhang: A Case Study in Engineering SQL Constraint Database Systems (Extended Abstract)    
  Pablo Chico de Guzman, Manuel Carro and Manuel Hermenegildo: A Sketch of a Complete Scheme for Tabled Execution Based on Program Transformation Piero Bonatti, Juri Luca De Coi, Daniel Olmedilla and Luigi Sauro: Policy-Driven Negotiations and Explanations: Exploiting Logic-Programming for Trust Management, Privacy & Security    
16:40 – 24:00 Social Trip and dinner      
16:40 – 18:40 Visit of museo diocesano and Tiepolo's paintings      
19:15 – 19:30 Travel      
19:30 – 20:00 Visit of Villa Deciani      
19:45 – 20:00 Travel      
20:00 – 23:45 ICLP Banquet      
23:45 – 24:00 Back to Udine (bus will stop in the various hotels)      
  Friday 12th December 2008    
  Sala Convegni      
  ICLP Best papers presentation      
  Session Chairs: E. Pontelli, M. G. de la Banda, A. Dovier      
8:30 - 9:30 Michael Fink: Equivalences in Answer-Set Programming by Countermodels in the Logic of Here-and-There      
  Shay Cohen, Robert J. Simmons and Noah A. Smith: Dynamic Programming Algorithms as Products of Weighted Logic Programs Sala Florio Sala Atti
  Session 7: Applications II Workshop WLPE Workshop CICLOPS
  Session Chair: G. Rossi Invited Talk    
9:30 – 9:55 Marco Montali, Marco Alberti, Federico Chesani, Marco Gavanelli, Evelina Lamma, Paola Mello and Paolo Torroni: Verification from declarative specifications (9:30 – 10-45) 9:35 – 10:00 Atef Suleiman: Implementing Thread Cancellation in Multithreaded Prolog Systems
9:55 – 10:20 Gergely Lukacsy, Peter Szeredi and Balázs Kádár: Prolog based Description Logic reasoning Andy King: Relations, Constraints and Abstractions:Using the Tools of Logic Programming in the Security Industry 10:00 – 10:25 Paul Tarau: Interactors: Logic Engine Interoperation with Pure Prolog Semantics
10:20 – 10:45 Michela Milano, Luca Benini and Davide Bertozzi: Resource Management Policy Handling Multiple Use-Cases in MPSoC Platforms using Constraint Programming   10:25 – 10:50 Paulo Moura: Secure Implementation of Meta-predicates.
10:45 – 11:10 Coffee Break (Posters Group 4) Coffee Break (Posters Group 4) Coffee Break (Posters Group 4)
  Session 8: Semantics and Foundations IV      
  Session Chair: M. Gelfond      
11:10 – 11:35 David Pearce and Agustin Valverde: Quantified Equilibrium Logic and Foundations for Answer Set Programs Yoshihiro Adachi: Prolog Visualization System Using Logichart Diagrams 11:10 – 11:35 Jorge Costa and Ricardo Rocha: Tabling Logic Programs in a Common Global Trie
11:35 – 12:00 Joerg Puehrer, Hans Tompits and Stefan Woltran: Elimination of Disjunction and Negation in Answer-Set Programs under Hyperequivalence Jens Bendisposto, Ian Endrijautzki, Michael Leuschel and David Schneider: A Semantics-Aware Editing Environment for Prolog in Eclipse 11:35 – 12:00 Miguel Areias and Ricardo Rocha: Efficient Evaluation of Deterministic Tabled Calls
12:00 – 12:25 Mirek Truszczynski and Stefan Woltran: Relativized Hyperequivalence of Logic Programs for Modular Programming Miguel Gómez-Zamalloa, Elvira Albert and Germán Puebla: On the Generation of Test Data for Prolog by Partial Evaluation 12:00 – 12:25 Pablo Chico de Guzmán, Manuel Carro and Manuel Hermenegildo: A Program Transformation for Continuation Call-Based Tabled Execution
12:25 – 12:50 Johannes Oetsch and Hans Tompits: Program Correspondence under the Answer-Set Semantics: The Non-Ground Case Markus Triska, Ulrich Neumerkel and Jan Wielemaker: Better Termination for Prolog with Constraints 12:00 – 12:50 Terrance Swift, Rui Marques and Jose Cunha: Extending Tabled Logic Programming with Multi-Threading: A Systems Perspective
12:50 – 14:00 Lunch Break Lunch Break Lunch Break
  Session 9: CHR and Extensions Workshop WLPE Workshop ALPSWS
  Session Chair: B. Demoen   14:00 – 14:10 Opening
14:00 – 14:25 Peter Van Weert: Optimization of CHR Propagation Rules Victor Pablos Ceruelo, Susana Muñoz Hernández and Hannes Strass: Rfuzzy framework 14:10 – 14:35 Gisella Bennardo, Giovanni Grasso, Nicola Leone, and Francesco Ricca: Upgrading Databases to Ontologies
14:25 – 14:50 Paolo Pilozzi and Daniel De Schreye: Termination Analysis of CHR revisited Michael Leuschel, Salvador Tamarit and Germán Vidal: Improving Size-Change Analysis in Offline Partial Evaluation 14:35 – 15:00 Cristina Feier and Stijn Heymans: A Sound and Complete Algorithm for Simple Conceptual Logic Programs
14:50 – 15:15 Tom Schrijvers and Martin Sulzmann: Transactions in Constraint Handling Rules Francisco Javier López-Fraguas, Juan Rodríaguez-Hortalá and Jaime Sánchez-Hernández: A Lightweight Combination of Semantics for Non-deterministic Functions 15:00 – 15:25 Francesca Alessandra Lisi: Combining Logic Programming with Description Logics and Machine Learning for the Semantic Web
15:15 – 15:40 Gregory Duck, Leslie De Koninck and Peter Stuckey: Cadmium: An Implementation of ACD Term Rewriting Adrian Prantl, Jens Knoop, Markus Schordan and Markus Triska: Constraint solving for high-level WCET analysis 15:25 – 15.40 Olivier Bodenreider, Zeynep Coban, Mahir Doganay, Esra Erdem and Hilal Kosucu: A Preliminary Report on Answering Complex Queries related to Drug Discovery using Answer Set Programming
15:40 – 16:00 Coffee Break (Posters Group 5 & 6) Coffee Break (Posters Group 5 & 6) Coffee Break (Posters Group 5 & 6)
  Session 10: Algorithms, Systems, and Implementations II      
  Session Chair: V. Santos Costa      
16:00 – 16:25 Yuanlin Zhang, Roland Yap, Chendong Li and Satyanarayana Marisetti: Efficient Algorithms for Functional Constraints   16:00 – 16:25 Piero Bonatti and Luigi Sauro: A Semantic Stateless Service Description Language.
16:25 – 16:50 Bart Demoen and Phuong-Lan Nguyen: Two WAM Implementations of Action Rules   16:25 – 16:50 Balázs Kádár, Peter Szeredi and Gergely Lukácsy: Large scale reasoning on the Semantic Web
16:50 – 17:15 Radoslaw Szymanek and Christophe Lecoutre: Constraint-level Advice for Shaving   16:50 – 17:15 Reasoning on the Web with Open and Closed Predicates: Gerd Wagner, Adrian Giurca, Ion-Mircea Diaconescu, Grigoris Antoniou and Carlos Damasio
17:15 – 17:40 Amadeo Casas, Manuel Carro and Manuel Hermenegildo: A High-Level Implementation of Non-Deterministic, Unrestricted, Independent And-Parallelism   17:15 – 17:25 Closing
17:50 – 18:50 ALP Meeting      
  Saturday 13th December 2008    
  Sala Convegni   Sala Atti
  Workshop ASPOCP   Worskhop CICLOPS
9:00 – 9.05 Workshop Opening   9:00 – 9:25 Paul Tarau: Declarative Combinatorics in Prolog: ShapeShifting Data Objects with Isomorphisms and Hylomorphisms
9:05 – 9:25 Joost Vennekens, Marc Denecker: FO(ID) as an extension of DL with rules  
9:25 – 9:45 Simona Perri, Francesco Ricca, Saverio Vescio: Efficient Parallel ASP Instantiation via Dynamic Rewriting  
9:45 – 10:05 Stefania Costantini, Andrea Formisano: Modeling preferences on resource consumption and production in ASP   9:25 – 9:50 Jan Wielemaker and Ulrich Neumerkel: Precise Garbage Collection in Prolog
10:05 – 10.25 Philipp Kärger, Nuno Lopes, Axel Polleres, Daniel Olmedilla: Towards Logic Programs with Ordered and Unordered Disjunction   9:50 – 10:15 Paul Tarau: Pairing Functions, Boolean Evaluation and Binary Decision Diagrams in Prolog
10:25 - 10:45 Rachel Ben-Eliyahu-Zohary: Quantified Logic Programs, Revisited   10:15 – 10:45 The future of CICLOPS
10:45 – 11:10 Coffee Break   Coffee Break
11:10 – 11:30 Gelsomina Catalano, Nicola Leone, Simona Perri: On Demand Indexing for the DLV Instantiator   11:10 – 11:35 Geoffrey Chu, Christian Schulte and Peter Stuckey: Confidence based Work Stealing in Parallel Contraiate Programming
11:30 – 11:50 Claire Lefävre, Pascal Nicolas: Integrating Grounding in the Search Process for Answer Set Computing  
11:50 - 12:10 Uwe Egly, Sarah Gaggl, Stefan Woltran: Answer-Set Programming Encodings for Argumentations Frameworks   11:35 – 12:00 Beata Sarna-Starosta and Tom Schrijvers: An Efficient Term Representation for CHR Indexing
12:10 - 12:30 Joohyung Lee, Ravi Palla: Classical Logic Event Calculus as Answer Set Programming   12:00 – 12:25 Bart Demoen and Maria Garcia de la Banda: About Redundant Sudoku Rules
12:30 – 14:00 Lunch Break   Lunch Break  
    Sala Parlamento    
    Sala Convegni    
    Sala Atti    
    Sala Florio    
    Sala Colonne    
    Bar Caucigh