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 26 matches
- 1991
- Krzysztof R. Apt, Howard A. Blair:
Arithmetic classification of perfect models of stratified programs. Fundam. Informaticae 14(3): 339-343 (1991) - Tudor Balanescu, Marian Gheorghe:
A note on PF(k) - parsable languages. Fundam. Informaticae 14(3): 283-286 (1991) - Stefano Baratella:
Models of Clark's completion for some classes of logic programs. Fundam. Informaticae 14(3): 323-337 (1991) - Rana Barua:
On generalized automata. Fundam. Informaticae 14(3): 313-322 (1991) - Bernd Becker, Uwe Sparmann:
A uniform test approach for RCC-adders. Fundam. Informaticae 14(2): 185-219 (1991) - Andrzej Blikle:
Three-valued predicates for software specification and validation. Fundam. Informaticae 14(4): 387-410 (1991) - Stephen D. Comer:
An algebraic approach to the approximation of information. Fundam. Informaticae 14(4): 495-502 (1991) - Philippe Darondeau, Pierpaolo Degano:
About semantic action refinement. Fundam. Informaticae 14(2): 221-234 (1991) - Hendrik Jan Hoogeboom, Grzegorz Rozenberg:
Diamond properties of elementary net systems. Fundam. Informaticae 14(3): 287-300 (1991) - Andrzej Jankowski, Zbigniew Michalewicz:
Closed sets of Boolean terms in relational databases. Fundam. Informaticae 14(3): 367-385 (1991) - Michael Kaminski:
Embedding a default system into nonmonotonic logics. Fundam. Informaticae 14(3): 345-353 (1991) - N. W. Keesmaat, H. C. M. Kleijn, Grzegorz Rozenberg:
Vector controlled concurrent systems, part II: comparisons. Fundam. Informaticae 14(1): 1-38 (1991) - Beata Konikowska, Andrzej Tarlecki, Andrzej Blikle:
A three-valued logic for software specification and validation. Fundam. Informaticae 14(4): 411-453 (1991) - Waldemar Korczynski:
An axiomatic characterization of a class of Petri Nets. Fundam. Informaticae 14(4): 477-491 (1991) - Maciej Koutny:
Axiom system induced by CTL* Logic. Fundam. Informaticae 14(2): 235-253 (1991) - Fred Kröger, Stephan Merz:
Temporal logic and recursion. Fundam. Informaticae 14(2): 261-281 (1991) - Rita Loogen, Ursula Goltz:
Modelling nondeterministic concurrent processes with event structures. Fundam. Informaticae 14(1): 39-74 (1991) - Andrea Maggiolo-Schettini, G. Michele Pinna, Józef Winkowski:
A compositional semantics for unmarked predicate/transition nets. Fundam. Informaticae 14(1): 109-128 (1991) - Erkki Mäkinen:
A hierarchy of context-free derivations. Fundam. Informaticae 14(2): 255-259 (1991) - Miroslav Novotný, Zdzislaw Pawlak:
Algebraic theory of independence in information systems. Fundam. Informaticae 14(4): 454-476 (1991) - Zbigniew Stachniak:
Minimization of resolution proof systems. Fundam. Informaticae 14(1): 129-146 (1991) - Jaroslaw Stepaniuk:
Applications of finite models properties in approximation and algorithmic logics. Fundam. Informaticae 14(1): 91-108 (1991) - Stefka Stoeva:
On processing of fuzzy production systems. Fundam. Informaticae 14(3): 301-312 (1991) - Miroslaw Truszczynski:
Modal nonmonotonic logic with restricted application of the negation as failure to prove rule. Fundam. Informaticae 14(3): 355-366 (1991) - K. Vidyasankar:
Unified theory of database serializability. Fundam. Informaticae 14(2): 147-183 (1991) - Pawel Wlaz:
On uniqueness of the Wulff shape for cellular automata. Fundam. Informaticae 14(1): 75-90 (1991)
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 2025-01-10 19:13 CET 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