Остановите войну!
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 17 matches
- 1997
- Dmitry A. Archangelsky, Mikhail A. Taitslin:
A Logic for Information Systems. Stud Logica 58(1): 3-16 (1997) - Salem Benferhat, Didier Dubois, Henri Prade:
Some Syntactic Approaches to the Handling of Inconsistent Knowledge Bases: A Comparative Study Part 1: The Flat Case. Stud Logica 58(1): 17-45 (1997) - Gianpiero Cattaneo:
Generalized Rough Sets (Preclusivity Fuzzy-Intuitionistic (BZ) Lattices). Stud Logica 58(1): 47-77 (1997) - Roberto Cignoli, Daniele Mundici:
An Elementary Proof of Chang's Completeness Theorem for the Infinite-valued Calculus of Lukasiewicz. Stud Logica 58(1): 79-97 (1997) - Stéphane Demri:
A Completeness Proof for a Logic with an Alternative Necessity Operator. Stud Logica 58(1): 99-112 (1997) - Raimon Elgueta:
Characterization Classes Defined without Equality. Stud Logica 58(3): 357-394 (1997) - Anna Gomolinska:
A Nonmonotonic Modal Formalization of the Logic of Acceptance and Rejection. Stud Logica 58(1): 113-127 (1997) - Petr Hájek:
Fuzzy Logic and Arithmetical Hierarchy, II. Stud Logica 58(1): 129-141 (1997) - Chrysafis Hartonas:
Duality for Lattice-Ordered Algebras and for Normal Algebraizable Logics. Stud Logica 58(3): 403-450 (1997) - Burghard Herrmann:
Characterizing Equivalential and Algebraizable Logics by the Leibniz Operator. Stud Logica 58(2): 305-323 (1997) - Eiko Isoda:
Kripke Bundle Semantics and C-set Semantics. Stud Logica 58(3): 395-401 (1997) - Mamoru Kaneko, Takashi Nagashima:
Game Logic and its Applications II. Stud Logica 58(2): 273-303 (1997) - Adam Kolany:
Consequence Operations Based on Hypergraph Satisfiability. Stud Logica 58(2): 261-272 (1997) - Henryk Jan Komorowski, Lech Polkowski, Andrzej Skowron:
Towards a Rough Mereology-Based Logic for Approximate Solution Synthesis. Part 1. Stud Logica 58(1): 143-184 (1997) - Beata Konikowska:
A Logic for Reasoning about Relative Similarity. Stud Logica 58(1): 185-226 (1997) - Jacek Marciniec:
Infinite Set Unification with Application to Categorial Grammar. Stud Logica 58(3): 339-355 (1997) - Frank Wolter:
Superintuitionistic Companions of Classical Modal Logics. Stud Logica 58(2): 229-259 (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-27 17:41 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