Cover Image

Structure-Guided Automated Reasoning

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bannach, Max, Hecher, Markus
Format:	Preprint
Published:	2023
Subjects:	Logic in Computer Science Computational Complexity F.4.1; F.2.0
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A Theory for Probabilistic Polynomial-Time Reasoning
by: Chen, Lijie, et al.
Published: (2026)

Descriptive complexity for neural networks via Boolean networks
by: Ahvonen, Veeti, et al.
Published: (2023)

Neural networks as fuzzy logic formulas
by: Heiman, Damian, et al.
Published: (2026)

Constructibility and the P versus NP problem
by: Hole, Arne
Published: (2024)

Probabilistic Shoenfield Machines
by: Bujok, Maksymilian, et al.
Published: (2024)

Adversarial Barrier in Uniform Class Separation
by: Rosko, Milan
Published: (2025)

Polynomial-time Tractable Problems over the $p$-adic Numbers
by: Fehm, Arno, et al.
Published: (2025)

New Bounds for the Ideal Proof System in Positive Characteristic
by: Behera, Amik Raj, et al.
Published: (2025)

On the Satisfaction Probabilities of $k$-CNF Formulas
by: Tantau, Till
Published: (2022)

On the existence of strong proof complexity generators
by: Krajicek, Jan
Published: (2022)

Complexity of Nonassociative Lambek Calculus with classical logic
by: Płaczek, Paweł
Published: (2024)

Truth Predicate of Inductive Definitions and Logical Complexity of Infinite-Descent Proofs
by: Ito, Sohei, et al.
Published: (2026)

Expressive Power of Graph Transformers via Logic
by: Ahvonen, Veeti, et al.
Published: (2025)

Logical Characterizations of Recurrent Graph Neural Networks with Reals and Floats
by: Ahvonen, Veeti, et al.
Published: (2024)

Graph neural networks and MSO
by: Ahvonen, Veeti, et al.
Published: (2025)

Cross-Attention and Encoder-Decoder Transformers: A Logical Characterization
by: Ahvonen, Veeti, et al.
Published: (2026)

Deducibility in the full Lambek calculus with weakening is HAck-complete
by: Greati, Vitor, et al.
Published: (2024)

Hypersequent Calculi Have Ackermannian Complexity
by: Balasubramanian, A. R., et al.
Published: (2026)

A Theory of Hanoi Omega-Automata and Games
by: Filiot, Emmanuel, et al.
Published: (2026)

A Note on the Complexity of the Satisfiability Problem for Graded Modal Logics
by: Kazakov, Yevgeny, et al.
Published: (2009)

What If Turing Had Preceded Gödel?
by: Oberhoff, Sebastian
Published: (2024)

Graded modal logic and counting message passing automata
by: Ahvonen, Veeti, et al.
Published: (2024)

Extended Nullstellensatz proof systems
by: Krajicek, Jan
Published: (2023)

Set Theory in the Foundation of Math; Internal Classes and External Sets
by: Levin, Leonid A.
Published: (2022)

Data-Complexity of the Two-Variable Fragment with Counting Quantifiers
by: Pratt-Hartmann, Ian
Published: (2008)

On the Complexity of the Numerically Definite Syllogistic and Related Fragments
by: Pratt-Hartmann, Ian
Published: (2007)

On the formalization of the notion of an algorithm
by: Middelburg, C. A.
Published: (2024)

On the formalization of the notion of a concurrent algorithm
by: Middelburg, C. A.
Published: (2024)

Formalizing the notions of non-interactive and interactive algorithms
by: Middelburg, C. A.
Published: (2024)

Constant time testability of first-order logic with modulo counting on finitary graphs
by: Adler, Isolde, et al.
Published: (2026)

A Note on the NP-Hardness of PARTITION Via First-Order Projections
by: Iturralde, Paúl Risco
Published: (2025)

The Luna Bound Propagator for Formal Analysis of Neural Networks
by: LeCates, Henry, et al.
Published: (2026)

OnlineProver: Experience with a Visualisation Tool for Teaching Formal Proofs
by: Perháč, Ján, et al.
Published: (2025)

Two-Level Type Theory and Applications
by: Annenkov, Danil, et al.
Published: (2017)

Logics for the Relational Syllogistic
by: Pratt-Hartmann, Ian, et al.
Published: (2008)

Exponential Resolution Lower Bounds for Weak Pigeonhole Principle and Perfect Matching Formulas over Sparse Graphs
by: de Rezende, Susanna F., et al.
Published: (2019)

Failure of the strong feasible disjunction property
by: Krajicek, Jan
Published: (2026)

Semantics out of context: nominal absolute denotations for first-order logic and computation
by: Gabbay, Murdoch J.
Published: (2013)

Locality in Residuated-Lattice Structures
by: Carr, James
Published: (2025)

Notes on CSPs and Polymorphisms
by: Brady, Zarathustra
Published: (2022)