An extension theorem for signotopes

Autor: Bergold, Helena, Felsner, Stefan, Scheucher, Manfred

In 1926, Levi showed that, for every pseudoline arrangement $\mathcal{A}$ and two points in the plane, $\mathcal{A}$ can be extended by a pseudoline which contains the two prescribed points. Later extendability was studied for arrangements of pseudoh

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::61b9987ef24845229bb1f49924b97dec

Certified CNF Translations for Pseudo-Boolean Solving

Autor: Gocht, Stephan, Martins, Ruben, Nordström, Jakob, Oertel, Andy

Publikováno v: Gocht, S, Martins, R, Nordström, J & Oertel, A 2022, Certified CNF Translations for Pseudo-Boolean Solving . in K S Meel & O Strichman (eds), 25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022 ., 16, Schloss Dagstuhl-Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Leibniz International Proceedings in Informatics, LIPIcs, vol. 236, 25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022, Haifa, Israel, 02/08/2022 . https://doi.org/10.4230/LIPIcs.SAT.2022.16

The dramatic improvements in Boolean satisfiability (SAT) solving since the turn of the millennium have made it possible to leverage state-of-the-art conflict-driven clause learning (CDCL) solvers for many combinatorial problems in academia and indus

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a859a729cf7f18199a6864b5b10a143f
https://curis.ku.dk/portal/da/publications/certified-cnf-translations-for-pseudoboolean-solving(445fa175-66e7-425b-a592-48875a8aa511).html

Towards Better Heuristics for Solving Bounded Model Checking Problems (Short Paper)

Autor: Kheireddine, Anissa, Renault, Etienne, Baarir, Souheib

This paper presents a new way to improve the performance of the SAT-based bounded model checking problem by exploiting relevant information identified through the characteristics of the original problem. This led us to design a new way of building in

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::71de2482bd9dc6f65a482923a08f3a51

Evaluating the Hardness of SAT Instances Using Evolutionary Optimization Algorithms

Autor: Semenov, Alexander, Chivilikhin, Daniil, Pavlenko, Artem, Otpuschennikov, Ilya, Ulyantsev, Vladimir, Ignatiev, Alexey

Propositional satisfiability (SAT) solvers are deemed to be among the most efficient reasoners, which have been successfully used in a wide range of practical applications. As this contrasts the well-known NP-completeness of SAT, a number of attempts

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::595b4d7a805ea324ab433c5746351f92