:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Malaschonok, Gennadi, Seliverstov, Alexandr
Format:	Preprint
Published:	2024
Subjects:	Symbolic Computation 68T01 F.4.1; F.2.2
Online Access:	https://arxiv.org/abs/2408.04999
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

MathPartner is a breakthrough technology for natural sciences education, scientic and engineering applications
by: Malaschonok, Gennadi, et al.
Published: (2025)

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

A Qualitative Analysis of Kernel Extension for Higher Order Proof Checking
by: Wang, Shuai
Published: (2024)

LTL Verification of Memoryful Neural Agents
by: Hosseini, Mehran, et al.
Published: (2025)

A Complexity Dichotomy for Temporal Valued Constraint Satisfaction Problems
by: Bodirsky, Manuel, et al.
Published: (2024)

Dynamic Boolean Synthesis with Zero-suppressed Decision Diagrams
by: Lin, Yi, et al.
Published: (2025)

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

Computable Gap Assessment of Artificial Intelligence Governance in Children's Centres: Evidence-Mechanism-Governance-Indicator Modelling of UNICEF's Guidance on AI and Children 3.0 Based on the Graph-GAP Framework
by: Meng, Wei
Published: (2025)

Constraint Satisfaction Problems over Finitely Bounded Homogeneous Structures: a Dichotomy between FO and L-hard
by: Dorochko, Leonid, et al.
Published: (2026)

Folding One Polyhedral Metric Graph into Another
by: Chung, Lily, et al.
Published: (2024)

Factorial Basis Method for q-Series Applications
by: Jiménez-Pastor, Antonio, et al.
Published: (2024)

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

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

A Formal Analysis of Algorithms for Matroids and Greedoids
by: Abdulaziz, Mohammad, et al.
Published: (2025)

The Complexity of Resilience Problems via Valued Constraint Satisfaction
by: Bodirsky, Manuel, et al.
Published: (2023)

Learning to Repair Lean Proofs from Compiler Feedback
by: Wang, Evan, et al.
Published: (2026)

Incremental Selection of Most-Filtering Conjectures and Proofs of the Selected Conjectures
by: Ngouonou, Jovial Cheukam, et al.
Published: (2025)

Clique Is Hard on Average for Sherali-Adams with Bounded Coefficients
by: de Rezende, Susanna F., et al.
Published: (2024)

Supercritical Tradeoffs for Monotone Circuits
by: Göös, Mika, et al.
Published: (2024)

Graph Colouring Is Hard on Average for Polynomial Calculus and Nullstellensatz
by: Conneryd, Jonas, et al.
Published: (2025)

On bounded depth proofs for Tseitin formulas on the grid; revisited
by: Håstad, Johan, et al.
Published: (2022)

Superpolynomial Length Lower Bounds for Tree-Like Semantic Proof Systems with Bounded Line Size
by: de Rezende, Susanna F., et al.
Published: (2026)

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

Complete Reduction for Derivatives in a Transcendental Liouvillian Extension
by: Chen, Shaoshi, et al.
Published: (2026)

Complete Reduction for Derivatives in a Primitive Tower
by: Du, Hao, et al.
Published: (2025)

Introducing The Maximum Common Bigraph Problem
by: Burns, Kyle, et al.
Published: (2026)

Directional Non-Commutative Monoidal Structures with Interchange Law via Commutative Generators
by: Godavarti, Mahesh
Published: (2025)

LSU factorization
by: Malaschonok, Gennadi
Published: (2025)

Locality, Consistency, and the Tractability Frontier
by: Simas, Tristan
Published: (2026)

Towards LLM-based Generation of Human-Readable Proofs in Polynomial Formal Verification
by: Drechsler, Rolf
Published: (2025)

SUBMASSIVE: Resolving Subclass Cycles in Very Large Knowledge Graphs
by: Wang, Shuai, et al.
Published: (2024)

The Fluted Fragment with Transitive Relations
by: Pratt-Hartmann, Ian, et al.
Published: (2020)

Complexity Classification Transfer for CSPs via Algebraic Products
by: Bodirsky, Manuel, et al.
Published: (2022)

Cognitive Castes: Artificial Intelligence, Epistemic Stratification, and the Dissolution of Democratic Discourse
by: Wright, Craig S
Published: (2025)

Formally Verifying the Safety of Pipelined Moonshot Consensus Protocol
by: Praveen, M., et al.
Published: (2024)

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

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

Mechanizing Operads with Event-B
by: Attiogbé, Christian
Published: (2025)

Faster Algorithms for Structured Matrix Multiplication via Flip Graph Search
by: Khoruzhii, Kirill, et al.
Published: (2025)

Hypergeometric-Type Sequences
by: Tabuguia, Bertrand Teguia
Published: (2023)