|
Accepted Papers
|
LOPSTR
(* denotes LOPSTR extended abstract)
- *Modular Logic Program Refinement
Robert Colvin, Ian Hayes, Paul Strooper
- *A Formal Framework for Synthesis and Verification of Logic Programs
Alessandro Avellone, Mauro Ferrari, Camillo Fiorentini
- *Protocols between Programs and Proofs
Iman Poernomo and John N. Crossley
Monday 24th July, 4.30 - 6.00
- Logic Program Synthesis in a Higher Order Setting
David Lacey, Julian Richardson, Alan Smaill
- *Higher-order Transformation of Logic Programs
Silvija Seres, Mike Spivey
- *On the Precision of Abstract Interpretations
Alessandra di Pierro, Herbert Wiklicky
Wednesday 26th July, 2.30 - 4.00
- *Non-transformational Termination Analysis of Logic Programs, based on General Term-orderings
Alexander Serebrenik, Danny De Schreye
- *Towards a Modular Binding-time analysis for Higher-order Mercury
Wim Vanhoof, Maurice Bruynooghe
- *A Model for Inter-module Analysis and Optimizing Compilation
F. Bueno, M. Garcia de la Banda, M. Hermenegildo, K. Marriott, G. Puebla, P. Stuckey
Wednesday 26th July, 4.30 - 6.00
- Coverability of Reset Petri Nets and other Well-Structured Transition Systems by Partial Deduction
Michael Leuschel, Helko Lehmann
- *Measuring the Effectiveness of Partial Evaluation
Elvira Albert, Sergio Antoy, German Vidal
- *Automated Strategies for Specializing Constraint Logic Programs
Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti
Thursday 27th July, 2.30 - 4.00
- *A Minimal Specification Language
Walter W. Wilson
- *The Lazy Functional Side of Logic Programming
Sandro Etalle, Jon Mountjoy
- Binary Speed up for Logic Programs
Jan Hruza, Petr Stepanek
Thursday 27th July, 4.30 - 6.00
- *Specifying Prolog Trace Models with a Continuation Semantics
Erwan Jahier, Mireille Ducasse, Olivier Ridoux
- A New Module System for Prolog
Daniel Cabeza, Manuel Hermenegildo
- *Prolog and Abduction 4 writing Garbage Collectors
Bart Demoen
Logic Programming: Theory and Extensions
- Partial Models of Extended Generalized Logic Programs
J.J. Alferes, H. Herre and L. Pereira
- Alternating Fixpoint Theory for Logic Programs with Priority
Kewen Wang, Lizhu Zhou and Fangzhen Lin
- Proving Failure in Functional Logic Programs
F.J. Lopez-Fraguas and J. Sanchez-Hernandez
Monday 24th July, 4.30 - 6.00
- Semantics of Input-Consuming Logic Programs
Annalisa Bossi, Sandro Etalle and Sabina Rossi
- A Denotational Semantics of Defeasible Logic
M.J. Maher
- Isoinitial Semantics for Logic Programs
Kung-Kiu Lau and Mario Ornaghi
Tuesday 25th July, 2.30 - 4.00
- Abstract Syntax for Variable Binders: An Overview
Dale Miller
- Goal-Directed Proof Search in Multiple-Conclusioned Intuitionistic Logic
James Harland, Tatjana Lutovac and Michael Winikoff
- Efficient EM Learning with Tabulation for Parameterized Logic Programs
Yoshitaka Kameya and Taisuke Sato
Tuesday 25th July, 4.30 - 5.30
- Model Generation Theorem Proving with Finite Interval Constraints
Reiner Haehnle, Ryuzo Hasegawa and Yasuyuki Shirai
- Combining Mobile Processes and Declarative Programming
Rachid Echahed and Wendelin Serwe
Constraints
- Representing Trees with Constraints
Ben Curry, Geraint A. Wiggins and Gillian Hayes
- Dominance Constraints with Set Operators
Denys Duchier and Joachim Niehren
- Better Communication for Tighter Cooperation
Petra Hofstedt
Monday 24th July, 4.30 - 6.00
- Arc Consistency Algorithms via Iterations of Subsumed Functions
Rosella Gennari
- AVAL: an Enumerative Method for SAT
Gilles Audemard, Belaid Benhamou and Pierre Siegel
- Constraint Logic Programming for Local and Symbolic Model-checking
Ulf Nilsson and Johan Lubcke
Tuesday 25th July, 2.30 - 4.00
- A CLP Framework for Computing Structural Test Data
Arnaud Gotlieb, Bernard Botella and Michel Rueher
- Modelling Digital Circuits Problems with Set Constraints
Francisco Azevedo and Pedro Barahona
- Promoting Constraints to First-Class Status
Tobias Mueller
Tuesday 25th July, 4.30 - 6.00
- Developing Finite Domain Constraints - A Data Model Approach
Kit-ying Hui and Peter M.D. Gray
- Concurrent Constraint Programming with Process Mobility
David Gilbert and Catuscia Palamidessi
- A System for Tabled Constraint Logic Programming
Baoqiu Cui and David S. Warren
Automated Deduction: Putting Theory into Practice
back to the top ...
- Finding Tractable Formulas in NNF
Edgar Altamirano and Gonzalo Escalada-Imaz
- The Taming of the (X)OR
Peter Baumgartner and Fabio Massacci
- On an Omega-Decidable Deductive Procedure for Non-Horn Sequents of a restricted FTL
Regimantas Pliuskevicius
Wednesday 26th July, 4.30 - 6.00
- Representing Object Code
Marco Benini
- Towards an Efficient Tableau Method for Boolean Circuit Satisfiability Checking
Tommi Junttila and Ilkka Niemela
- Certification of Compiler Optimizations Using Kleene Algebra with Tests
Maria-Cristina Patron and Dexter Kozen
Thursday 27th July, 2.30 - 4.00
- An Application of Model Building in a Resolution Decision Procedure for Guarded Formulas
Michael Dierkes
- Model Checking for Timed Logic Processes
Supratik Mukhopadhyay and Andreas Podelski
- Perfect Model Checking via Unfold/Fold Transformations
Alberto Pettorossi and Maurizio Proietti
Thursday 27th July, 4.30 - 6.00
- Automatic Derivation and Application of Induction Schemes for Mutually Recursive Functions
Richard J. Boulton and Konrad Slind
- Proof Planning with Multiple Strategies
Erica Melis and Andreas Meier
- The theory of Total Unary rpo is Decidable
Paliath Narendran and Michael Rusinowitch
Knowledge Representation and Non-monotonic Reasoning
- On the Problem of Computing the Well-founded Semantics
Zbigniew Lonc and Miroslaw Truszczynski
- Computing Equilibrium Models using Signed Formulas
David Pearce, Inmaculada P. de Guzman and Agustin Valverde
- Extending Classical Logic with Inductive Definitions
Marc Denecker
Wednesday 26th July, 4.30 - 6.00
- A Simple Characterization of Extended Abduction
Katsumi Inoue
- A New Equational Foundation for the Fluent Calculus
Hans-Peter Stoerr and Michael Thielscher
- Solving the Entailment Problem in the Fluent Calculus using Binary Decision Diagrams
Steffen Hoelldobler and Hans Peter Stoerr
Thursday 27th July, 2.30 - 4.00
- Decidability Results for the Propositional Fluent Calculus
Helko Lehmann and Michael Leuschel
- A Meta-logical Semantics for Features and Fluents Based on Compositional Operators over Normal Logic Programs
Vincenzo Pallotta
- Default Reasoning with Specificity
Phan Minh Dung and Tran Cao Son
Thursday 27th July, 4.30 - 6.00
- Planning under Incomplete Knowledge
Thomas Eiter, Wolfgang Faber, Nicola Leone, Gerald Pfeifer and Axel Polleres
- Wire Routing and Satisfiability Planning
Esra Erdem, Vladimir Lifschitz and Martin D. F. Wong
- Including Diagnostic Information in Configuration Models
Tommi Syrjanen
Friday 28th July, 9.00-10.00
- Comparing the Expressive Powers of Some Syntactically Restricted Classes of Logic Programs
Tomi Janhunen
- On Complexity of Updates Through Integrity Constraints
Michael Dekhtyar, Alexander Dikovsky and Sergey Dudakov
Friday 28th July, 10.30 - 12.00
- Computational Complexity of Planning Based on Partial Information About The System's Present and Past States
Chitta Baral, Le Chi Tuan, Raul Trejo and Vladik Kreinovich
- Smallest Equivalent Sets for Finite Propositional Formula Circumscription
Yves Moinard and Raymond Rolland
- A Semantics for Persistency in Propositional Dynamic Logic
Jan Broersen, Roel Wieringe and John-Jules Meyer
Logic Programming: Implementations and Applications
- Fluents: A Refactoring of Prolog for Uniform Reflection and Interoperation with External Objects
Paul Tarau
- So Many WAM Variations, So Little Time
Bart Demoen and Phuong-Lan Nguyen
Friday 28th July, 10.30 - 1.00
- A Module Based Analysis for Memory Reuse in Mercury
Nancy Mazur, Gerda Janssens and Maurice Bruynooghe
- Mode Checking in HAL
Maria Garcia de la Banda, Peter J. Stuckey, Warwick Harvey, and Kim Marriott
- The Impact of Cache Coherence Protocols on Parallel Logic Programming Systems
Ines C. Dutra, Vitor Santos Costa and Ricardo Bianchini
- Database Security by Logic Programming
Steve Barker
- A Deterministic Shift-Reduce Parser Generator for a Logic Programming Language
Chuck Liang
Friday 28th July, 2.30 - 4.00
- A Logic Programming Application for the Analysis of Spanish Verse
Pablo Gervas
- A Documentation Generator for (C)LP Systems
Manuel Hermenegildo
- Psychiatric Diagnosis from the Viewpoint of Computational Logic
Joseph Gartner, Terrance Swift, Allen Tien, Carlos Damasio, and Luis Moniz Pereira
DOOD
- Applications of Annotated Predicate Calculus to Querying Inconsistent Databases
Marcelo Arenas, Leopoldo Bertossi and Michael Kifer
- Querying Inconsistent Databases: Algorithms and Implementation
Alexander Celle and Leopoldo Bertossi
- On Verification in Logic Database Languages
Francesco Bonchi, Fosca Giannotti and Dino Pedreschi
Wednesday 26th July, 4.30 - 6.00
- Mining Minimal Non-Redundant Association Rules using Frequent Closed Itemsets
Yves Bastide, Nicolas Pasquier, Rafik Taouil, Gerd Stumme and Lotfi Lakhal
- Linearly bounded reformulations of conjunctive databases
Rada Chirkova and Michael R.Genesereth
- MuTACLP: a Language for Declarative GIS Analysis
Paolo Mancarella, Gianluca Nerbini, Alessandra Raffaeta' and Franco Turini
Thursday 27th July, 2.30 - 4.00
- Reasoning about Duplicate Elimination with Description Logic
Vitaliy L. Khizder, David Toman and Grant Weddell
- A File System Based on Concept Analysis
Sebastien Ferre and Olivier Ridoux
- A Semantic Approach for Schema Evolution and Versioning in Object-Oriented Databases
Enrico Franconi, Fabio Grandi and Federica Mandreoli
Thursday 27th July, 4.30 - 6.00
- SLDMagic -- The Real Magic (with Applications to Web Queries)
Stefan Brass
- FLORA: Implementing an Efficient DOOD System Using a Tabling Logic Engine
Guizhen Yang and Michael Kifer
- Design and Implementation of the Physical Layer in WebBases: The XRover Experience
Hasan Davulcu, Guizhen Yang, Michael Kifer and I.V. Ramakrishnan
Friday 28th July, 9.00 - 10.00
- A Dynamic Approach to Termination Analysis for Active Database Rules
James Bailey, Alexandra Poulovassilis and Pete Newson
- Constraint-Based Termination Analysis for Cyclic Active Database Rules
Saumya Debray and Timothy Hickey
Friday 28th July, 10.30 - 12.30
- A Formal Model for an Expressive Fragment of XSLT
Geert Jan Bex, Sebastian Maneth and Frank Neven
- On the Equivalence of XML Patterns
Peter T. Wood
- Querying XML Specified WWW Sites: Links and Recursion in XML-GL
Barbara Oliboni and Letizia Tanca
- A Heuristic Approach for Converting HTML Documents to XML Documents
Seung-Jin Lim and Yiu-Kai Ng
Friday 28th July, 2.30 - 3.30
- Specification of an Active Database System Application using Dynamic Relation Nets
Laurent Allain and Pascal Yim
- Invariance, Maintenance and other Declarative Objectives of Triggers -- a Formal Characterization of Active Databases
Mutsumi Nakamura and Chitta Baral
ILP
- A new algorithm for learning range restricted Horn expressions (extended abstract)
Arias and Khardon
- A logical database mining query language
De Raedt
- Theory Completion using Inverse Entailment
Muggleton and Bryant
Monday 24th July, 4.30 - 6.00
- A refinement operator for description logics
Badea and Nienhuys-Cheng
- Searching the subsumption lattice by a genetic algorithm
Nezhad and Muggleton
- Learning in hybrid knowledge bases including terminological and Horn clause components
Rouveirol and Ventos
Tuesday 25th July, 2.30 - 4.00
- Solving selection problems using preference relation based on Bayesian learning
Nakano and Inuzuka
- Extending K-means clustering to first-order representations
Kirsten and Wrobel
- Using ILP to improve planning in hierarchical reinforcement learning
Reid and Ryan
Tuesday 25th July, 4.30 - 6.00
- Poster session 1
Wednesday 26th July, 2.30 - 4.00
- Concurrent execution of optimal hypothesis search for inverse entailment
Ohwada, Nishiyama and Mizoguchi
- Inverse Entailment in Nonmonotonic logic programs
Sakama
- New conditions for the existence of a least generalization under relative subsumption
Yamamoto
Wednesday 26th July, 4.30 - 6.00
- ILPNet2 meeting
- Community meeting
Thursday 27th July, 2.30 - 4.00
- Executing query packs in ILP
Blockeel, Dehaspe, Demoen, Janssens, Ramon and Vandecasteele
- Induction of recursive theories in the normal ILP setting: Issues and solutions
Esposito, Malerba and Lisi
- A note on two simple transformations for improving the efficiency of an ILP system
Santos Costa, Srinivasan and Camacho
Thursday 27th July, 4.30 - 6.00
back to the top ...
- Poster session 2