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 15 matches
- 2001
- Gianluca Amato:
Correct Answers for First Order Logic. APPIA-GULP-PRODE 2001: 45-64 - Marco Bozzano, Giorgio Delzanno, Maurizio Martelli:
On the Relations between Disjunctive and Linear Logic Programming. APPIA-GULP-PRODE 2001: 65-89 - Antonio Brogi:
Probabilistic behaviours of reactive agents. APPIA-GULP-PRODE 2001: 227-252 - Marco Comini, Roberta Gori, Giorgio Levi:
Logic programs as specifications in the inductive verification of logic programs. APPIA-GULP-PRODE 2001: 131-146 - Agostino Cortesi, Sabina Rossi, Baudouin Le Charlier:
Operational Semantics for Reexecution-based Analysis of Logic Programs with Delay Declarations. APPIA-GULP-PRODE 2001: 29-44 - Agostino Dovier, Roberto Giacobazzi, Elisa Quintarelli:
Refining and Compressing Abstract Model Checking. APPIA-GULP-PRODE 2001: 90-107 - Agostino Dovier, Maria Chiara Meo, Andrea Omicini:
Preface. APPIA-GULP-PRODE 2001: 253-254 - Moreno Falaschi, Alberto Policriti, Alicia Villanueva:
Modeling concurrent systems specified in a temporal concurrent constraint language-I. APPIA-GULP-PRODE 2001: 197-210 - Lígia Ferreira, Salvador Abreu:
Design for AJACS, yet another Java constraint programming framework. APPIA-GULP-PRODE 2001: 167-178 - Andrea Formisano, Eugenio G. Omodeo, Marco Temperini:
Layered map reasoning: An experimental approach put to trial on sets. APPIA-GULP-PRODE 2001: 1-28 - Thom W. Frühwirth:
On the number of rule applications in constraint programs. APPIA-GULP-PRODE 2001: 147-166 - Andrea Omicini, Enrico Denti:
Formal ReSpecT. APPIA-GULP-PRODE 2001: 179-196 - Sascha Ossowski:
Constraint Based Coordination of Autonomous Agents. APPIA-GULP-PRODE 2001: 211-226 - Alessandra Di Pierro, Chris Hankin, Herbert Wiklicky:
Probabilistic confinement in a declarative framework. APPIA-GULP-PRODE 2001: 108-130 - 2000
- Agostino Dovier, Maria Chiara Meo, Andrea Omicini:
Declarative Programming - Selected Papers from AGP 2000, La Habana, Cuba, December 4-6, 2000. Electronic Notes in Theoretical Computer Science 48, Elsevier 2000 [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-11-02 19:31 CET 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