Exploració per autor "Bonet Carbonell, M. Luisa"
Ara es mostren els items 6-15 de 15
-
Improving WPM2 for (weighted) partial MaxSAT
(Springer, 2013)
Text en actes de congrés
Accés restringit per política de l'editorialWeighted Partial MaxSAT (WPMS) is an optimization variant of the Satisfiability (SAT) problem. Several combinatorial optimization problems can be translated into WPMS. In this paper we extend the state-of-the-art WPM2 ... -
Linear lower bounds and simulations in Frege systems with substitutions
(1996-10)
Report de recerca
Accés obertOur work concerns Frege systems, substitution Frege systems (sF), renaming Frege systems, top/bottom-Frege systems and extended Frege systems (eF). Urquhart shows that tautologies associated to a binary strings ... -
Polynomial calculus for MaxSAT
(Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023)
Text en actes de congrés
Accés obertMaxSAT is the problem of finding an assignment satisfying the maximum number of clauses in a CNF formula. We consider a natural generalization of this problem to generic sets of polynomials and propose a weighted version ... -
Quasipolynomial size frege proofs of Frankl's Theorem on the trace of sets
(2016-06-01)
Article
Accés obertWe extend results of Bonet, Buss and Pitassi on Bondy's Theorem and of Nozaki, Arai and Arai on Bollobas' Theorem by proving that Frankl's Theorem on the trace of sets has quasipolynomial size Frege proofs. For constant ... -
Scale-free random SAT instances
(Multidisciplinary Digital Publishing Institute (MDPI), 2022-06-20)
Article
Accés obertWe focus on the random generation of SAT instances that have properties similar to real-world instances. It is known that many industrial instances, even with a great number of variables, can be solved by a clever solver ... -
Short proofs of the Kneser-Lovász coloring principle
(2018-08)
Article
Accés obertWe prove that propositional translations of the Kneser–Lovász theorem have polynomial size extended Frege proofs and quasi-polynomial size Frege proofs for all fixed values of k. We present a new counting-based combinatorial ... -
The fractal dimension of SAT formulas
(Springer, 2014)
Text en actes de congrés
Accés restringit per política de l'editorialModern SAT solvers have experienced a remarkable progress on solving industrial instances. Most of the techniques have been developed after an intensive experimental process. It is believed that these techniques exploit ... -
The Width-size method for general resolution is optimal
(1999-02)
Report de recerca
Accés obertThe Width-Size Method for resolution was recently introduced by Ben-Sasson and Wigderson (BSW): Short Proofs are Narrow - Resolution Made Simple STOC 99). They found a trade-off between two complexity measures for ... -
Towards industrial-like random SAT instances
(AAAI Press. Association for the Advancement of Artificial Intelligence, 2009)
Text en actes de congrés
Accés restringit per política de l'editorialWe focus on the random generation of SAT instances that have computational properties that are similar to real-world instances. It is known that industrial instances, even with a great number of variables, can be solved ... -
Weighted, circular and semi-algebraic proofs
(2024-02-11)
Article
Accés obertIn recent years there has been an increasing interest in studying proof systems stronger than Resolution, with the aim of building more efficient SAT solvers based on them. In defining these proof systems, we try to find ...
