Остановите войну!
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 31 matches
- 2000
- Elvira Albert, Michael Hanus, Germán Vidal:
Using an Abstract Representation to Specialize Functional Logic Programs. LPAR 2000: 381-398 - Matthias Baaz, Agata Ciabattoni, Richard Zach:
Quantified Propositional Gödel Logics. LPAR 2000: 240-256 - Roberto Bagnara, Patricia M. Hill, Enea Zaffanella:
Efficient Structural Information Analysis for Real CLP Languages. LPAR 2000: 189-206 - Gilles Barthe, Bernard P. Serpette:
Static Reduction Analysis for Imperative Object Oriented Languages. LPAR 2000: 344-361 - Cécile Canovas-Dumas, Paul Caspi:
A PVS Proof Obligation Generator for Lustre Programs. LPAR 2000: 179-188 - Bruno Courcelle:
Graph Operations and Monadic Second-Order Logic: A Survey. LPAR 2000: 20-24 - David Delahaye:
A Tactic Language for the System Coq. LPAR 2000: 85-95 - Thomas Eiter, Georg Gottlob:
On the Complexity of Theory Curbing. LPAR 2000: 1-19 - Christian G. Fermüller, Georg Moser:
Have Spass with OCC1Ng=. LPAR 2000: 114-130 - Roberta Gori:
An Abstract Interpretation Approach to Termination of Logic Programs. LPAR 2000: 362-380 - Erich Grädel:
Efficient Evaluation Methods for Guarded Logics and Datalog LITE. LPAR 2000: 417 - Sergio Greco, Ester Zumpano:
Querying Inconsistent Databases. LPAR 2000: 308-325 - Wolfgang Grieskamp, Markus Lepper:
Encoding Temporal Logics in Executable Z: A Case Study for the ZETA System. LPAR 2000: 43-53 - Philippe de Groote:
Proof-Search in Implicative Linear Logic as a Matching Problem. LPAR 2000: 257-274 - Jan Friso Groote, Jaco van de Pol:
Equational Binary Decision Diagrams. LPAR 2000: 161-178 - Thomas Hallgren, Aarne Ranta:
An Extensible Proof Text Editor. LPAR 2000: 70-84 - Steffen Hölldobler, Dietrich Kuske:
The Boundary between Decidable and Undecidable Fragments of the Fluent Calculus. LPAR 2000: 436-450 - Ian Horrocks, Ulrike Sattler, Sergio Tessaris, Stephan Tobies:
How to Decide Query Containment Under Constraints Using a Description Logic. LPAR 2000: 326-343 - Florent Jacquemard, Michaël Rusinowitch, Laurent Vigneron:
Compiling and Verifying Security Protocols. LPAR 2000: 131-160 - Miyuki Koshimura, Ryuzo Hasegawa:
Proof Simplification for Model Generation and Its Applications. LPAR 2000: 96-113 - Slawomir Lasota:
Behavioural Constructor Implementation for Regular Algebras. LPAR 2000: 54-69 - Helko Lehmann, Michael Leuschel:
Solving Planning Problems by Partial Deduction. LPAR 2000: 451-468 - Jean-Vincent Loddo, Roberto Di Cosmo:
Playing Logic Programs with the Alpha-Beta Algorithm. LPAR 2000: 207-224 - Jean-Yves Marion, Jean-Yves Moyen:
Efficient First Order Functional Program Interpreter with Time Bound Certifications. LPAR 2000: 25-42 - Nikolay Pelov, Emmanuel De Mot, Marc Denecker:
Logic Programming Approaches for Representing and Solving Constraint Satisfaction Problems: A Comparison. LPAR 2000: 225-239 - Ján Sefránek:
A Kripkean Semantics for Dynamic Logic Programming. LPAR 2000: 469-486 - Dieter Spreen:
A New Model Construction for the Polymorphic Lambda Calculus. LPAR 2000: 275-292 - Richard Statman:
Church's Lambda Delta Calculus. LPAR 2000: 293-307 - Jean-Marc Talbot:
On the Alternation-Free Horn Mu-calculus. LPAR 2000: 418-435 - Wim Vanhoof:
Binding-Time Analysis by Constraint Solving. A Modular and Higher-Order Approach for Mercury. LPAR 2000: 399-416
skipping 1 more match
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-20 20:35 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