24. ICLP 2008: Udine, Italy

Invited Talk

• Vítor Santos Costa:
  The Life of a Logic Programming System. 1-6
  

Special Session

• Tom Schrijvers, Bart Demoen:
  Uniting the Prolog Community. 7-8
  

Invited Tutorials

• Tom Schrijvers:
  Constraint Handling Rules. 9-10
  
• Angelo Montanari:
  Back to Interval Temporal Logics. 11-13
  
• Carla Piazza, Alberto Policriti:
  Systems Biology: Models and Logics. 14
  
• Peter W. O'Hearn:
  Separation Logic Tutorial. 15-21
  

20 Years of Stable Models Semantics Celebration

Invited Presentations

• Michael Gelfond, Jorge Lobo:
  Authorization and Obligation Policies in Dynamic Systems. 22-36
  
• Vladimir Lifschitz:
  Twelve Definitions of a Stable Model. 37-51
  
• David Pearce:
  Sixty Years of Stable Models. 52
  
• Nicola Leone, Wolfgang Faber:
  The DLV Project: A Tour from Theory and Research to Applications and Market. 53-68
  

Invited Position Presentations

• Chitta Baral:
  Using Answer Set Programming for Knowledge Representation and Reasoning: Future Directions. 69-70
  
• Marc Denecker, Joost Vennekens:
  Building a Knowledge Base System for an Integration of Logic Programming and Classical Logic. 71-76
  
• Thomas Eiter:
  SMS and ASP: Hype or TST?. 77-82
  
• Victor W. Marek:
  Quo Vadis Answer Set Programming? 83-87
  
• Ilkka Niemelä:
  Answer Set Programming without Unstratified Negation. 88-92
  
• Torsten Schaub:
  Here's the Beef: Answer Set Programming ! 93-98
  

Best Paper Awardees

• Michael Fink:
  Equivalences in Answer-Set Programming by Countermodels in the Logic of Here-and-There. 99-113
  
• Shay B. Cohen, Robert J. Simmons, Noah A. Smith:
  Dynamic Programming Algorithms as Products of Weighted Logic Programs. 114-129
  

Regular Papers

Applications I

• Martin Gebser, Torsten Schaub, Sven Thiele, Björn Usadel, Philippe Veber:
  Detecting Inconsistencies in Large Biological Networks with Answer Set Programming. 130-144
  
• Alessandra Mileo, Davide Merico, Roberto Bisiani:
  A Logic Programming Approach to Home Monitoring for Risk Prevention in Assisted Living. 145-159
  
• Georg Boenn, Martin Brain, Marina De Vos, John Fitch:
  Automatic Composition of Melodic and Harmonic Music by Answer Set Programming. 160-174
  

Algorithms, Systems, and Implementations I

• Angelika Kimmig, Vítor Santos Costa, Ricardo Rocha, Bart Demoen, Luc De Raedt:
  On the Efficient Execution of ProbLog Programs. 175-189
  
• Martin Gebser, Roland Kaminski, Benjamin Kaufmann, Max Ostrowski, Torsten Schaub, Sven Thiele:
  Engineering an Incremental ASP Solver. 190-205
  
• Rui Marques, Terrance Swift:
  Concurrent and Local Evaluation of Normal Programs. 206-222
  

Semantics and Foundations I

• Victor W. Marek, Jeffrey B. Remmel:
  On the Continuity of Gelfond-Lifschitz Operator and Other Applications of Proof-Theory in ASP. 223-237
  
• Joseph P. Near, William E. Byrd, Daniel P. Friedman:
  alpha-leanTAP: A Declarative Theorem Prover for First-Order Classical Logic. 238-252
  
• Alexis Saurin:
  Towards Ludics Programming: Interactive Proof Search. 253-268
  
• Luciano Caroprese, Miroslaw Truszczynski:
  Declarative Semantics for Active Integrity Constraints. 269-283
  

Analysis and Transformations

• Valerio Senni, Alberto Pettorossi, Maurizio Proietti:
  A Folding Algorithm for Eliminating Existential Variables from Constraint Logic Programs. 284-300
  
• Eric Trias, Jorge A. Navas, Elena S. Ackley, Stephanie Forrest, Manuel V. Hermenegildo:
  Negative Ternary Set-Sharing. 301-316
  
• María Alpuente, Santiago Escobar, José Iborra:
  Termination of Narrowing Using Dependency Pairs. 317-331
  
• Christian Schulte, Peter J. Stuckey:
  Dynamic Analysis of Bounds Versus Domain Propagation. 332-346
  

Semantics and Foundations II

• Guohua Liu, Jia-Huai You:
  Lparse Programs Revisited: Semantics and Representation of Aggregates. 347-361
  
• Jeroen Janssen, Stijn Heymans, Dirk Vermeir, Martine De Cock:
  Compiling Fuzzy Answer Set Programs to Fuzzy Propositional Theories. 362-376
  
• Yuliya Lierler:
  Abstract Answer Set Solvers. 377-391
  

Semantics and Foundations III

• Pedro Cabalar:
  Partial Functions and Equality in Answer Set Programming. 392-406
  
• Francesco Calimeri, Susanna Cozza, Giovambattista Ianni, Nicola Leone:
  Computable Functions in ASP: Theory and Implementation. 407-424
  
• Sabrina Baselice, Piero A. Bonatti:
  Composing Normal Programs with Function Symbols. 425-439
  

Applications II

• Marco Montali, Paolo Torroni, Marco Alberti, Federico Chesani, Marco Gavanelli, Evelina Lamma, Paola Mello:
  Verification from Declarative Specifications Using Logic Programming. 440-454
  
• Gergely Lukácsy, Péter Szeredi, Balázs Kádár:
  Prolog Based Description Logic Reasoning. 455-469
  
• Luca Benini, Davide Bertozzi, Michela Milano:
  Resource Management Policy Handling Multiple Use-Cases in MPSoC Platforms Using Constraint Programming. 470-484
  

CHRs and Extensions

• Peter Van Weert:
  Optimization of CHR Propagation Rules. 485-500
  
• Paolo Pilozzi, Danny De Schreye:
  Termination Analysis of CHR Revisited. 501-515
  
• Tom Schrijvers, Martin Sulzmann:
  Transactions in Constraint Handling Rules. 516-530
  
• Gregory J. Duck, Leslie De Koninck, Peter J. Stuckey:
  Cadmium: An Implementation of ACD Term Rewriting. 531-545
  

Semantics and Foundations IV

• David Pearce, Agustín Valverde:
  Quantified Equilibrium Logic and Foundations for Answer Set Programs. 546-560
  
• Jörg Pührer, Hans Tompits, Stefan Woltran:
  Elimination of Disjunction and Negation in Answer-Set Programs under Hyperequivalence. 561-575
  
• Miroslaw Truszczynski, Stefan Woltran:
  Relativized Hyperequivalence of Logic Programs for Modular Programming. 576-590
  
• Johannes Oetsch, Hans Tompits:
  Program Correspondence under the Answer-Set Semantics: The Non-ground Case. 591-605
  

Algorithms, Systems, and Implementations II

• Yuanlin Zhang, Roland H. C. Yap, Chendong Li, Satyanarayana Marisetti:
  Efficient Algorithms for Functional Constraints. 606-620
  
• Bart Demoen, Phuong-Lan Nguyen:
  Two WAM Implementations of Action Rules. 621-635
  
• Radoslaw Szymanek, Christophe Lecoutre:
  Constraint-Level Advice for Shaving. 636-650
  
• Amadeo Casas, Manuel Carro, Manuel V. Hermenegildo:
  A High-Level Implementation of Non-deterministic, Unrestricted, Independent And-Parallelism. 651-666
  

Short Papers

Semantics and Foundations

• Fabrizio Riguzzi:
  Inference with Logic Programs with Annotated Disjunctions under the Well Founded Semantics. 667-671
  
• Joohyung Lee, Vladimir Lifschitz, Ravi Palla:
  Safe Formulas in the General Theory of Stable Models (Preliminary Report). 672-676
  
• Jorge A. Pérez, Camilo Rueda:
  Non-determinism and Probabilities in Timed Concurrent Constraint Programming. 677-681
  
• Jesús Aranda, Jorge A. Pérez, Camilo Rueda, Frank D. Valencia:
  Stochastic Behavior and Explicit Discrete Time in Concurrent Constraint Programming. 682-686
  
• Stephen Muggleton, José Carlos Almeida Santos, Alireza Tamaddoni-Nezhad:
  TopLog: ILP Using a Logic Program Declarative Bias. 687-692
  

Implementations and Systems

• Tom Schrijvers, Vítor Santos Costa, Jan Wielemaker, Bart Demoen:
  Towards Typed Prolog. 693-697
  
• Bart Demoen, Phuong-Lan Nguyen:
  Environment Reuse in the WAM. 698-702
  
• Paul Tarau:
  Logic Engines as Interactors. 703-707
  
• Jorge Costa, Ricardo Rocha:
  Global Storing Mechanisms for Tabled Evaluation. 708-712
  
• Paulo Moura, Ricardo Rocha, Sara C. Madeira:
  Thread-Based Competitive Or-Parallelism. 713-717
  

Answer Set Programming and Extensions

• Francesco Buccafurri, Gianluca Caminiti, Rosario Laurendi:
  A Logic Language with Stable Model Semantics for Social Reasoning. 718-723
  
• Owen Cliffe, Marina De Vos, Martin Brain, Julian A. Padget:
  ASPVIZ: Declarative Visualisation and Animation Using Answer Set Programming. 724-728
  
• Tomi Janhunen:
  Removing Redundancy from Answer Set Programs. 729-733
  
• Uwe Egly, Sarah Alice Gaggl, Stefan Woltran:
  ASPARTIX: Implementing Argumentation Frameworks Using Answer-Set Programming. 734-738
  
• Han The Anh, Carroline D. P. Kencana Ramli, Carlos Viegas Damásio:
  An Implementation of Extended P-Log Using XASP. 739-743
  

Constraints, Optimizations, and Applications

• Raffaele Cipriano, Agostino Dovier, Jacopo Mauro:
  Compiling and Executing Declarative Modeling Languages to Gecode. 744-748
  
• Michael Codish, Vitaly Lagoon, Peter J. Stuckey:
  Telecommunications Feature Subscription as a Partial Order Constraint Problem. 749-753
  
• Hakim Belhaouari, Frédéric Peschanski:
  A Constraint Logic Programming Approach to Automated Testing. 754-758
  
• Jon Sneyers:
  Turing-Complete Subclasses of CHR. 759-763
  
• Stefano Bistarelli, Fabio Gadducci, Javier Larrosa, Emma Rollon:
  A Soft Approach to Multi-objective Optimization. 764-768
  

Applications

• Giulio Piancastelli, Andrea Omicini:
  A Multi-theory Logic Language for the World Wide Web. 769-773
  
• Sebastien Siva, James J. Lu, Hantao Zhang:
  A Case Study in Engineering SQL Constraint Database Systems (Extended Abstract). 774-778
  
• Piero A. Bonatti, Juri Luca De Coi, Daniel Olmedilla, Luigi Sauro:
  Policy-Driven Negotiations and Explanations: Exploiting Logic-Programming for Trust Management, Privacy & Security. 779-784
  

Analysis, Transformations, and Implementations

• Wim Vanhoof, François Degrave:
  An Algorithm for Sophisticated Code Matching in Logic Programs. 785-789
  
• Germán Vidal:
  Trace Analysis for Predicting the Effectiveness of Partial Evaluation. 790-794
  
• Pablo Chico de Guzmán, Manuel Carro, Manuel V. Hermenegildo:
  A Sketch of a Complete Scheme for Tabled Execution Based on Program Transformation. 795-800
  

Doctoral Consortium Presentations

• Romain Beauxis:
  Probabilistic and Concurrent Models for Security. 801-802
  
• Raffaele Cipriano:
  On the Hybridization of Constraint Programming and Local Search Techniques: Models and Software Tools. 803-804
  
• François Degrave:
  Development of an Automatic Testing Environment for Mercury. 805-806
  
• Giorgio Gosti:
  Resolving CSP with Naming Games. 807-808
  
• Ole Torp Lassen:
  Biosequence Analysis in PRISM. 809-810
  
• Fabio Parisini:
  Bi-dimensional Domains for the Non-overlapping Rectangles Constraint. 811-812
  
• Giovanni Pirrotta:
  Extracting and Reasoning about Web Data. 813-814
  
• Francesco Santini:
  Managing Quality of Service with Soft Constraints. 815-817
  
• José Carlos Almeida Santos:
  TopLog: ILP Using a Logic Program Declarative Bias. 818-819
  
• Markus Triska:
  Generalising Constraint Solving over Finite Domains. 820-821
  
• Aliaksei Tsitovich:
  Detection of Security Vulnerabilities Using Guided Model Checking. 822-823
  

Last update Sat May 18 14:33:43 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page