default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch 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 11 matches
- 2001
- Kung-Kiu Lau:
Logic Based Program Synthesis and Transformation, 10th International Workshop, LOPSTR 2000 London, UK, July 24-28, 2000, Selected Papers. Lecture Notes in Computer Science 2042, Springer 2001, ISBN 3-540-42127-0 [contents] - 2000
- Elvira Albert, Sergio Antoy, Germán Vidal
:
Measuring the Effectiveness of Partial Evaluation in Functional Logic Languages. LOPSTR (LNCS 2042: Selected Papers) 2000: 103-124 - Alessandro Avellone, Mauro Ferrari, Camillo Fiorentini:
A Formal Framework for Synthesis and Verification of Logic Programs. LOPSTR (LNCS 2042: Selected Papers) 2000: 1-17 - Francisco Bueno, Maria J. García de la Banda, Manuel V. Hermenegildo, Kim Marriott, Germán Puebla, Peter J. Stuckey:
A Model for Inter-module Analysis and Optimizing Compilation. LOPSTR (LNCS 2042: Selected Papers) 2000: 86-102 - Robert Colvin, Ian J. Hayes, Paul A. Strooper:
A Technique for Modular Logic Program Refinement. LOPSTR (LNCS 2042: Selected Papers) 2000: 38-56 - Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti:
Automated Strategies for Specializing Constraint Logic Programs. LOPSTR (LNCS 2042: Selected Papers) 2000: 125-146 - Erwan Jahier, Mireille Ducassé, Olivier Ridoux:
Specifying Prolog Trace Models with a Continuation Semantics. LOPSTR (LNCS 2042: Selected Papers) 2000: 165-182 - Alessandra Di Pierro, Herbert Wiklicky:
Measuring the Precision of Abstract Interpretations. LOPSTR (LNCS 2042: Selected Papers) 2000: 147-164 - Iman Poernomo, John N. Crossley:
Protocols between Programs and Proofs. LOPSTR (LNCS 2042: Selected Papers) 2000: 18-37 - Alexander Serebrenik, Danny De Schreye:
Non-transformational Termination Analysis of Logic Programs, Based on General Term-Orderings. LOPSTR (LNCS 2042: Selected Papers) 2000: 69-85 - Silvija Seres, J. Michael Spivey:
Higher-Order Transformation of Logic Programs. LOPSTR (LNCS 2042: Selected Papers) 2000: 57-68
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-12-20 15:22 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
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:
