Остановите войну!
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 16 matches
- 1997
- Francis Alexandre, Khaled Bsaïes:
A Methodology for Constructing Logic Programs. Fundam. Informaticae 29(3): 203-223 (1997) - Jos C. M. Baeten, Jan A. Bergstra:
Discrete Time Process Algebra: Absolute Time, Relative Time and Parametric Time. Fundam. Informaticae 29(1-2): 51-76 (1997) - Christel Baier, Mila E. Majster-Cederbaum:
How to Interpret and Establish Consistency Results for Semantics of Concurrent Programming Languages. Fundam. Informaticae 29(3): 225-256 (1997) - Piotr Dembinski:
Semantics of Times Concurrent Systems. Fundam. Informaticae 29(1-2): 27-50 (1997) - Ivo Düntsch, Günther Gediga:
Algebraic Aspects of Attribute Dependencies in Information Systems. Fundam. Informaticae 29(1-2): 119-133 (1997) - Uwe Egly:
On Definitional Transformations to Normal Form for Institionistic Logic. Fundam. Informaticae 29(1-2): 165-201 (1997) - Andrzej Ehrenfeucht, Grzegorz Rozenberg, Kai Salomaa:
Semantics of Nonsequential Tree-Based Computation Schemes. Fundam. Informaticae 29(4): 305-324 (1997) - Emanuela Fachini, Angelo Monti:
Chomsky Hierarchy and Systolic Y-Tree Automata. Fundam. Informaticae 29(4): 325-339 (1997) - Gian-Luigi Ferrari:
Atomicity and Concurrency Control in Process Calculi. Fundam. Informaticae 29(4): 341-368 (1997) - Günter Hotz, Gisela Pitsch:
On Using Semi-Dyck Sets to Analyse Coupled-Context-Free Languages. Fundam. Informaticae 29(1-2): 1-26 (1997) - Zbigniew Huzar, Jan Magott:
Syntax and Semantics of Real-Time and Performance Evaluation Extensions of Specification Language LOTOS. Fundam. Informaticae 29(1-2): 77-96 (1997) - Jouni Järvinen:
A Representation of Dependence Spaces and Some Basic Algorithms. Fundam. Informaticae 29(4): 369-382 (1997) - Sukhamay Kundu, Jianhua Chen:
A New Method of Circumscribing Beliefs: The Propositional Case. Fundam. Informaticae 29(4): 383-390 (1997) - Markus Mohnen:
A Compiler Correctness Proof for the Static Link Technique by Means of Evolving Algebras. Fundam. Informaticae 29(3): 257-303 (1997) - James F. Peters III:
Mechanization of Real-Time Linear CSP with Higher Order Logic. Fundam. Informaticae 29(1-2): 135-163 (1997) - Anthony Karel Seda:
Quasi-Metrics and the Semantics of Logic Programs. Fundam. Informaticae 29(1-2): 97-117 (1997)
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-04-24 05:48 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