![](https://dblp.uni-trier.de./img/logo.320x120.png)
![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 22 matches
- 2010
- Roman Barták
, Daniel Toropila:
Solving Sequential Planning Problems via Constraint Satisfaction. Fundam. Informaticae 99(2): 125-145 (2010) - Salem Benferhat, Didier Dubois, Henri Prade, Mary-Anne Williams
:
A Framework for Iterated Belief Revision Using Possibilistic Counterparts to Jeffrey's Rule. Fundam. Informaticae 99(2): 147-168 (2010) - Jan A. Bergstra, Cornelis A. Middelburg
:
An Interface Group for Process Components. Fundam. Informaticae 99(4): 355-382 (2010) - Stephen L. Bloom, Zoltán Ésik:
Algebraic Ordinals. Fundam. Informaticae 99(4): 383-407 (2010) - Sebastian Deorowicz
:
Bit-Parallel Algorithm for the Constrained Longest Common Subsequence Problem. Fundam. Informaticae 99(4): 409-433 (2010) - Yassine Djouadi, Henri Prade:
Interval-Valued Fuzzy Galois Connections: Algebraic Requirements and Concept Lattice Construction. Fundam. Informaticae 99(2): 169-186 (2010) - Floriana Esposito
, Claudia d'Amato
, Nicola Fanizzi
:
Fuzzy Clustering for Semantic Knowledge Bases. Fundam. Informaticae 99(2): 187-205 (2010) - Irina Georgescu
:
Arrow Index of a Fuzzy Choice Function. Fundam. Informaticae 99(3): 245-261 (2010) - Tao-Yuan Jen, Dominique Laurent, Nicolas Spyratos:
Computing Supports of Conjunctive Queries on Relational Tables with Functional Dependencies. Fundam. Informaticae 99(3): 263-292 (2010) - Feng Jiang, Yuefei Sui, Cungen Cao:
Relational Contexts and Relational Concepts. Fundam. Informaticae 99(3): 293-314 (2010) - Mona Khare, Surabhi Tiwari:
Grill Determined L-Approach Merotopological Spaces. Fundam. Informaticae 99(1): 1-12 (2010) - Jiming Liu, Chao Gao, Ning Zhong:
Autonomy-Oriented Search in Dynamic Community Networks: A Case Study in Decentralized Network Immunization. Fundam. Informaticae 99(2): 207-226 (2010) - Subhashis Majumder, Subhas C. Nandy, Bhargab B. Bhattacharya:
Separating Multi-Color Points on a Plane with Fewest Axis-Parallel Lines. Fundam. Informaticae 99(3): 315-324 (2010) - Tomás Masopust
:
Bounded Number of Parallel Productions in Scattered Context Grammars with Three Nonterminals. Fundam. Informaticae 99(4): 473-480 (2010) - Ujjwal Maulik
, Anasua Sarkar
:
Evolutionary Rough Parallel Multi-Objective Optimization Algorithm. Fundam. Informaticae 99(1): 13-27 (2010) - Liesbeth De Mol:
Solvability of the Halting and Reachability Problem for Binary 2-tag Systems. Fundam. Informaticae 99(4): 435-471 (2010) - Neil V. Murray, Erik Rosenthal:
Identifying Prime Implicate Branches in Reduced Implicate Tries. Fundam. Informaticae 99(2): 227-243 (2010) - Alexander Okhotin
:
On the State Complexity of Scattered Substrings and Superstrings. Fundam. Informaticae 99(3): 325-338 (2010) - Fernando Orejas
, Hartmut Ehrig, Markus Klein, Julia Padberg, Elvira Pino, Sonia Pérez:
A Generic Approach to Connector Architectures Part I: The General Framework. Fundam. Informaticae 99(1): 63-93 (2010) - Fernando Orejas
, Hartmut Ehrig, Markus Klein, Julia Padberg, Elvira Pino, Sonia Pérez:
A Generic Approach to Connector Architectures Part II: Instantiation to Petri Nets and CSP. Fundam. Informaticae 99(1): 95-124 (2010) - Bohdan Rytsar, Piotr Romanowski, Adrian Shvay:
Set-theoretical Constructions of Boolean Functions and theirs Applications in Logic Synthesis. Fundam. Informaticae 99(3): 339-354 (2010) - Pedro Pablo Pérez Velasco, Juan de Lara
:
Matrix Graph Grammars with Application Conditions. Fundam. Informaticae 99(1): 29-62 (2010)
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 2025-02-16 22:07 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