Call for Papers
Topics
Manuscript Preparation
Important Dates
Hotel Information
Registration (Updated)
Accepted papers
Conference Program
Travel Information
Invited Talks by
Domenico Sacca
Terrance Swift
Relevant Links: Recent Editions:
Univ. of Évora
Évora (in Portuguese)
La Habana (Cu) - 00
L'Aquila (It) -
99
La Coruņa (Sp) - 98
Grado (It) - 97
APPIA-GULP-PRODE 2001
2001 JOINT CONFERENCE ON DECLARATIVE PROGRAMMING
Conference Program
9:00 -- 10:00: Registration
10:00 -- 10:30: Conference Opening
10:30 -- 11:00: Semantics of normal logic programs with embedded implications. F. Orejas, E. Pasarella, E. Pino
11:00 -- 11:30: Deterministic Semantics for Disjunctive Logic Programs. G. Greco, S. Greco, E. Zumpano.
11:30 -- 12:00: Reusable Monadic Semantics of Prolog-like Languages with Arithmetic Predicates. J. Labra Gayo, J. Lovelle, M. Díez, A. Cernuda del Rio.
12:00 -- 12:30: (Co)Monads from Inductive and Coinductive Types. T. Uustalu.
12:30 -- 14:00: Lunch
14:00 -- 15:00: Invited Talk -- Search queries in DATALOG: complexity and tractability. D. Sacca
15:00 -- 15:30: Coffee Break
15:30 -- 16:00: Finite-tree analysis for constraint logic-based languages. R. Bagnara, R. Gori, P. Hill, E. Zaffanella.
16:00 -- 16:30: Boolean functions for finite-tree dependencies. R. Bagnara, E. Zaffanella, R. Gori. P. Hill.
16:30 -- 17:00: Multiset constraints and P systems. A. Dovier, C. Piazza, G. Rossi.
17:00 -- 17:30: Quantum Constraint Programming. A. di Pierro, H. Wiklicky.
September, 27th
9:30 -- 10:00: How to transform an analyzer into a verifier. M. Comini, R. Gori, G. Levi.
10:00 -- 10:30: Tipos pricipales y cierre semi-completo para sistemas de tipos puros extendidos. G. Barthe, Blas Jiménez.
10:30 -- 11:00: An Embedding of Calculi for negation as failure into Linear Logic. G. Delzanno, M. Martelli.
11:00 -- 11:30: Coffee Break
11:30 -- 12:00: Folding by similarity. F. Galán, J. Cañete.
12:00 -- 12:30: Logic programs as abstract domains. F. Spoto.
12:30 -- 14:00: Lunch
14:00 -- 15:00: Invited Talk -- Using Tabling to Extend Prolog with Non-monotonic Constructs. T. Swift
15:00 -- 15:30: Coffee Break
15:30 -- 16:00: Proving correctness of Timed Concurrent Constraint Programs. F. de Boer, M .Gabbrielli, M. Meo.
16:00 -- 16:30: Inferring Termination Conditions for Logic Programs using Backwards Analysis. S. Genaim, M. Codish.
16:30 -- 17:00: Decidability results for sets with atoms. A. Dovier, A. Formisano, E. Omodeo.
17:00 -- 17:30: Deciding Modal Logics using Tableaux and Set Theory. C. Piazza, A. Polieriti.
19:00 -- Conference dinner -- Herdade do Esporão
September, 28th
9:30 -- 10:00: Proving modal and temporal properties of rewriting logic programs. I. Pita, N. Martí-Oliet
10:00 -- 10:30: Combining interaction nets with externally defined programs. M. Fernández, I. Mackie, J. Pinto.
10:30 -- 11:00: Combining Societal Agents Knowledge. J. Leite, J. Alferes, L. Pereira.
11:00 -- 11:30: Coffee Break
11:30 -- 12:00: AND/OR trees for the synthesis of functional logic programs. C. Ferri-Ramírez, J. Hernández-Orallo, M. Ramírez-Quintana.
12:00 -- 12:30: Component-based Programming for Attribute Grammars. João Saraiva, Pablo Azero.
12:30 -- 12:45: Conference Closing