default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 23 matches
- 2001
- Roberto Bagnara, Roberta Gori, Patricia M. Hill, Enea Zaffanella:
Finite-tree analysis for constraint logic-based languages. APPIA-GULP-PRODE 2001: 63-79 - Roberto Bagnara, Enea Zaffanella, Roberta Gori, Patricia M. Hill:
Boolean functions for finite-tree dependencies. APPIA-GULP-PRODE 2001: 81-96 - Gilles Barthe, Blas C. Ruiz Jiménez:
Tipos principales y cierre semi-completo para sistemas de tipos puros extendidos (trabajo en desarrollo). APPIA-GULP-PRODE 2001: 149-163 - Frank S. de Boer, Maurizio Gabbrielli, Maria Chiara Meo:
Proving correctness of timed concurrent constraint programs. APPIA-GULP-PRODE 2001: 213-228 - Marco Comini, Roberta Gori, Giorgio Levi:
How to transform an analyzer into a verifier. APPIA-GULP-PRODE 2001: 131-148 - Giorgio Delzanno, Maurizio Martelli:
An embedding of calculi for negation as failure into linear logic. APPIA-GULP-PRODE 2001: 165-179 - Agostino Dovier, Andrea Formisano, Eugenio G. Omodeo:
Decidability results for sets with atoms. APPIA-GULP-PRODE 2001: 245-259 - Agostino Dovier, Carla Piazza, Gianfranco Rossi:
Multiset constraints and P systems. APPIA-GULP-PRODE 2001: 97-112 - Maribel Fernández, Ian Mackie, Jorge Sousa Pinto:
Combining interaction nets with externally defined programs. APPIA-GULP-PRODE 2001: 297-312 - 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. APPIA-GULP-PRODE 2001: 31-45 - Samir Genaim, Michael Codish:
Inferring termination conditions for logic programs using backwards analysis. APPIA-GULP-PRODE 2001: 229-243 - Gianluigi Greco, Sergio Greco, Ester Zumpano:
Deterministic semantics for disjunctive logic programs. APPIA-GULP-PRODE 2001: 17-30 - João Alexandre Leite, José Júlio Alferes, Luís Moniz Pereira:
Combining societal agents' knowledge. APPIA-GULP-PRODE 2001: 313-327 - Francisco José Galán Morillo, José Miguel Cañete Valdeón:
Folding by similarity. APPIA-GULP-PRODE 2001: 181-195 - Fernando Orejas, Edelmira Pasarella, Elvira Pino:
Semantics of normal logic programs with embedded implications. APPIA-GULP-PRODE 2001: 1-15 - Carla Piazza, Alberto Policriti:
Deciding modal logics using tableaux and set theory. APPIA-GULP-PRODE 2001: 261-276 - Alessandra Di Pierro, Herbert Wiklicky:
Quantum constraint programming. APPIA-GULP-PRODE 2001: 113-130 - Isabel Pita, Narciso Martí-Oliet:
Proving modal and temporal properties of rewriting logic programs. APPIA-GULP-PRODE 2001: 277-295 - 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. APPIA-GULP-PRODE 2001: 329-341 - João Saraiva, Pablo R. Azero Alcocer:
Component-based Programming for Attribute Grammars. APPIA-GULP-PRODE 2001: 343-358 - Fausto Spoto:
Logic programs as abstract domains. APPIA-GULP-PRODE 2001: 197-211 - Tarmo Uustalu:
(Co)monads from inductive and coinductive types (Extended Abstract). APPIA-GULP-PRODE 2001: 47-61 - 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 [contents]
loading more results
failed to load more results, please try again later
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-10-06 00:27 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint