Остановите войну!
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 22 matches
- 2023
- Nacira Abbas, Alexandre Bazin, Jérôme David, Amedeo Napoli:
Discovery of link keys in resource description framework datasets based on pattern structures. Int. J. Approx. Reason. 161: 108978 (2023) - Marc Aiguier, Isabelle Bloch, Salim Nibouche, Ramón Pino Pérez:
Morpho-logic from a topos perspective - application to symbolic AI. Int. J. Approx. Reason. 161: 109011 (2023) - Gael Velasco Benito, Alejandro Sobrino-Cerdeiriña, Alberto José Bugarín Diz:
An empirically supported approach to the treatment of imprecision in vague reasoning. Int. J. Approx. Reason. 161: 108995 (2023) - Janneke H. Bolt:
Two generalizations of the semi-graphoid rule of probabilistic independence and more. Int. J. Approx. Reason. 161: 108985 (2023) - Tingquan Deng, Binghan Long, Weihua Xu, Yiyu Yao:
Adjunctive three-way concepts from positive and negative concepts in lattice-valued formal contexts. Int. J. Approx. Reason. 161: 108989 (2023) - Giorgos Flouris, Theodore Patkos, Antonis Bikakis, Alexandros Vassiliades, Nick Bassiliades, Dimitris Plexousakis:
Theoretical analysis and implementation of abstract argumentation frameworks with domain assignments. Int. J. Approx. Reason. 161: 108992 (2023) - José Luis García-Lapresta, Raquel González del Pozo:
Using scoring functions in a group decision-making procedure with heterogeneous experts and qualitative assessments. Int. J. Approx. Reason. 161: 109004 (2023) - Enrico Giudice, Jack Kuipers, Giusi Moffa:
The dual PC algorithm and the role of Gaussianity for structure learning of Bayesian networks. Int. J. Approx. Reason. 161: 108975 (2023) - Jouni Järvinen, Sándor Radeleczki:
Pseudo-Kleene algebras determined by rough sets. Int. J. Approx. Reason. 161: 108991 (2023) - Radim Jirousek, Václav Kratochvíl, Prakash P. Shenoy:
Computing the decomposable entropy of belief-function graphical models. Int. J. Approx. Reason. 161: 108984 (2023) - Chaitanya Joshi, Fabrizio Ruggeri:
On a class of prior distributions that accounts for uncertainty in the data. Int. J. Approx. Reason. 161: 108980 (2023) - Periklis Mantenoglou, Alexander Artikis, Georgios Paliouras:
Online event recognition over noisy data streams. Int. J. Approx. Reason. 161: 108993 (2023) - Vilém Novák, Petra Murinová:
Verification of validity of syllogisms with intermediate quantifiers is equivalent with checking Peterson's rules. Int. J. Approx. Reason. 161: 108994 (2023) - Davide Petturiti, Gabriele Stabile, Barbara Vantaggi:
Addressing ambiguity in randomized reinsurance stop-loss treaties using belief functions. Int. J. Approx. Reason. 161: 108986 (2023) - Johannes Rauh, Pradeep Kr. Banerjee, Eckehard Olbrich, Guido Montúfar, Jürgen Jost:
Continuity and additivity properties of information decompositions. Int. J. Approx. Reason. 161: 108979 (2023) - Luciano Sánchez, Nahuel Costa, José Otero, Inés Couso:
Physics-informed learning under epistemic uncertainty with an application to system health modeling. Int. J. Approx. Reason. 161: 108988 (2023) - Vikas Srivastava, Amar Kishor, Amit K. Singh:
Novel optimistic and pessimistic family of OWA operator with constant orness. Int. J. Approx. Reason. 161: 109006 (2023) - Guy De Tré, Milan Peelman, Jozo Dujmovic:
Logic reasoning under data veracity concerns. Int. J. Approx. Reason. 161: 108977 (2023) - Jirí Vomlel, Václav Kratochvíl, Frantisek Kratochvíl:
Structural learning of mixed noisy-OR Bayesian networks. Int. J. Approx. Reason. 161: 108990 (2023) - Tuan-Anh Vu, Sohaib Afifi, Eric Lefèvre, Frédéric Pichon:
Optimization problems with evidential linear objective. Int. J. Approx. Reason. 161: 108987 (2023) - Yiyu Yao, Jilin Yang:
Granular fuzzy sets and three-way approximations of fuzzy sets. Int. J. Approx. Reason. 161: 109003 (2023) - Xiaoyan Zhang, Yuyang Huang:
Optimal scale selection and knowledge discovery in generalized multi-scale decision tables. Int. J. Approx. Reason. 161: 108983 (2023)
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-13 17:06 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