How To Discover Short, Shorter, and the Shortest Proofs of Unsatisfiability: A Branch-and-Bound Approach for Resolution Proof Length Minimization
Fuente:
arXiv
Guardado en:
| Autores principales: | Sidorov, Konstantin, van der Linden, Koos, Correia, Gonçalo Homem de Almeida, de Weerdt, Mathijs, Demirović, Emir |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
Necessary and Sufficient Conditions for Optimal Decision Trees using Dynamic Programming
por: van der Linden, Jacobus G. M., et al.
Publicado: (2023)
por: van der Linden, Jacobus G. M., et al.
Publicado: (2023)
Optimal or Greedy Decision Trees? Revisiting their Objectives, Tuning, and Performance
por: van der Linden, Jacobus G. M., et al.
Publicado: (2024)
por: van der Linden, Jacobus G. M., et al.
Publicado: (2024)
Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound
por: Brita, Catalin E., et al.
Publicado: (2025)
por: Brita, Catalin E., et al.
Publicado: (2025)
DRAT Proofs of Unsatisfiability for SAT Modulo Monotonic Theories
por: Feng, Nick, et al.
Publicado: (2024)
por: Feng, Nick, et al.
Publicado: (2024)
Optimal Survival Trees: A Dynamic Programming Approach
por: Huisman, Tim, et al.
Publicado: (2024)
por: Huisman, Tim, et al.
Publicado: (2024)
T-STAR: A Context-Aware Transformer Framework for Short-Term Probabilistic Demand Forecasting in Dock-Based Shared Micro-Mobility
por: Cheng, Jingyi, et al.
Publicado: (2026)
por: Cheng, Jingyi, et al.
Publicado: (2026)
Diagnosis via Proofs of Unsatisfiability for First-Order Logic with Relational Objects
por: Feng, Nick, et al.
Publicado: (2024)
por: Feng, Nick, et al.
Publicado: (2024)
Finding Bugs in Short Proofs: The Metamathematics of Resolution Lower Bounds
por: Li, Jiawei, et al.
Publicado: (2024)
por: Li, Jiawei, et al.
Publicado: (2024)
Epsilon Calculus Provides Shorter Cut-Free Proofs
por: Baaz, Matthias, et al.
Publicado: (2024)
por: Baaz, Matthias, et al.
Publicado: (2024)
Optimizing Electric Carsharing System Operations and Battery Management: Integrating V2G, B2G and Battery Swapping Strategies
por: Yang, Shuang, et al.
Publicado: (2024)
por: Yang, Shuang, et al.
Publicado: (2024)
SORTeD Rashomon Sets of Sparse Decision Trees: Anytime Enumeration
por: Arslan, Elif, et al.
Publicado: (2025)
por: Arslan, Elif, et al.
Publicado: (2025)
Revisiting Landmarks: Learning from Previous Plans to Generalize over Problem Instances
por: Hanou, Issa, et al.
Publicado: (2025)
por: Hanou, Issa, et al.
Publicado: (2025)
Complexity of Scheduling Charging in the Smart Grid
por: de Weerdt, Mathijs, et al.
Publicado: (2017)
por: de Weerdt, Mathijs, et al.
Publicado: (2017)
A Penalty-Based Guardrail Algorithm for Non-Decreasing Optimization with Inequality Constraints
por: Stepanovic, Ksenija, et al.
Publicado: (2024)
por: Stepanovic, Ksenija, et al.
Publicado: (2024)
To the Max: Reinventing Reward in Reinforcement Learning
por: Veviurko, Grigorii, et al.
Publicado: (2024)
por: Veviurko, Grigorii, et al.
Publicado: (2024)
You Shall Pass: Dealing with the Zero-Gradient Problem in Predict and Optimize for Convex Optimization
por: Veviurko, Grigorii, et al.
Publicado: (2023)
por: Veviurko, Grigorii, et al.
Publicado: (2023)
In Search of Trees: Decision-Tree Policy Synthesis for Black-Box Systems via Search
por: Demirović, Emir, et al.
Publicado: (2024)
por: Demirović, Emir, et al.
Publicado: (2024)
Superpolynomial Length Lower Bounds for Tree-Like Semantic Proof Systems with Bounded Line Size
por: de Rezende, Susanna F., et al.
Publicado: (2026)
por: de Rezende, Susanna F., et al.
Publicado: (2026)
Enumerating Minimal Unsatisfiable Cores of LTLf formulas
por: Ielo, Antonio, et al.
Publicado: (2024)
por: Ielo, Antonio, et al.
Publicado: (2024)
Graph Pruning for Enumeration of Minimal Unsatisfiable Subsets
por: Lymperopoulos, Panagiotis, et al.
Publicado: (2024)
por: Lymperopoulos, Panagiotis, et al.
Publicado: (2024)
Less Effort, Shorter Proofs: Reinforcement Learning for Security Protocol Analysis in Tamarin
por: Cosler, Matthias, et al.
Publicado: (2026)
por: Cosler, Matthias, et al.
Publicado: (2026)
On inferring cumulative constraints
por: Sidorov, Konstantin
Publicado: (2026)
por: Sidorov, Konstantin
Publicado: (2026)
Edge-Colored Clustering in Hypergraphs: Beyond Minimizing Unsatisfied Edges
por: Crane, Alex, et al.
Publicado: (2025)
por: Crane, Alex, et al.
Publicado: (2025)
Precomputing Multi-Agent Path Replanning using Temporal Flexibility
por: Hanou, Issa, et al.
Publicado: (2026)
por: Hanou, Issa, et al.
Publicado: (2026)
Lean on Vampire Proofs (Short Paper)
por: Bodingbauer, Jonas, et al.
Publicado: (2026)
por: Bodingbauer, Jonas, et al.
Publicado: (2026)
A Short Proof of the Poincaré Conjecture
por: Dunwoody, M. J.
Publicado: (2025)
por: Dunwoody, M. J.
Publicado: (2025)
Domain-Independent Dynamic Programming with Constraint Propagation
por: Marijnissen, Imko, et al.
Publicado: (2026)
por: Marijnissen, Imko, et al.
Publicado: (2026)
Proof Minimization in Neural Network Verification
por: Isac, Omri, et al.
Publicado: (2025)
por: Isac, Omri, et al.
Publicado: (2025)
Unentanglement and Post-Measurement Branching in Quantum Interactive Proofs
por: Grewal, Sabee, et al.
Publicado: (2025)
por: Grewal, Sabee, et al.
Publicado: (2025)
Autoritarismo global – reflexões e questões
por: Alex Demirović
Publicado: (2022)
por: Alex Demirović
Publicado: (2022)
Para que fim e de que forma criticar o Estado?
por: Alex Demirović
Publicado: (2014)
por: Alex Demirović
Publicado: (2014)
EXPObench: Benchmarking Surrogate-based Optimisation Algorithms on Expensive Black-box Functions
por: Bliek, Laurens, et al.
Publicado: (2021)
por: Bliek, Laurens, et al.
Publicado: (2021)
Formulation and Proof of the Gravitational Entropy Bound
por: Averin, Artem
Publicado: (2024)
por: Averin, Artem
Publicado: (2024)
Security Proof for Variable-Length Quantum Key Distribution
por: Tupkary, Devashish, et al.
Publicado: (2023)
por: Tupkary, Devashish, et al.
Publicado: (2023)
Interpolation in Proof Theory
por: van der Giessen, Iris, et al.
Publicado: (2026)
por: van der Giessen, Iris, et al.
Publicado: (2026)
Proving Unsatisfiability with Hitting Formulas
por: Filmus, Yuval, et al.
Publicado: (2023)
por: Filmus, Yuval, et al.
Publicado: (2023)
A Short Proof of Knuth's Old Sum
por: Adegoke, Kunle
Publicado: (2024)
por: Adegoke, Kunle
Publicado: (2024)
Proofs as Explanations: Short Certificates for Reliable Predictions
por: Blum, Avrim, et al.
Publicado: (2025)
por: Blum, Avrim, et al.
Publicado: (2025)
Does Subset Sum Admit Short Proofs?
por: Włodarczyk, Michał
Publicado: (2024)
por: Włodarczyk, Michał
Publicado: (2024)
Using Certifying Constraint Solvers for Generating Step-wise Explanations
por: Bleukx, Ignace, et al.
Publicado: (2025)
por: Bleukx, Ignace, et al.
Publicado: (2025)
Ejemplares similares
-
Necessary and Sufficient Conditions for Optimal Decision Trees using Dynamic Programming
por: van der Linden, Jacobus G. M., et al.
Publicado: (2023) -
Optimal or Greedy Decision Trees? Revisiting their Objectives, Tuning, and Performance
por: van der Linden, Jacobus G. M., et al.
Publicado: (2024) -
Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound
por: Brita, Catalin E., et al.
Publicado: (2025) -
DRAT Proofs of Unsatisfiability for SAT Modulo Monotonic Theories
por: Feng, Nick, et al.
Publicado: (2024) -
Optimal Survival Trees: A Dynamic Programming Approach
por: Huisman, Tim, et al.
Publicado: (2024)