Остановите войну!
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 134 matches
- 2024
- Gianluca Grilletti, Ivano Ciardelli:
Complexity of the Model Checking problem for inquisitive propositional and modal logic. CoRR abs/2403.14260 (2024) - 2023
- Gennady Shtakser:
A Modal Loosely Guarded Fragment of Second-Order Propositional Modal Logic. J. Log. Lang. Inf. 32(3): 511-538 (2023) - Mikhail N. Rybakov, Dmitry Shkatov:
Complexity function and complexity of validity of modal and superintuitionistic propositional logics. J. Log. Comput. 33(7): 1566-1595 (2023) - Zhiguang Zhao:
Sahlqvist correspondence theory for second-order propositional modal logic. J. Log. Comput. 33(3): 577-598 (2023) - Yifeng Ding:
Modal Logics with Non-rigid Propositional Designators. LORI 2023: 47-62 - 2022
- Bartosz Bednarczyk, Stéphane Demri:
Why Does Propositional Quantification Make Modal and Temporal Logics on Trees Robustly Hard? Log. Methods Comput. Sci. 18(3) (2022) - Takao Inoué:
On Blass Translation for Leśniewski's Propositional Ontology and Modal Logics. Stud Logica 110(1): 265-289 (2022) - Pere Pardo:
A Modal View on Resource-Bounded Propositional Logics. Stud Logica 110(4): 1035-1080 (2022) - Pere Pardo:
Correction to: A Modal View on Resource-Bounded Propositional Logics. Stud Logica 110(6): 1537-1538 (2022) - Mikhail N. Rybakov, Dmitry Shkatov:
Complexity of finite-variable fragments of propositional temporal and modal logics of computation. Theor. Comput. Sci. 925: 45-60 (2022) - John Rushby:
PVS Embeddings of Propositional and Quantified Modal Logic. CoRR abs/2205.06391 (2022) - 2021
- Matteo Tesi:
Labelled Sequent Calculi for Lewis' Non-normal Propositional Modal Logics. Stud Logica 109(4): 725-757 (2021) - Zhiguang Zhao:
Sahlqvist-type Correspondence Theory for Second-Order Propositional Modal Logic (Short Paper). SOQE@KR 2021: 112-121 - Eric Alsmann, Florian Bruse, Martin Lange:
Separating the Expressive Power of Propositional Dynamic and Modal Fixpoint Logics. EXPRESS/SOS 2021: 10-26 - Bartosz Bednarczyk, Stéphane Demri:
Why Propositional Quantification Makes Modal and Temporal Logics on Trees Robustly Hard? CoRR abs/2104.13122 (2021) - Zhiguang Zhao:
Sahlqvist Correspondence Theory for Second-Order Propositional Modal Logic. CoRR abs/2110.08561 (2021) - Jian Zhang:
On the Relational Translation Method for Propositional Modal Logics. CoRR abs/2112.14605 (2021) - 2020
- Taishi Kurahashi:
Uniform Lyndon interpolation property in propositional modal logics. Arch. Math. Log. 59(5-6): 659-678 (2020) - Marcelo E. Coniglio, Luis Fariñas del Cerro, Marques Peron Newton:
Modal logic with non-deterministic semantics: Part I - Propositional case. Log. J. IGPL 28(3): 281-315 (2020) - 2019
- Matteo Pascucci:
Propositional quantifiers in labelled natural deduction for normal modal logic. Log. J. IGPL 27(6): 865-894 (2019) - Mikhail N. Rybakov, Dmitry Shkatov:
Complexity of finite-variable fragments of propositional modal logics of symmetric frames. Log. J. IGPL 27(1): 60-68 (2019) - Miika Hannula:
Validity and Entailment in Modal and Propositional Dependence Logics. Log. Methods Comput. Sci. 15(2) (2019) - Giovanna D'Agostino:
Uniform interpolation for propositional and modal team logics. J. Log. Comput. 29(5): 785-802 (2019) - Lauri Hella, Antti Kuusisto, Arne Meier, Jonni Virtema:
Model checking and validity in propositional and modal inclusion logics. J. Log. Comput. 29(5): 605-630 (2019) - Anantha Padmanabha, R. Ramanujam:
The Monodic Fragment of Propositional Term Modal Logic. Stud Logica 107(3): 533-557 (2019) - Anantha Padmanabha, R. Ramanujam:
Propositional Modal Logic with Implicit Modal Quantification. ICLA 2019: 6-17 - Bartosz Bednarczyk, Stéphane Demri:
Why Propositional Quantification Makes Modal Logics on Trees Robustly Hard? LICS 2019: 1-13 - Bo Chen, Kang Zhao, Bing Zhang, Cheng Wu, Linlin Ma, Changhui Ma, Yuefei Sui:
The B5-Modalized Propositional Logic. SKG 2019: 161-166 - Mikhail N. Rybakov, Dmitry Shkatov:
Complexity of finite-variable fragments of propositional modal logics of symmetric frames. CoRR abs/1910.02257 (2019) - 2018
- Francesco Belardinelli, Wiebe van der Hoek, Louwe B. Kuijer:
Second-order propositional modal logic: Expressiveness and completeness results. Artif. Intell. 263: 3-45 (2018)
skipping 104 more matches
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-25 14:18 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