Polynomial calculus for optimization
From MaRDI portal
Publication:6665696
DOI10.1016/J.ARTINT.2024.104208MaRDI QIDQ6665696
Ilario Bonacina, Maria Luisa Bonet, Jordi Levy
Publication date: 17 January 2025
Published in: Artificial Intelligence (Search for Journal in Brave)
Mechanization of proofs and logical operations (03B35) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Classical propositional logic (03B05) Artificial intelligence (68Txx) Complexity of proofs (03F20)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the power of clause-learning SAT solvers as resolution engines
- Computing infeasibility certificates for combinatorial problems through Hilbert's Nullstellensatz
- Resolution for Max-SAT
- Polybori: A framework for Gröbner-basis computations with Boolean polynomials
- Lower bounds for the polynomial calculus
- On tackling the limits of resolution in SAT solving
- Nullstellensatz-proofs for multiplier verification
- Circular (yet sound) proofs
- Propositional proof systems based on maximum satisfiability
- Equivalence between systems stronger than resolution
- Towards a better understanding of (partial weighted) MaxSAT proof systems
- Graph-coloring ideals: Nullstellensatz certificates, Gröbner bases for chordal graphs, and hardness of Gröbner bases
- Expressing Combinatorial Problems by Systems of Polynomial Equations and Hilbert's Nullstellensatz
- Hard examples for resolution
- The relative efficiency of propositional proof systems
- Proof Complexity for the Maximum Satisfiability Problem and its Use in SAT Refutations
- (Semi)Algebraic proofs over {±1} variables
- A Complete Calculus for Max-SAT
- Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution
- Linear lower bound on degrees of Positivstellensatz calculus proofs for the parity
- Linear gaps between degrees for the polynomial calculus modulo distinct primes
- The power of negative reasoning
- Polynomial calculus for MaxSAT
This page was built for publication: Polynomial calculus for optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6665696)
