default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAPPIA-GULP-PRODE 2001: Évora, Portgual
- Luís Moniz Pereira, Paulo Quaresma:
APPIA-GULP-PRODE 2001: Joint Conference on Declarative Programming, Évora, Portgual, September 26-28, 2001, Proceedings, Évora, Portugal, September 26-28, 2001. Departamento de Informática, Universidade de Évora 2001 - Fernando Orejas, Edelmira Pasarella, Elvira Pino:
Semantics of normal logic programs with embedded implications. 1-15 - Gianluigi Greco, Sergio Greco, Ester Zumpano:
Deterministic semantics for disjunctive logic programs. 17-30 - José Emilio Labra Gayo, Juan Manuel Cueva Lovelle, María Cándida Luengo Díez, Agustín Cernuda del Río:
Reusable monadic semantics of logic programs with arithmetic predicates. 31-45 - Tarmo Uustalu:
(Co)monads from inductive and coinductive types (Extended Abstract). 47-61 - Roberto Bagnara, Roberta Gori, Patricia M. Hill, Enea Zaffanella:
Finite-tree analysis for constraint logic-based languages. 63-79 - Roberto Bagnara, Enea Zaffanella, Roberta Gori, Patricia M. Hill:
Boolean functions for finite-tree dependencies. 81-96 - Agostino Dovier, Carla Piazza, Gianfranco Rossi:
Multiset constraints and P systems. 97-112 - Alessandra Di Pierro, Herbert Wiklicky:
Quantum constraint programming. 113-130 - Marco Comini, Roberta Gori, Giorgio Levi:
How to transform an analyzer into a verifier. 131-148 - Gilles Barthe, Blas C. Ruiz Jiménez:
Tipos principales y cierre semi-completo para sistemas de tipos puros extendidos (trabajo en desarrollo). 149-163 - Giorgio Delzanno, Maurizio Martelli:
An embedding of calculi for negation as failure into linear logic. 165-179 - Francisco José Galán Morillo, José Miguel Cañete Valdeón:
Folding by similarity. 181-195 - Fausto Spoto:
Logic programs as abstract domains. 197-211 - Frank S. de Boer, Maurizio Gabbrielli, Maria Chiara Meo:
Proving correctness of timed concurrent constraint programs. 213-228 - Samir Genaim, Michael Codish:
Inferring termination conditions for logic programs using backwards analysis. 229-243 - Agostino Dovier, Andrea Formisano, Eugenio G. Omodeo:
Decidability results for sets with atoms. 245-259 - Carla Piazza, Alberto Policriti:
Deciding modal logics using tableaux and set theory. 261-276 - Isabel Pita, Narciso Martí-Oliet:
Proving modal and temporal properties of rewriting logic programs. 277-295 - Maribel Fernández, Ian Mackie, Jorge Sousa Pinto:
Combining interaction nets with externally defined programs. 297-312 - João Alexandre Leite, José Júlio Alferes, Luís Moniz Pereira:
Combining societal agents' knowledge. 313-327 - Cèsar Ferri Ramírez, José Hernández-Orallo, María José Ramírez-Quintana:
AND/OR trees for the learning of functional logic programs. 329-341 - João Saraiva, Pablo R. Azero Alcocer:
Component-based Programming for Attribute Grammars. 343-358
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-04 22:07 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
