Complexity of Polyadic Boolean Modal Logics: Model Checking and Satisfiability (Englisch)
Freier Zugriff
- Neue Suche nach: Jaakkola, Reijo
- Weitere Informationen zu Jaakkola, Reijo:
- https://orcid.org/0000-0003-4714-4637
- Neue Suche nach: Jaakkola, Reijo
- Weitere Informationen zu Jaakkola, Reijo:
- https://orcid.org/0000-0003-4714-4637
- Neue Suche nach: Klin, Bartek
- Weitere Informationen zu Klin, Bartek:
- https://orcid.org/0000-0001-5793-7425
- Neue Suche nach: Pimentel, Elaine
- Weitere Informationen zu Pimentel, Elaine:
- https://orcid.org/0000-0002-7113-0801
In:
LIPIcs, Volume 252, CSL 2023
: 31st EACSL Annual Conference on Computer Science Logic (CSL 2023)
;
252
;
26:1-26:18
;
2023
-
ISBN:
-
ISSN:
- Aufsatz (Konferenz) / Elektronische Ressource
-
Titel:Complexity of Polyadic Boolean Modal Logics: Model Checking and Satisfiability
-
Beteiligte:Jaakkola, Reijo ( Autor:in ) / Klin, Bartek ( Herausgeber:in ) / Pimentel, Elaine ( Herausgeber:in )
-
Erschienen in:LIPIcs, Volume 252, CSL 2023 : 31st EACSL Annual Conference on Computer Science Logic (CSL 2023) ; 252 ; 26:1-26:18Leibniz International Proceedings in Informatics (LIPIcs) ; 252 ; 26:1-26:18
-
Verlag:
- Neue Suche nach: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
-
Erscheinungsdatum:01.02.2023
-
Format / Umfang:18 pages , 805505 byte
-
Anmerkungen:LIPIcs, Vol. 252, 31st EACSL Annual Conference on Computer Science Logic (CSL 2023), pages 26:1-26:18
-
ISBN:
-
ISSN:
-
DOI:
-
Medientyp:Aufsatz (Konferenz)
-
Format:Elektronische Ressource
-
Sprache:Englisch
-
Schlagwörter:
-
Lizenzbestimmungen:
-
Datenquelle:
Inhaltsverzeichnis Konferenzband
Die Inhaltsverzeichnisse werden automatisch erzeugt und basieren auf den im Index des TIB-Portals verfügbaren Einzelnachweisen der enthaltenen Beiträge. Die Anzeige der Inhaltsverzeichnisse kann daher unvollständig oder lückenhaft sein.
- 1
-
Asymptotic Rewriting (Invited Talk)Faggian, Claudia et al. | 2023
- 2
-
Inductive Inference and Epistemic Modal Logic (Invited Talk)Gierasimczuk, Nina et al. | 2023
- 3
-
A Positive Perspective on Term Representation (Invited Talk)Miller, Dale / Wu, Jui-Hsuan et al. | 2023
- 4
-
Enhanced Induction in Behavioural Relations (Invited Talk)Sangiorgi, Davide et al. | 2023
- 5
-
A Cyclic Proof System for Full Computation Tree LogicAfshari, Bahareh / Leigh, Graham E. / Menéndez Turata, Guillermo et al. | 2023
- 6
-
Functorial String Diagrams for Reverse-Mode Automatic DifferentiationAlvarez-Picallo, Mario / Ghica, Dan / Sprunger, David / Zanasi, Fabio et al. | 2023
- 7
-
A Lattice-Theoretical View of Strategy IterationBaldan, Paolo / Eggert, Richard / König, Barbara / Padoan, Tommaso et al. | 2023
- 8
-
Reductions in Higher-Order Rewriting and Their EquivalenceBarenbaum, Pablo / Bonelli, Eduardo et al. | 2023
- 9
-
Proofs and Refutations for Intuitionistic and Second-Order LogicBarenbaum, Pablo / Freund, Teodoro et al. | 2023
- 10
-
The Functional Machine Calculus II: SemanticsBarrett, Chris / Heijltjes, Willem / McCusker, Guy et al. | 2023
- 11
-
Degree Spectra, and Relative Acceptability of NotationsBazhenov, Nikolay / Kalociński, Dariusz et al. | 2023
- 12
-
Hennessy-Milner Theorems via Galois ConnectionsBeohar, Harsh / Gurke, Sebastian / König, Barbara / Messing, Karla et al. | 2023
- 13
-
A Curry-Howard Correspondence for Linear, Reversible ComputationChardonnet, Kostia / Saurin, Alexis / Valiron, Benoît et al. | 2023
- 14
-
Measure-Theoretic Semantics for Quantitative Parity AutomataCîrstea, Corina / Kupke, Clemens et al. | 2023
- 15
-
Realizing Continuity Using Stateful ComputationsCohen, Liron / Rahli, Vincent et al. | 2023
- 16
-
Non-Uniform Complexity via Non-Wellfounded ProofsCurzi, Gianluca / Das, Anupam et al. | 2023
- 17
-
Open Higher-Order LogicDal Lago, Ugo / Gavazzo, Francesco / Ghyselen, Alexis et al. | 2023
- 18
-
Frobenius Structures in Star-Autonomous Categoriesde Lacroix, Cédric / Santocanale, Luigi et al. | 2023
- 19
-
Translating Proofs from an Impredicative Type System to a Predicative OneFelicissimo, Thiago / Blanqui, Frédéric / Barnawal, Ashish Kumar et al. | 2023
- 20
-
A Normalized Edit Distance on Infinite WordsFisman, Dana / Grogin, Joshua / Weiss, Gera et al. | 2023
- 21
-
Constructive and Synthetic Reducibility Degrees: Post’s Problem for Many-One and Truth-Table Reducibility in CoqForster, Yannick / Jahn, Felix et al. | 2023
- 22
-
Quantitative Hennessy-Milner Theorems via Notions of DensityForster, Jonas / Goncharov, Sergey / Hofmann, Dirk / Nora, Pedro / Schröder, Lutz / Wild, Paul et al. | 2023
- 23
-
Order-Invariance in the Two-Variable Fragment of First-Order LogicGrange, Julien et al. | 2023
- 24
-
Explorable AutomataHazard, Emile / Kuperberg, Denis et al. | 2023
- 25
-
The Expressive Power of CSP-QuantifiersHella, Lauri et al. | 2023
- 26
-
Complexity of Polyadic Boolean Modal Logics: Model Checking and SatisfiabilityJaakkola, Reijo et al. | 2023
- 27
-
Complexity Classifications via Algebraic LogicJaakkola, Reijo / Kuusisto, Antti et al. | 2023
- 28
-
Counting and MatchingJacobs, Bart / Stein, Dario et al. | 2023
- 29
-
Evaluation Trade-Offs for Acyclic Conjunctive QueriesKara, Ahmet / Nikolic, Milos / Olteanu, Dan / Zhang, Haozhe et al. | 2023
- 30
-
Gödel’s Theorem Without Tears - Essential Incompleteness in Synthetic ComputabilityKirst, Dominik / Peters, Benjamin et al. | 2023
- 31
-
Finite Model Theory and Proof Complexity Revisited: Distinguishing Graphs in Choiceless Polynomial Time and the Extended Polynomial CalculusPago, Benedikt et al. | 2023
- 32
-
Adding Transitivity and Counting to the Fluted FragmentPratt-Hartmann, Ian / Tendera, Lidia et al. | 2023
- 33
-
Parity Games of Bounded Tree-DepthStaniszewski, Konrad et al. | 2023
- 34
-
Tower-Complete Problems in Contraction-Free Substructural LogicsTanaka, Hiromi et al. | 2023
- 35
-
Dynamic Complexity of Regular Languages: Big Changes, Small WorkTschirbs, Felix / Vortmeier, Nils / Zeume, Thomas et al. | 2023
- 36
-
Completeness of Sum-Over-Paths for Toffoli-Hadamard and the Dyadic Fragments of Quantum ComputationVilmart, Renaud et al. | 2023
- 37
-
String Diagrams for Non-Strict Monoidal CategoriesWilson, Paul / Ghica, Dan / Zanasi, Fabio et al. | 2023
- 38
-
Supported Sets - A New Foundation for Nominal Sets and AutomataWißmann, Thorsten et al. | 2023