Остановите войну!
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 15 matches
- 2001
- Elvira Albert, Germán Vidal:
Symbolic Profiling for Multi-paradigm Declarative Languages. LOPSTR 2001: 148-167 - José Júlio Alferes, Antonio Brogi, João Alexandre Leite, Luís Moniz Pereira:
Computing Environment-Aware Agent Behaviours with Logic Program Updates. LOPSTR 2001: 216-232 - James L. Caldwell:
Extracting General Recursive Program Schemes in Nuprl's Type Theory. LOPSTR 2001: 233-244 - Giorgio Delzanno, Sandro Etalle:
Proof Theory, Transformations, and Logic Programming for Debugging Security Protocols. LOPSTR 2001: 76-90 - Mauro Ferrari, Camillo Fiorentini, Mario Ornaghi:
Extracting Exact Time Bounds from Logical Proofs. LOPSTR 2001: 245-266 - Sébastien Ferré, Olivier Ridoux:
A Framework for Developing Embeddable Customized Logics. LOPSTR 2001: 191-215 - Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti:
Verification of Sets of Infinite State Processes Using Program Transformation. LOPSTR 2001: 111-128 - Kazuhiko Kakehi, Robert Glück, Yoshihiko Futamura:
On Deforesting Parameters of Accumulating Maps. LOPSTR 2001: 46-56 - Kung-Kiu Lau, Mario Ornaghi:
Correct Object-Oriented Systems in Computational Logic. LOPSTR 2001: 168-190 - Michael Leuschel, Stefan Gruner:
Abstract Conjunctive Partial Deduction Using Regular Types and Its Application to Model Checking. LOPSTR 2001: 91-110 - Mauricio Osorio, Juan Antonio Navarro Pérez, José Arrazola:
Equivalence in Answer Set Programming. LOPSTR 2001: 57-75 - Petros Potikas, Panos Rondogiannis, Manolis Gergatsoulis:
A Transformation Technique for Datalog Programs Based on Non-deterministic Constructs. LOPSTR 2001: 25-45 - Natarajan Shankar:
Static Analysis for Safe Destructive Updates in a Functional Language. LOPSTR 2001: 1-24 - Wim Vanhoof, Maurice Bruynooghe:
When Size Does Matter. LOPSTR 2001: 129-147 - Alberto Pettorossi:
Logic Based Program Synthesis and Transformation, 11th International Workshop, LOPSTR 2001, Paphos, Cyprus, November 28-30, 2001, Selected Papers. Lecture Notes in Computer Science 2372, Springer 2001, ISBN 3-540-43915-3 [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-05-24 13:34 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