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 89 matches
- 2024
- Balder ten Cate, Raoul Koudijs:
Characterising Modal Formulas with Examples. ACM Trans. Comput. Log. 25(2): 12:1-12:27 (2024) - Giovanni Pagliarini, Andrea Paradiso, Guido Sciavicco, Ionel Eduard Stan:
On Modal Logic Formulae Minimization. CILC 2024 - Myrthe S. C. Spronck, Bas Luttik, Tim A. C. Willemse:
Progress, Justness and Fairness in Modal μ-Calculus Formulae. CONCUR 2024: 38:1-38:22 - Jean Christoph Jung, Jedrzej Kolodziejski:
Modal Separability of Fixpoint Formulae. Description Logics 2024 - Jean Christoph Jung, Jedrzej Kolodziejski:
Modal Separability of Fixpoint Formulae. CoRR abs/2406.01497 (2024) - Myrthe S. C. Spronck, Bas Luttik, Tim A. C. Willemse:
Progress, Justness and Fairness in Modal μ-Calculus Formulae. CoRR abs/2407.08060 (2024) - 2023
- Mohammad Mahdi Nasiri, Amir Khaleghi, Kannan Govindan, Ali Bozorgi-Amiri:
Sustainable hierarchical multi-modal hub network design problem: bi-objective formulations and solution algorithms. Oper. Res. 23(2): 35 (2023) - Andrew L. Orekhov, Garrison L. H. Johnston, Nabil Simaan:
Task and Configuration Space Compliance of Continuum Robots via Lie Group and Modal Shape Formulations. IROS 2023: 590-597 - Giovanni Pagliarini, Andrea Paradiso, Sasha Rubin, Guido Sciavicco, Ionel Eduard Stan:
Heuristic Minimization Modulo Theory of Modal Decision Trees Class-Formulas. OVERLAY@AI*IA 2023: 49-53 - Balder ten Cate, Raoul Koudijs:
Characterising Modal Formulas with Examples. CoRR abs/2304.06646 (2023) - Andrew L. Orekhov, Garrison L. H. Johnston, Nabil Simaan:
Task and Configuration Space Compliance of Continuum Robots via Lie Group and Modal Shape Formulations. CoRR abs/2306.13155 (2023) - 2022
- Mauro Milella, Giovanni Pagliarini, Andrea Paradiso, Ionel Eduard Stan:
Multi-Models and Multi-Formulas Finite Model Checking for Modal Logic Formulas Induction. OVERLAY@AI*IA 2022: 81-85 - Balder ten Cate, Raoul Koudijs:
Characterising Modal Formulas with Examples. CoRR abs/2206.06049 (2022) - 2021
- Andrew Joseph McCarthy:
Modal Metatheory for Quantified Modal Logic, With and Without the Barcan Formulas. Notre Dame J. Formal Log. 62(2) (2021) - Cécilia Tarpau, Javier Cebeiro, Geneviève Rollet, Maï K. Nguyen, Laurent Dumas:
An analytical reconstruction formula with efficient implementation for a modality of Compton Scattering Tomography with translational geometry. CoRR abs/2112.01632 (2021) - 2020
- Nick Bezhanishvili:
Filtrations, canonical formulas, and axiomatizations of superintuitionistic and modal logics. AiML 2020: 5 - 2019
- Jin-Gyun Kim, Jaho Seo, Jae Hyuk Lim:
Novel modal methods for transient analysis with a reduced order model based on enhanced Craig-Bampton formulation. Appl. Math. Comput. 344-345: 30-45 (2019) - Wan J. Fokkink, Rob van Glabbeek, Bas Luttik:
Divide and congruence III: From decomposition of modal formulas to preservation of stability and divergence. Inf. Comput. 268 (2019) - Jesse Chan:
Skew-Symmetric Entropy Stable Modal Discontinuous Galerkin Formulations. J. Sci. Comput. 81(1): 459-485 (2019) - Lauri Hella, Miikka Vilander:
Formula size games for modal logic and μ-calculus. J. Log. Comput. 29(8): 1311-1344 (2019) - Sowjanya Modalavalasa, Upendra Kumar Sahoo, Ajit Kumar Sahoo, Sananda Kumar:
Diffusion Minimum Generalized Rank Norm Over Distributed Adaptive Networks: Formulation and Performance Analysis. IEEE Trans. Signal Inf. Process. over Networks 5(4): 669-683 (2019) - Wan J. Fokkink, Rob van Glabbeek, Bas Luttik:
Divide and Congruence III: From Decomposition of Modal Formulas to Preservation of Stability and Divergence. CoRR abs/1908.06550 (2019) - Lauri Hella, Miikka Vilander:
Formula size games for modal logic and μ-calculus. CoRR abs/1912.08715 (2019) - 2018
- Paul-André Melliès, Nicolas Tabareau, Christine Tasson:
An explicit formula for the free exponential modality of linear logic. Math. Struct. Comput. Sci. 28(7): 1253-1286 (2018) - 2017
- Wan J. Fokkink, Rob J. van Glabbeek:
Divide and congruence II: From decomposition of modal formulas to preservation of delay and weak bisimilarity. Inf. Comput. 257: 79-113 (2017) - 2016
- Lauri Hella, Miikka Vilander:
The succinctness of first-order logic over modal logic via a formula size game. Advances in Modal Logic 2016: 401-419 - Wan J. Fokkink, Rob J. van Glabbeek:
Divide and Congruence II: From Decomposition of Modal Formulas to Preservation of Delay and Weak Bisimilarity. CoRR abs/1604.07530 (2016) - Lauri Hella, Miikka Vilander:
The Succinctness of First-order Logic over Modal Logic via a Formula Size Game. CoRR abs/1604.07225 (2016) - 2015
- Cuicui Kang, Shengcai Liao, Yonghao He, Jian Wang, Wenjia Niu, Shiming Xiang, Chunhong Pan:
Cross-Modal Similarity Learning: A Low Rank Bilinear Formulation. CIKM 2015: 1251-1260 - Karoliina Lehtinen, Sandra Quickert:
Deciding the First Levels of the Modal mu Alternation Hierarchy by Formula Construction. CSL 2015: 457-471
skipping 59 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-09-22 00:27 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