Filters








17 Hits in 4.4 sec

MaxSAT Resolution With the Dual Rail Encoding

Maria Luisa Bonet, Sam Buss, Alexey Ignatiev, Joao Marques-Silva, Antonio Morgado
2018 PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE  
The proposed reduction coupled with MaxSAT resolution represents a new proof system, DRMaxSAT, which was shown to enable polynomial time refutations of pigeonhole formulas, in contrast with either CDCL  ...  Conflict-driven clause learning (CDCL) is at the core of the success of modern SAT solvers. In terms of propositional proof complexity, CDCL has been shown as strong as general resolution.  ...  Finally, the paper investigates the formulas encoding the doubled PHP principle, and derives polynomial size refutations with the DRMaxSAT proof system.  ... 
doi:10.1609/aaai.v32i1.12204 fatcat:mk3yxmmvffeqvnpqcc7qhz4hgq

Augmenting the Power of (Partial) MaxSat Resolution with Extension

Javier Larrosa, Emma Rollon
2020 PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE  
In this paper we augment the MaxSAT resolution proof system with an extension rule.  ...  The refutation power of SAT and MaxSAT resolution is challenged by problems like the soft and hard Pigeon Hole Problem PHP for which short refutations do not exist.  ...  From this work one can conclude that MaxSAT resolution with the dual rail encoding dominates the SAT resolution proof system.  ... 
doi:10.1609/aaai.v34i02.5516 fatcat:yc4zw7ogyzdrnmm37cly5b42tu

Equivalence Between Systems Stronger Than Resolution [chapter]

Maria Luisa Bonet, Jordi Levy
2020 Lecture Notes in Computer Science  
Among those proof systems we can mention Circular Resolution, MaxSAT Resolution with Extensions and MaxSAT Resolution with the Dual-Rail encoding.  ...  Finally, we show the relationship between these two restricted systems and Dual-Rail MaxSAT Resolution.  ...  Among them are MaxSAT Resolution with Extension [13] , Circular Resolution [1] , Dual-Rail MaxSAT [9] , Weighted Dual-Rail MaxSAT [3, 14] and Sheraly-Adams proof system [7, 15] .  ... 
doi:10.1007/978-3-030-51825-7_13 fatcat:lpufu2phtvdi3n25z2pv4oqir4

On Tackling the Limits of Resolution in SAT Solving [article]

Alexey Ignatiev, Antonio Morgado, Joao Marques-Silva
2017 arXiv   pre-print
This result is in clear contrast with earlier results on the length of proofs of MaxSAT resolution for pigeonhole formulas.  ...  Given the new transformation, the paper proves a polynomial bound on the number of MaxSAT resolution steps for pigeonhole formulas.  ...  The transformation proposed above can be related with the well-known dual-rail encoding, used in different settings [19, 42, 47, 60, 62] .  ... 
arXiv:1705.01477v2 fatcat:mxks6ued2vh3ddi6z6utixo7jq

On Tackling the Limits of Resolution in SAT Solving [chapter]

Alexey Ignatiev, Antonio Morgado, Joao Marques-Silva
2017 Lecture Notes in Computer Science  
This result is in clear contrast with earlier results on the length of proofs of MaxSAT resolution for pigeonhole formulas.  ...  Given the new transformation, the paper proves a polynomial bound on the number of MaxSAT resolution steps for pigeonhole formulas.  ...  The transformation proposed above can be related with the well-known dual-rail encoding, used in different settings [19, 42, 47, 60, 62] .  ... 
doi:10.1007/978-3-319-66263-3_11 fatcat:jrszlcgfxfaxlchwgtc3rd5aqa

Towards a Better Understanding of (Partial Weighted) MaxSAT Proof Systems [article]

Javier Larrosa, Emma Rollon
2021 arXiv   pre-print
Then we analyze the effect of adding split and virtual, two original inference rules, to MaxSAT resolution.  ...  In this paper we want to address MaxSAT from the more formal point of view of Proof Complexity. With that aim we start providing basic definitions and proving some basic results.  ...  Dual Rail Encoding In their recent work [16, 7] introduce the dual rail encoding which transforms a SAT formula F over variables X " tx 1 , . . . , x s u (i.e., all clauses are hard) into a MaxSAT formula  ... 
arXiv:2003.02718v3 fatcat:ovm3s3sui5fddiqpzfcmm4jrt4

A Tableau Calculus for Non-clausal Maximum Satisfiability [chapter]

Chu Min Li, Felip Manyà, Joan Ramon Soler
2019 Lecture Notes in Computer Science  
We define a non-clausal MaxSAT tableau calculus.  ...  Moreover, we describe how to extend the proposed calculus to deal with hard and weighted soft formulas.  ...  Indeed, the combination of the dual rail encoding and MaxSAT resolution is a stronger proof system than general resolution [6] .  ... 
doi:10.1007/978-3-030-29026-9_4 fatcat:tchuxfxq3zcbza4tdkwpi2v5nu

Circular (Yet Sound) Proofs [chapter]

Albert Atserias, Massimo Lauria
2019 Lecture Notes in Computer Science  
Contrary to the case of circular resolution, for Frege we show that circular proofs can be converted into tree-like ones with at most polynomial overhead.  ...  We first focus on the circular version of Resolution, and see that it is stronger than Resolution since, as we show, the pigeonhole principle has circular Resolution proofs of polynomial size.  ...  We acknowledge the work of Jordi Coll who conducted experimental results for finding and visualizing actual circular resolution proofs of small instances of the sparse pigeonhole principle.  ... 
doi:10.1007/978-3-030-24258-9_1 fatcat:qzclgx5oyjgt7bviyim3koz4vu

Reducing SAT to Max2SAT

Carlos Ansótegui, Jordi Levy
2021 Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence   unpublished
hard formulas for Resolution.  ...  In this paper, we provide an efficient and constructive method for Reducing SAT to Max2SAT and show empirical results of how MaxSAT solvers are more efficient than SAT solvers solving the translation of  ...  Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence  ... 
doi:10.24963/ijcai.2021/189 fatcat:h4jfr5j4svbqhec67lsopfkzgu

SAT Competition 2020

Nils Froleyks, Marijn Heule, Markus Iser, Matti Järvisalo, Martin Suda
2021 Artificial Intelligence  
In this article, we provide a detailed account on the 2020 instantiation of the SAT Competition, including the new competition tracks and benchmark selection procedures, overview of solving strategies  ...  implemented in top-performing solvers, and a detailed analysis of the empirical data obtained from running the competition.  ...  Acknowledgements The authors thank StarExec for their support and resources to run the Main and the Planning tracks, and Amazon Web Services for their support and resources to run the Parallel and Cloud  ... 
doi:10.1016/j.artint.2021.103572 fatcat:skb6htbelzdqra32lo7weyhu2u

Formalization of logical calculi in Isabelle/HOL [article]

Mathias Fleury, Universität Des Saarlandes, Universität Des Saarlandes
2020
The framework offers a convenient way to prove metatheorems and experiment with variants, including the Davis-Putnam-Logemann-Loveland procedure.  ...  I develop a formal framework for propositional satifisfiability with the conflictdriven clause learning (CDCL) procedure using the Isabelle/HOL proof assistant.  ...  I performed the content of Section 4.3 and Section 4.4 with this encoding and only afterwards was pointed by a reviewer to the dual rail encoding.  ... 
doi:10.22028/d291-30179 fatcat:aukisj5neneidgo7i5fpeqbamu

SAT Competition 2020

Nils Froleyks, Marijn Heule, Markus Iser, Matti Järvisalo, Martin Suda
2021
In this article, we provide a detailed account on the 2020 instantiation of the SAT Competition, including the new competition tracks and benchmark selection procedures, overview of solving strategies  ...  implemented in top-performing solvers, and a detailed analysis of the empirical data obtained from running the competition.  ...  Acknowledgements The authors thank StarExec for their support and resources to run the Main and the Planning tracks, and Amazon Web Services for their support and resources to run the Parallel and Cloud  ... 
doi:10.5445/ir/1000137076 fatcat:xl74opijhvgznoajgxtbwpevd4

Evaluating the Hardness of SAT Instances Using Evolutionary Optimization Algorithms

Alexander Semenov, Daniil Chivilikhin, Artem Pavlenko, Ilya Otpuschennikov, Vladimir Ulyantsev, Alexey Ignatiev, Laurent D. Michel
2021
to define the hardness of the formula w.r.t. this set.  ...  In contrast to the backdoor measure, the new measure does not demand the polynomial decidability of CNF formulas obtained when substituting assignments of variables from B to the original formula.  ...  that build on the proof systems strictly stronger than resolution, including cutting planes [19, 45] and dual-rail based MaxSAT [12] , among others.  ... 
doi:10.4230/lipics.cp.2021.47 fatcat:a5tdw4i4pbaflmr2j6tfxuxtsa

OASIcs, Volume 54, ATMOS'16, Complete Volume [article]

Marc Goerigk, Renato Werneck
2016
The authors would like to thank Kai Nagel, Dominik Grether, and Theresa Thunig for the very helpful discussions, support, and the integration of traffic signals into MATSim [6] and the idea to study traffic  ...  We thank Billy Josefsson (project co-PI, LFV) and the members of the project reference group-Eric Hoffman (Eurocontrol), Hakan Svensson (LFV/NUAC), Anne-Marie Ragnarsson (Transportstyrelsen, the Swedish  ...  MaxSAT problem.  ... 
doi:10.4230/oasics.atmos.2016 fatcat:az3yzyq3vva3nfnduqesyo4axi

Local Arrangement Chairs & Webmasters Publication Chair Steering Committee Program Committee Additional Reviewers

Sean Safarpour, Synopsys Divjyot, Sethi Cisco, Jens Katelaan, Keshav Kini, Florian Zuleger, Armin Biere, Alan Hu, Warren Hunt, Vigyan Singhal, Oski Tech, Pranav Real (+126 others)
Proceedings of the 16th Conference on Formal Methods in Computer-Aided Design (FMCAD 2016)   unpublished
their manuscripts, and their help with additional tasks such as selecting and reviewing papers for the Best Paper Award.  ...  A conference with such a diverse program and audience as FMCAD relies on a large number of people supporting the organization.  ...  We are grateful to Sam Bayless for his essential help with Monosat and to Paul Inbar for editing the paper.  ... 
fatcat:6gmwf4yr6zbvzomhwj7atm6gq4
« Previous Showing results 1 — 15 out of 17 results