![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
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 43 matches
- 1997
- Sergei N. Artëmov, Jennifer M. Davoren, Anil Nerode:
Topological Semantics for Hybrid Systems. LFCS 1997: 1-8 - Gilles Barthe, Morten Heine Sørensen:
Domain-Free Pure Type Systems. LFCS 1997: 9-20 - Oleg V. Belegradek, Alexei P. Stolboushkin, Michael A. Taitslin:
Generic Queries over Quasy-o-minimal Domains. LFCS 1997: 21-32 - Michael A. Bukatin
, Joshua S. Scott:
Towards Computing Distances Between Programs via Scott Domains. LFCS 1997: 33-43 - Peter Clote:
A Safe Recursion Scheme for Exponential Time. LFCS 1997: 44-52 - Bruno Courcelle:
Finite Model Theory, Universal Algebra and Graph Grammars. LFCS 1997: 53-55 - Evgeny Dantsin
, Andrei Voronkov:
Complexity of Query Answering in Logic Databases with Complex Values. LFCS 1997: 56-66 - Michael I. Dekhtyar, Alexander Ja. Dikovsky:
Recognition of Deductive Data Base Stability. LFCS 1997: 67-77 - Sergey M. Dudakov
:
The Concurrency Complexity for the Horn Fragment of Linear Logic. LFCS 1997: 78-87 - Valery Durnev:
Studying Algorithmic Problems for Free Semi-groups and Groups. LFCS 1997: 88-101 - Rusins Freivalds, Gints Tervits, Rolf Wiehagen, Carl H. Smith:
Learning Small Programs with Additional Information. LFCS 1997: 102-112 - Michael Gavrilovich:
Cut Elimination for the Second Order Propositional Logic with Hilbert's epsilon-symbol, Extensionality, and Full Comprehension. LFCS 1997: 113-118 - Mikhail Golovanov:
Finite Bases of Admissible Rules for the Logic S52C. LFCS 1997: 119-129 - Philippe de Groote:
An Algebraic Correctness Criterion for Intuitionistic Proof-Nets. LFCS 1997: 130-140 - David Harel:
Towards a Theory of Recursive Structures (extended abstract). LFCS 1997: 141-144 - Bernhard Heinemann:
On the Complexity of Prefix Formulas in Modal Logic of Subset Spaces. LFCS 1997: 145-155 - Alexey P. Kopylov:
The Undecidability of Second Order Linear Affine Logic. LFCS 1997: 156-166 - Vladimir Krupski:
Operational Logic of Proofs with Functionality Condition on Proof Predicate. LFCS 1997: 167-177 - Alexei Lisitsa, Vladimir Yu. Sazonov:
On Linear Ordering of Strongly Extensional Finitely-Branching Graphs and Non-well-founded Sets. LFCS 1997: 178-188 - G. S. Makanin, Habib Abdulrab, Pavel Goralcik:
Functions for the General Solution of Parametric Word Equations. LFCS 1997: 189-202 - Evgeny Makarov:
A Proof Procedure for Hereditary Harrop Formulas with Free Equality. LFCS 1997: 203-213 - V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel:
Basic Forward Chaining Construction for Logic Programs. LFCS 1997: 214-225 - Maurice Margenstern:
Decidability and Undecidability of the Halting Problem on Turing Machines, a Survey. LFCS 1997: 226-236 - Jean-Yves Marion:
Case Study: Additive Linear Logic and Lattices. LFCS 1997: 237-247 - Yuri V. Matiyasevich:
Some Decision Problems for Traces. LFCS 1997: 248-257 - Grigori Mints:
Existential Instantiation and Strong Normalization. LFCS 1997: 258-265 - Alexey Mkrtychev:
Models for the Logic of Proofs. LFCS 1997: 266-275 - Ulrich Nitsche:
Interpretation of the Full Computation Tree Logic CTL* on Sets of Infinite Sequences. LFCS 1997: 276-282 - Hitoshi Ohsaki, Aart Middeldorp:
Type Introduction for Equational Rewriting. LFCS 1997: 283-293 - Martin Otto:
Capturing Bisimulation-Invariant Ptime. LFCS 1997: 294-305
skipping 13 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-08-25 16:49 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