[TYPES] ICLP 2005: Call for Participation

ICLP 2005 iclp2005 at iiia.csic.es
Mon Jul 18 06:53:37 EDT 2005

Dear Colleague,

Please note that ICLP 2005 registration is now open. In fact, the
early registration deadline is not too far (July 31st). More details
can be found at the ICLP 2005 website:


Highlights include invited talks by Ian Horrocks, Peter Stuckey,
Francesca Rossi, a tutorial on "Inductive Logic Programmng,
Statistical Relational Learning and its applications" by Vitor Santos
Costa, contributed papers, posters, programming competition, panels,
conference workshops, and of course the Solar Eclipse that will take
place during the conference and will be visible in Barcelona (time has
been set aside during the conference to view the eclipse).

We look forward to seeing all of you in Barcelona.

Best wishes,

Gopal Gupta and Maurizio Gabbrielli


Full papers (26 papers)

Use of Logic Programming for Complex Business Rules
	Walter Wilson

Semantics of Framed Temporal Logic Programs
	Zhenhua Duan, Xiaoxiao Yang and Maciej Koutny.

On the relation between Answer Set and SAT procedures (or, between smodels and cmodels)
	Enrico Giunchiglia and Marco Maratea.

HYPROLOG: a new logic programming language with assumptions and abduction
	Henning Christiansen and Veronica Dahl.

A Generator of Efficient Abstract Machine Implementations and its Application to Emulator Minimization
	Jose Morales, Manuel Carro, German Puebla and Manuel Hermenegildo.

Nondeterminism Analysis of Functional Logic Programs
	Bernd Brabel and Michael Hanus.

Testing for Termination with Size Change Graphs
	Michael Codish, Vitaly Lagoon and Peter Stuckey.

Towards an Integration of Answer Set and Constraint Solving
	Sabrina Baselice, Piero A. Bonatti and Michael Gelfond.

Symbolic Support Graph: A Space Efficient Data Structure For Incremental Tabled Evaluation
	Diptikalyan Saha and C. R. Ramakrishnan.

Towards Implementations for Advanced Equivalence Checking in Answer-Set Programming
	Hans Tompits and Stefan Woltran.

Hybrid Probabilistic Logic Programs With Non-monotonic Negation
	Emad Saad and Enrico Pontelli.

Reducing Inductive Definitions to Propositional Satisfiability
	Nikolay Pelov and Eugenia Ternovska.

A Comparison of CLP(FD) and ASP Solutions to NP-Complete Problems
	Agostino Dovier, Andrea Formisano and Enrico Pontelli.

A  Well-Founded Semantics with Disjunction
	Joao Alcantara, Carlos Damasio and Luis Moniz Pereira.

An optimised Semantic Web query language implementation in Prolog
	Jan Wielemaker.

Practical Higher-Order Pattern Unification via On-the-Fly Raising
	Gopalan Nadathur and Natalie Linnell.

Dynamic Mixed-Strategy Evaluation of Tabled Logic Programs
	Ricardo Rocha, Fernando Silva and Vitor Santos Costa.

Small proof witnesses for LF
	Susmit Sarkar, Brigitte Pientka and Karl Crary.

Guard and Continuation Optimization for Occurrence Representations of CHR
	Jon Sneyers, Tom Schrijvers and Bart Demoen.

Abduction of Linear Arithmetic Constraints
	Michael Maher.

Coordination of Many Agents
	Joxan Jaffar, Roland Yap and Kenny Zhu.

Parallelizing Union-Find in Constraint Handling Rules Using Confluence
	Thom Fruehwirth.

Luca Bortolussi and Herbert Wiklicky.
	A Distributed and Probabilistic Concurrent Constraint Programming Language

Deductive Multi-valued Model Checking
	Ajay Mallya.

Techniques for Scaling Up Analyses Based on Pre-Interpretations
	John P. Gallagher, Kim Henriksen and Gourinath Banda.

Polynomial Interpretations as a Basis for Termination An
	Manh Thang Nguyen and Danny De Schreye.

Accepted posters (18 posters)

Inconsistency-based Strategy For Clarifying Vague Software Requirements
	Kedian Mu, Zhi Jin and Ruqian Lu.

A Type System for CHR
	Emmanuel Coquery and Francois Fages.

Decision Support for Personalization on Mobile Devices
	Thomas Kleemann and Alex Sinner.

Algorithms for FO(ID) model generation
	Maarten Marikn, Rudradeb Mitra and Marc Denecker.

Abstract Interpretation with Specialized Definitions
	German Puebla, Elvira Albert and Manuel Hermenegildo.

Induction of causal ramifications for action descriptions in ASP
	Ramon Otero.

The need for Ancestor Resolution when answering queries in Horn Clause Logic
	Oliver Ray.

Modeling Systems in CLP with Coinductive Tabling
	Joxan Jaffar, Andrew Edward Santosa and Razvan Voicu.

A Sufficient Condition for Strong Equivalence under the Well-Founded Semantics
	Chistos Nomikos, Panos Rondogiannis and William Wadge.

Analyses, Optimizations and Extensions of Constraint Handling Rules: Ph.D. Summary
	Tom Schrijvers.

IMPACT: Innovative Models for Prolog with Advanced Control and Tabling
	Ricardo Rocha, Ricardo Lopes, Fernando Silva and Vitor Santos Costa.

Using CLP to characterise linguistic lattice boundaries in a text mining process
	Alexandre Saidi.

Hybridization of Genetic Algorithms and Constraint Propagation for the BACP
	Tony Lambert, Carlos Castro, Eric Monfroy, Maria Cristina Riff and Fridiric Saubion.

The MYDDAS Project: Using a Deductive Database for Traffic Characterization
	Michel Ferreira.

Open World Reasoning in Datalog
	Gergely Lukacsy and Zsolt Nagy.

Optimizing Queries for Heterogeneous Information Sources
	Andras Gyvrgy Bikis.

Denotational semantics using Horn Concurrent Transaction Logic
	Marcus Santos.

Gentra4cp: a Generic Trace Format for Constraint Programming
	Ludovic Langevine and The OADymPPaC team.

More information about the Types-list mailing list