Cover Image

Foundations for an Abstract Proof Theory in the Context of Horn Rules

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Lyon, Tim S., Ostropolski-Nalewaja, Piotr
Format:	Preprint
Published:	2023
Subjects:	Logic in Computer Science Discrete Mathematics Data Structures and Algorithms Logic
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Decidability of Querying First-Order Theories via Countermodels of Finite Width
by: Feller, Thomas, et al.
Published: (2023)

Flipper games for monadically stable graph classes
by: Gajarský, Jakub, et al.
Published: (2023)

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

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

CNFs and DNFs with Exactly $k$ Solutions
by: Chandran, L. Sunil, et al.
Published: (2025)

The Iteration Number of the Weisfeiler-Leman Algorithm
by: Grohe, Martin, et al.
Published: (2023)

Compressing CFI Graphs and Lower Bounds for the Weisfeiler-Leman Refinements
by: Grohe, Martin, et al.
Published: (2023)

Formal Primal-Dual Algorithm Analysis
by: Abdulaziz, Mohammad, et al.
Published: (2026)

Color Refinement for Relational Structures
by: Scheidt, Benjamin, et al.
Published: (2024)

On classes of bounded tree rank, their interpretations, and efficient sparsification
by: Gajarský, Jakub, et al.
Published: (2024)

Beyond Value Iteration for Parity Games: Strategy Iteration with Universal Trees
by: Koh, Zhuan Khye, et al.
Published: (2021)

Solving Partial Dominating Set and Related Problems Using Twin-Width
by: Balabán, Jakub, et al.
Published: (2025)

SDPs and Robust Satisfiability of Promise CSP
by: Brakensiek, Joshua, et al.
Published: (2022)

Maintaining $\mathsf{CMSO}_2$ properties on dynamic structures with bounded feedback vertex number
by: Majewski, Konrad, et al.
Published: (2021)

Homomorphism Indistinguishability, Multiplicity Automata Equivalence, and Polynomial Identity Testing
by: Černý, Marek, et al.
Published: (2025)

Decidability of Quasi-Dense Modal Logics
by: Ostropolski-Nalewaja, Piotr, et al.
Published: (2024)

Merge-width and First-Order Model Checking
by: Dreier, Jan, et al.
Published: (2025)

Graph classes through the lens of logic
by: Pilipczuk, Michał
Published: (2025)

On Numbers of Simplicial Walks and Equivalent Canonizations for Graph Recognition
by: Černý, Marek
Published: (2026)

Smaller Circuits for Bit Addition
by: Goncharov, Mikhail, et al.
Published: (2025)

SAT Encoding of Partial Ordering Models for Graph Coloring Problems
by: Faber, Daniel, et al.
Published: (2024)

Nested Sequents for Intuitionistic Grammar Logics via Structural Refinement
by: Lyon, Tim S.
Published: (2022)

Redundancy Is All You Need (for CSP Sparsification)
by: Brakensiek, Joshua, et al.
Published: (2024)

From Width-Based Model Checking to Width-Based Automated Theorem Proving
by: Oliveira, Mateus de Oliveira, et al.
Published: (2022)

A Customized SAT-based Solver for Graph Coloring
by: Brand, Timo, et al.
Published: (2025)

On the entailment problem for DL-Lite$_{core}$ ontologies and conjunctive queries with negation
by: Marcinkowski, Jerzy, et al.
Published: (2025)

The Sticky Path to Expressive Querying: Decidability of Navigational Queries under Existential Rules
by: Ostropolski-Nalewaja, Piotr, et al.
Published: (2024)

On the Subspace Orbit Problem and the Simultaneous Skolem Problem
by: Bacik, Piotr, et al.
Published: (2026)

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

Logic-based analogical proportions
by: Antić, Christian
Published: (2024)

Exact Exploration
by: Blass, Andreas, et al.
Published: (2024)

Learning Foundations Beneath the Stars
by: Cardone, Felice, et al.
Published: (2026)

Lower Bounds on Inverse Cellular Automata via Proof Complexity
by: Kapytka, Maryia
Published: (2026)

Algorithms and Complexity of Difference Logic
by: Dabrowski, Konrad K., et al.
Published: (2024)

Subgraph Isomorphism: Prolog vs. Conventional
by: Yin, Claire Y., et al.
Published: (2025)

The Sherali-Adams and Weisfeiler-Leman hierarchies in (Promise Valued) Constraint Satisfaction Problems
by: Barto, Libor, et al.
Published: (2024)

Efficient Coalgebraic Partition Refinement
by: Dorsch, Ulrich, et al.
Published: (2017)

Derivation and Verification of Array Sorting by Merging, and its Certification in Dafny
by: Carbonell, Juan Pablo, et al.
Published: (2025)

Model checking with temporal graphs and their derivative
by: Bui-Xuan, Binh-Minh, et al.
Published: (2026)

MSO Queries on Trees: Enumerating Answers under Updates Using Forest Algebras
by: Kleest-Meißner, Sarah, et al.
Published: (2022)