Остановите войну!
for scientists:
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 19 matches
- 1993
- Kung-Kiu Lau, Tim Clement:
Logic Program Synthesis and Transformation, Proceedings of LOPSTR 92, International Workshop on Logic Program Synthesis and Transformation, University of Manchester, UK, 2-3 July 1992. Workshops in Computing, Springer 1993, ISBN 3-540-19806-7 [contents] - 1992
- Dmitri Boulanger, Maurice Bruynooghe:
Deriving Transformations for Logic Programs Using Abstract Interpretation. LOPSTR 1992: 99-117 - Bart Demoen:
On the Transformation of a Prolog Program to a More Efficient Binary Program. LOPSTR 1992: 242-252 - Laurent Fribourg, Hans Olsén:
A Unifying View of Structural Induction and Computation Induction for Logic Programs. LOPSTR 1992: 46-60 - John P. Gallagher, D. Andre de Waal:
Deletion of Redundant Unary Type Predicates from Logic Programs. LOPSTR 1992: 151-167 - Giuseppe De Giacomo:
Intensional Query Answering: An Application of Partial Evaluation. LOPSTR 1992: 132-150 - José André Jimènez-Martin, Julio Mariño-Carballo, Juan José Moreno-Navarro:
Efficient Compilation of Lazy Narrowing into Prolog. LOPSTR 1992: 253-270 - John Jones:
Applications of Unfolding in Prolog Programming. LOPSTR 1992: 184-198 - Ina Kraan, David A. Basin, Alan Bundy:
Logic Program Synthesis via Proof Planning. LOPSTR 1992: 1-14 - Evelina Lamma, Paola Mello:
A Rationalisation of the ATMS in Terms of Partial Evaluation. LOPSTR 1992: 118-131 - Carlos Loría-Sáenz:
Synthesis of Narrowing Programs. LOPSTR 1992: 30-45 - Torben Æ. Mogensen, Anders Bondorf:
Logimix: A Self-Applicable Partial Evaluator for Prolog. LOPSTR 1992: 214-227 - Daniele Nardi, Riccardo Rosati:
Deductive Synthesis of Programs for Query Answering. LOPSTR 1992: 15-29 - Gerd Neugebauer:
The LOPS Approach: A Transformational Point of View (Extended Abstract). LOPSTR 1992: 80-81 - Mario Ornaghi:
Proof Nets. LOPSTR 1992: 61-79 - Anne Parrain, Philippe Devienne, Patrick Lebègue:
Towards Optimization of Full Prolog Programs Guided by Abstract Interpretation. LOPSTR 1992: 228-241 - Steven D. Prestwich:
An Unfold Rule for Full Prolog. LOPSTR 1992: 199-213 - Maurizio Proietti, Alberto Pettorossi:
Best-first Strategies for Incremental Transformations of Logic Programs. LOPSTR 1992: 82-98 - Kristof Verschaetse, Stefaan Decorte, Danny De Schreye:
Automatic Termination Analysis. LOPSTR 1992: 168-183
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-05-23 07:59 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