Остановите войну!
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 57 matches
- 2023
- Reijo Jaakkola:
Complexity of Polyadic Boolean Modal Logics: Model Checking and Satisfiability. CSL 2023: 26:1-26:18 - 2022
- Reijo Jaakkola:
Complexity of Polyadic Boolean Modal Logics: Model Checking and Satisfiability. CoRR abs/2210.01034 (2022) - 2021
- Mario Alviano, Sotiris Batsakis, George Baryannis:
Modal Logic S5 Satisfiability in Answer Set Programming. Theory Pract. Log. Program. 21(5): 527-542 (2021) - Rajeev Goré, Cormac Kikkert:
CEGAR-Tableaux: Improved Modal Satisfiability via Modal Clause-Learning and SAT. TABLEAUX 2021: 74-91 - Roberto Sebastiani, Armando Tacchella:
SAT Techniques for Modal and Description Logics. Handbook of Satisfiability 2021: 1223-1266 - Mario Alviano, Sotiris Batsakis, George Baryannis:
Modal Logic S5 Satisfiability in Answer Set Programming. CoRR abs/2108.04194 (2021) - 2020
- Lauri Hella, Antti Kuusisto, Arne Meier, Heribert Vollmer:
Satisfiability of Modal Inclusion Logic: Lax and Strict Semantics. ACM Trans. Comput. Log. 21(1): 7:1-7:18 (2020) - Yakoub Salhi:
On satisfiability problem in modal logic S5. SAC 2020: 948-955 - 2019
- Pei Huang, Minghao Liu, Ping Wang, Wenhui Zhang, Feifei Ma, Jian Zhang:
Solving the Satisfiability Problem of Modal Logic S5 Guided by Graph Coloring. IJCAI 2019: 1093-1100 - 2018
- Valentin Montmirail:
Practical resolution of satisfiability testing for modal logics. (Résolution pratique du test de cohérence en logiques modales). Artois University, Arras, France, 2018 - Jakub Michaliszyn, Jan Otop, Piotr Witkowski:
Satisfiability versus Finite Satisfiability in Elementary Modal Logics. Fundam. Informaticae 163(2): 165-188 (2018) - 2017
- Thomas Caridroit, Jean-Marie Lagniez, Daniel Le Berre, Tiago de Lima, Valentin Montmirail:
A SAT-Based Approach for Solving the Modal Logic S5-Satisfiability Problem. AAAI 2017: 3864-3870 - Robert A. Kowalski:
Satisfiability for First-order Logic as a Non-Modal Deontic Logic. Bridging@CogSci 2017: 84-90 - Jean-Marie Lagniez, Daniel Le Berre, Tiago de Lima, Valentin Montmirail:
A Recursive Shortcut for CEGAR: Application To The Modal Logic K Satisfiability Problem. IJCAI 2017: 674-680 - 2015
- Carlos Areces, Pascal Fontaine, Stephan Merz:
Modal Satisfiability via SMT Solving. Software, Services, and Systems 2015: 30-45 - Lauri Hella, Antti Kuusisto, Arne Meier, Heribert Vollmer:
Satisfiability of Modal Inclusion Logic: Lax and Strict Semantics. CoRR abs/1504.06409 (2015) - 2014
- Valentin Goranko, Steen Vester:
Optimal Decision Procedures for Satisfiability in Fragments of Alternating-time Temporal Logics. Advances in Modal Logic 2014: 234-253 - Benjamin Aminof, Aniello Murano, Sasha Rubin:
Satisfiability and Model Checking of CTL* with Graded Path Modalities. CoRR abs/1410.7551 (2014) - Roberto Sebastiani, Michele Vescovi:
Automated Reasoning in Modal and Description Logics via SAT Encoding: the Case Study of K(m)/ALC-Satisfiability. CoRR abs/1401.3463 (2014) - 2013
- Domenico Cantone, Marianna Nicolosi Asmundo:
On the Satisfiability Problem for a 4-level Quantified Syllogistic and Some Applications to Modal Logic. Fundam. Informaticae 124(4): 427-448 (2013) - Michal Zawidzki, Renate A. Schmidt, Dmitry Tishkovsky:
Satisfiability problem for modal logic with global counting operators coded in binary is NExpTime-complete. Inf. Process. Lett. 113(1-2): 34-38 (2013) - M. Praveen:
Does Treewidth Help in Modal Satisfiability? ACM Trans. Comput. Log. 14(3): 18:1-18:32 (2013) - 2012
- Antonis Achilleos, Michael Lampis, Valia Mitsou:
Parameterized Modal Satisfiability. Algorithmica 64(1): 38-55 (2012) - Jakub Michaliszyn, Emanuel Kieronski:
Finite Satisfiability of Modal Logic over Horn~Definable Classes of Frames. Advances in Modal Logic 2012: 464-482 - Yakoub Salhi, Saïd Jabbour, Lakhdar Sais:
Graded Modal Logic GS5 and Itemset Support Satisfiability. ISIP 2012: 131-140 - Jakub Michaliszyn, Jan Otop, Piotr Witkowski:
Satisfiability vs. Finite Satisfiability in Elementary Modal Logics. GandALF 2012: 141-154 - Domenico Cantone, Marianna Nicolosi Asmundo:
On the satisfiability problem for a 4-level quantified syllogistic and some applications to modal logic (extended version). CoRR abs/1209.1943 (2012) - 2011
- Domenico Cantone, Marianna Nicolosi Asmundo:
On the satisfiability problem for a 4-level quantified syllogistic and some applications to modal logic. CILC 2011: 73-97 - 2010
- Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor:
Generalized modal satisfiability. J. Comput. Syst. Sci. 76(7): 561-578 (2010) - Antonis Achilleos, Michael Lampis, Valia Mitsou:
Parameterized Modal Satisfiability. ICALP (2) 2010: 369-380
skipping 27 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-05-21 13:46 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