:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Schirrmacher, Nicole, Siebertz, Sebastian, Stamoulis, Giannos, Thilikos, Dimitrios M., Vigny, Alexandre
Formato:	Preprint
Publicado:	2023
Materias:	Logic in Computer Science
Acceso en línea:	https://arxiv.org/abs/2302.07033
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Model Checking for Low Monodimensionality Fragments of CMSO on Topological-Minor-Free Graph Classes
por: Sau, Ignasi, et al.
Publicado: (2026)

Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes
por: Golovach, Petr A., et al.
Publicado: (2022)

Advances in Algorithmic Meta Theorems
por: Siebertz, Sebastian, et al.
Publicado: (2024)

Parameterizing the quantification of CMSO: model checking on minor-closed graph classes
por: Sau, Ignasi, et al.
Publicado: (2024)

A Note on Constructive Canonical Splitter Strategies in Nowhere Dense Graph Classes
por: Fuchser, Janne, et al.
Publicado: (2025)

Existential Positive Transductions of Sparse Graphs
por: Mählmann, Nikolas, et al.
Publicado: (2026)

A Logic-based Algorithmic Meta-Theorem for Treedepth: Single Exponential FPT Time and Polynomial Space
por: Bergougnoux, Benjamin, et al.
Publicado: (2025)

Elimination Distance to Dominated Clusters
por: Schirrmacher, Nicole, et al.
Publicado: (2025)

Low rank MSO
por: Bojańczyk, Mikołaj, et al.
Publicado: (2025)

Elementary first-order model checking for sparse graphs
por: Gajarský, Jakub, et al.
Publicado: (2024)

Weighted Treedepth is NP-complete on Graphs of Bounded Degree
por: Dirks, Jona, et al.
Publicado: (2025)

On the generalized coloring numbers
por: Siebertz, Sebastian
Publicado: (2025)

Equilibrium Semantics and Strong Equivalence for Higher-Order Logic Programs
por: Charalambidis, Angelos, et al.
Publicado: (2026)

Minor Containment and Disjoint Paths in almost-linear time
por: Korhonen, Tuukka, et al.
Publicado: (2024)

Decomposition horizons and a characterization of stable hereditary classes of graphs
por: Braunfeld, Samuel, et al.
Publicado: (2022)

On first-order transductions of classes of graphs
por: Braunfeld, Samuel, et al.
Publicado: (2022)

Catching Rats in $H$-minor-free Graphs
por: Gorsky, Maximilian, et al.
Publicado: (2025)

Characterizing Sets of Theories That Can Be Disjointly Combined
por: Przybocki, Benjamin, et al.
Publicado: (2025)

Parikh Automata on Finite and Infinite Words
por: Grobler, Mario, et al.
Publicado: (2023)

Model Checking Linear Temporal Logic with Standpoint Modalities
por: Aghamov, Rajab, et al.
Publicado: (2025)

Hybrid Spatiotemporal Logic for Automotive Applications: Modeling and Model-Checking
por: Tulcan, Radu-Florin, et al.
Publicado: (2026)

Characterizations of monadically dependent tree-ordered weakly sparse structures
por: Buffière, Hector, et al.
Publicado: (2026)

Model Checking Logical Actions in Magic Tricks
por: Zhu, Weijun
Publicado: (2024)

A more accurate view of the Flat Wall Theorem
por: Ignasi Sau, et al.
Publicado: (2024)

Distribution-Free Normal Modal Logics
por: Hartonas, Chrysafis
Publicado: (2024)

Checking Satisfiability of Hyperproperties using First-Order Logic
por: Beutner, Raven, et al.
Publicado: (2025)

Yeo's Theorem for Locally Colored Graphs: the Path to Sequentialization in Linear Logic
por: Di Guardia, Rémi, et al.
Publicado: (2026)

Enriching Ontologies with Disjointness Axioms using Large Language Models
por: Crum, Elias, et al.
Publicado: (2024)

Loop-Checking and Counter-Model Extraction for Intuitionistic Tense Logics via Nested Sequents
por: Lyon, Tim S.
Publicado: (2026)

Normalisation for Negative Free Logics without and with Definite Descriptions
por: Kürbis, Nils
Publicado: (2024)

Logic of Fuzzy Paths
por: Grover, Kush, et al.
Publicado: (2026)

Policies Grow on Trees: Model Checking Families of MDPs
por: Andriushchenko, Roman, et al.
Publicado: (2024)

Disjoint Partial Enumeration without Blocking Clauses
por: Spallitta, Giuseppe, et al.
Publicado: (2023)

Distribution-Free Modal Logics: Sahlqvist -- Van Benthem Correspondence
por: Chrysafis, et al.
Publicado: (2025)

A Cut-free Sequent Calculus for Basic Intuitionistic Dynamic Topological Logic
por: Tabatabai, Amirhossein Akbar, et al.
Publicado: (2025)

Faster parameterized algorithms for modification problems to minor-closed classes
por: Morelle, Laure, et al.
Publicado: (2022)

Complexity of the Model Checking problem for inquisitive propositional and modal logic
por: Grilletti, Gianluca, et al.
Publicado: (2024)

Model Checking Matrix Product States against Linear Chain Logic
por: Xu, Ming, et al.
Publicado: (2026)

On merge-models
por: Buffière, Hector, et al.
Publicado: (2026)

Checking Continuous Stochastic Logic against Quantum Continuous-Time Markov Chains
por: Xu, Ming, et al.
Publicado: (2022)