General Information
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:
Univ.
of Évora
Évora (in
Portuguese)
Recent Editions:
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
Accepted papers:
-
Semantics of normal logic programs with embedded
implications. F. Orejas, E. Pasarella, E. Pino
-
Proving modal and temporal properties of rewriting
logic programs. I. Pita, N. Martí-Oliet
-
Reusable Monadic Semantics of Logic Programs with
Arithmetic Predicates. J. Labra Gayo, J. Lovelle, M. Díez, A.
Cernuda del Rio.
-
Deciding Modal Logics using Tableaux and Set Theory.
C. Piazza, A. Polieriti.
-
Multiset constraints and P systems. A. Dovier,
C. Piazza, G. Rossi.
-
Component-based Programming for Attribute Grammars.
João Saraiva, Pablo Azero.
-
Folding by similarity. F. Galán, J. Cañete.
-
Logic programs as abstract domains. F. Spoto.
-
An Embedding of Calculi for negation as failure
into Linear Logic. G. Delzanno, M. Martelli.
-
Finite-tree analysis for constraint logic-based
languages. R. Bagnara, R. Gori, P. Hill, E. Zaffanella.
-
Boolean functions for finite-tree dependencies.
R. Bagnara, E. Zaffanella, R. Gori. P. Hill.
-
Inferring Termination Conditions for Logic Programs
using Backwards Analysis. S. Genaim, M. Codish.
-
Deterministic Semantics for Disjunctive Logic Programs.
G. Greco, S. Greco, E. Zumpano.
-
Quantum Constraint Programming. A. di Pierro,
H. Wiklicky.
-
How to transform an analyzer into a verifier.
M. Comini, R. Gori, G. Levi.
-
Decidability results for sets with atoms. A.
Dovier, A. Formisano, E. Omodeo.
-
AND/OR trees for the learning of functional logic
programs. C. Ferri-Ramírez, J. Hernández-Orallo, M. Ramírez-Quintana.
-
Combining interaction nets with externally defined
programs. M. Fernández, I. Mackie, J. Pinto.
-
(Co)Monads from Inductive and Coinductive Types.
T. Uustalu.
-
Combining Societal Agents' Knowledge. J. Leite,
J. Alferes, L. Pereira.
-
Tipos pricipales y cierre semi-completo para sistemas
de tipos puros extendidos. G. Barthe, Blas Jiménez.
-
Proving correctness of Timed Concurrent Constraint
Programs. F. de Boer, M .Gabbrielli, M. Meo.
|