×

Found 1,264 Documents (Results 1–100)

100
MathJax

Learning Boolean controls in regulated metabolic networks: a case-study. (English) Zbl 07532541

Cinquemani, Eugenio (ed.) et al., Computational methods in systems biology. 19th international conference, CMSB 2021, Bordeaux, France, September 22–24, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12881, 159-180 (2021).
MSC:  92C40 92C42
PDF BibTeX XML Cite
Full Text: DOI

Logical cryptanalysis with WDSat. (English) Zbl 07495597

Li, Chu-Min (ed.) et al., Theory and applications of satisfiability testing – SAT 2021. 24th international conference, Barcelona, Spain, July 5–9, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12831, 545-561 (2021).
MSC:  68Q25 68R07 68T20
PDF BibTeX XML Cite
Full Text: DOI

DQBDD: an efficient BDD-based DQBF solver. (English) Zbl 07495596

Li, Chu-Min (ed.) et al., Theory and applications of satisfiability testing – SAT 2021. 24th international conference, Barcelona, Spain, July 5–9, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12831, 535-544 (2021).
MSC:  68Q25 68R07 68T20
PDF BibTeX XML Cite
Full Text: DOI

Scalable SAT solving in the cloud. (English) Zbl 07495595

Li, Chu-Min (ed.) et al., Theory and applications of satisfiability testing – SAT 2021. 24th international conference, Barcelona, Spain, July 5–9, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12831, 518-534 (2021).
MSC:  68Q25 68R07 68T20
PDF BibTeX XML Cite
Full Text: DOI

Certified DQBF solving by definition extraction. (English) Zbl 07495594

Li, Chu-Min (ed.) et al., Theory and applications of satisfiability testing – SAT 2021. 24th international conference, Barcelona, Spain, July 5–9, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12831, 499-517 (2021).
MSC:  68Q25 68R07 68T20
PDF BibTeX XML Cite
Full Text: DOI

Leveraging GPUs for effective clause sharing in parallel SAT solving. (English) Zbl 07495592

Li, Chu-Min (ed.) et al., Theory and applications of satisfiability testing – SAT 2021. 24th international conference, Barcelona, Spain, July 5–9, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12831, 471-487 (2021).
MSC:  68Q25 68R07 68T20
PDF BibTeX XML Cite
Full Text: DOI

MedleySolver: online SMT algorithm selection. (English) Zbl 07495591

Li, Chu-Min (ed.) et al., Theory and applications of satisfiability testing – SAT 2021. 24th international conference, Barcelona, Spain, July 5–9, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12831, 453-470 (2021).
MSC:  68Q25 68R07 68T20
PDF BibTeX XML Cite
Full Text: DOI

A fast algorithm for SAT in terms of formula length. (English) Zbl 07495590

Li, Chu-Min (ed.) et al., Theory and applications of satisfiability testing – SAT 2021. 24th international conference, Barcelona, Spain, July 5–9, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12831, 436-452 (2021).
MSC:  68Q25 68R07 68T20
PDF BibTeX XML Cite
Full Text: DOI

XOR local search for Boolean Brent equations. (English) Zbl 07495589

Li, Chu-Min (ed.) et al., Theory and applications of satisfiability testing – SAT 2021. 24th international conference, Barcelona, Spain, July 5–9, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12831, 417-435 (2021).
MSC:  68Q25 68R07 68T20
PDF BibTeX XML Cite
Full Text: DOI

Proof complexity of symbolic QBF reasoning. (English) Zbl 07495588

Li, Chu-Min (ed.) et al., Theory and applications of satisfiability testing – SAT 2021. 24th international conference, Barcelona, Spain, July 5–9, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12831, 399-416 (2021).
MSC:  68Q25 68R07 68T20
PDF BibTeX XML Cite
Full Text: DOI

The MergeSat solver. (English) Zbl 07495587

Li, Chu-Min (ed.) et al., Theory and applications of satisfiability testing – SAT 2021. 24th international conference, Barcelona, Spain, July 5–9, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12831, 387-398 (2021).
MSC:  68Q25 68R07 68T20
PDF BibTeX XML Cite
Full Text: DOI

Smt-Switch: a solver-agnostic C++ API for SMT solving. (English) Zbl 07495586

Li, Chu-Min (ed.) et al., Theory and applications of satisfiability testing – SAT 2021. 24th international conference, Barcelona, Spain, July 5–9, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12831, 377-386 (2021).
MSC:  68Q25 68R07 68T20
PDF BibTeX XML Cite
Full Text: DOI

On the hierarchical community structure of practical Boolean formulas. (English) Zbl 07495585

Li, Chu-Min (ed.) et al., Theory and applications of satisfiability testing – SAT 2021. 24th international conference, Barcelona, Spain, July 5–9, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12831, 359-376 (2021).
MSC:  68Q25 68R07 68T20
PDF BibTeX XML Cite
Full Text: DOI

Scheduling reach mahjong tournaments using pseudoboolean constraints. (English) Zbl 07495584

Li, Chu-Min (ed.) et al., Theory and applications of satisfiability testing – SAT 2021. 24th international conference, Barcelona, Spain, July 5–9, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12831, 349-358 (2021).
MSC:  68Q25 68R07 68T20
PDF BibTeX XML Cite
Full Text: DOI

Efficient local search for pseudo Boolean optimization. (English) Zbl 07495583

Li, Chu-Min (ed.) et al., Theory and applications of satisfiability testing – SAT 2021. 24th international conference, Barcelona, Spain, July 5–9, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12831, 332-348 (2021).
MSC:  68Q25 68R07 68T20
PDF BibTeX XML Cite
Full Text: DOI

On dedicated CDCL strategies for PB solvers. (English) Zbl 07495582

Li, Chu-Min (ed.) et al., Theory and applications of satisfiability testing – SAT 2021. 24th international conference, Barcelona, Spain, July 5–9, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12831, 315-331 (2021).
MSC:  68Q25 68R07 68T20
PDF BibTeX XML Cite
Full Text: DOI

Projection heuristics for binary branchings between sum and product. (English) Zbl 07495581

Li, Chu-Min (ed.) et al., Theory and applications of satisfiability testing – SAT 2021. 24th international conference, Barcelona, Spain, July 5–9, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12831, 299-314 (2021).
MSC:  68Q25 68R07 68T20
PDF BibTeX XML Cite
Full Text: DOI

Assessing progress in SAT solvers through the Lens of incremental SAT. (English) Zbl 07495580

Li, Chu-Min (ed.) et al., Theory and applications of satisfiability testing – SAT 2021. 24th international conference, Barcelona, Spain, July 5–9, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12831, 280-298 (2021).
MSC:  68Q25 68R07 68T20
PDF BibTeX XML Cite
Full Text: DOI

Investigating the existence of Costas Latin squares via satisfiability testing. (English) Zbl 07495579

Li, Chu-Min (ed.) et al., Theory and applications of satisfiability testing – SAT 2021. 24th international conference, Barcelona, Spain, July 5–9, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12831, 270-279 (2021).
MSC:  68Q25 68R07 68T20
PDF BibTeX XML Cite
Full Text: DOI

SAT-based rigorous explanations for decision lists. (English) Zbl 07495578

Li, Chu-Min (ed.) et al., Theory and applications of satisfiability testing – SAT 2021. 24th international conference, Barcelona, Spain, July 5–9, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12831, 251-269 (2021).
MSC:  68Q25 68R07 68T20
PDF BibTeX XML Cite
Full Text: DOI

DiMo – discrete modelling using propositional logic. (English) Zbl 07495577

Li, Chu-Min (ed.) et al., Theory and applications of satisfiability testing – SAT 2021. 24th international conference, Barcelona, Spain, July 5–9, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12831, 242-250 (2021).
MSC:  68Q25 68R07 68T20
PDF BibTeX XML Cite
Full Text: DOI

Efficient SAT-based minimal model generation methods for modal logic S5. (English) Zbl 07495576

Li, Chu-Min (ed.) et al., Theory and applications of satisfiability testing – SAT 2021. 24th international conference, Barcelona, Spain, July 5–9, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12831, 225-241 (2021).
MSC:  68Q25 68R07 68T20
PDF BibTeX XML Cite
Full Text: DOI

MCP: capturing big data by satisfiability (tool description). (English) Zbl 07495574

Li, Chu-Min (ed.) et al., Theory and applications of satisfiability testing – SAT 2021. 24th international conference, Barcelona, Spain, July 5–9, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12831, 207-215 (2021).
MSC:  68Q25 68R07 68T20
PDF BibTeX XML Cite
Full Text: DOI

Solving non-uniform planted and filtered random SAT formulas greedily. (English) Zbl 07495573

Li, Chu-Min (ed.) et al., Theory and applications of satisfiability testing – SAT 2021. 24th international conference, Barcelona, Spain, July 5–9, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12831, 188-206 (2021).
MSC:  68Q25 68R07 68T20
PDF BibTeX XML Cite
Full Text: DOI

Efficient all-UIP learned clause minimization. (English) Zbl 07495572

Li, Chu-Min (ed.) et al., Theory and applications of satisfiability testing – SAT 2021. 24th international conference, Barcelona, Spain, July 5–9, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12831, 171-187 (2021).
MSC:  68Q25 68R07 68T20
PDF BibTeX XML Cite
Full Text: DOI

ProCount: weighted projected model counting with graded project-join trees. (English) Zbl 07495571

Li, Chu-Min (ed.) et al., Theory and applications of satisfiability testing – SAT 2021. 24th international conference, Barcelona, Spain, July 5–9, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12831, 152-170 (2021).
MSC:  68Q25 68R07 68T20
PDF BibTeX XML Cite
Full Text: DOI

Weighted model counting without parameter variables. (English) Zbl 07495570

Li, Chu-Min (ed.) et al., Theory and applications of satisfiability testing – SAT 2021. 24th international conference, Barcelona, Spain, July 5–9, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12831, 134-151 (2021).
MSC:  68Q25 68R07 68T20
PDF BibTeX XML Cite
Full Text: DOI

Characterizing Tseitin-formulas with short regular resolution refutations. (English) Zbl 07495569

Li, Chu-Min (ed.) et al., Theory and applications of satisfiability testing – SAT 2021. 24th international conference, Barcelona, Spain, July 5–9, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12831, 116-133 (2021).
MSC:  68Q25 68R07 68T20
PDF BibTeX XML Cite
Full Text: DOI

Deep cooperation of CDCL and local search for SAT. (English) Zbl 07495566

Li, Chu-Min (ed.) et al., Theory and applications of satisfiability testing – SAT 2021. 24th international conference, Barcelona, Spain, July 5–9, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12831, 64-81 (2021).
MSC:  68Q25 68R07 68T20
PDF BibTeX XML Cite
Full Text: DOI

Lower bounds for QCDCL via formula gauge. (English) Zbl 07495565

Li, Chu-Min (ed.) et al., Theory and applications of satisfiability testing – SAT 2021. 24th international conference, Barcelona, Spain, July 5–9, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12831, 47-63 (2021).
MSC:  68Q25 68R07 68T20
PDF BibTeX XML Cite
Full Text: DOI

Davis and Putnam meet Henkin: solving DQBF with resolution. (English) Zbl 07495564

Li, Chu-Min (ed.) et al., Theory and applications of satisfiability testing – SAT 2021. 24th international conference, Barcelona, Spain, July 5–9, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12831, 30-46 (2021).
MSC:  68Q25 68R07 68T20
PDF BibTeX XML Cite
Full Text: DOI

QBFFam: a tool for generating QBF families from proof complexity. (English) Zbl 07495563

Li, Chu-Min (ed.) et al., Theory and applications of satisfiability testing – SAT 2021. 24th international conference, Barcelona, Spain, July 5–9, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12831, 21-29 (2021).
MSC:  68Q25 68R07 68T20
PDF BibTeX XML Cite
Full Text: DOI

PyDGGA: distributed GGA for automatic configuration. (English) Zbl 07495562

Li, Chu-Min (ed.) et al., Theory and applications of satisfiability testing – SAT 2021. 24th international conference, Barcelona, Spain, July 5–9, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12831, 11-20 (2021).
MSC:  68Q25 68R07 68T20
PDF BibTeX XML Cite
Full Text: DOI

OptiLog: a framework for SAT-based systems. (English) Zbl 07495561

Li, Chu-Min (ed.) et al., Theory and applications of satisfiability testing – SAT 2021. 24th international conference, Barcelona, Spain, July 5–9, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12831, 1-10 (2021).
MSC:  68Q25 68R07 68T20
PDF BibTeX XML Cite
Full Text: DOI

On some variants of the merging variables based \((1+1)\)-evolutionary algorithm with application to MaxSAT problem. (English) Zbl 1487.90483

Pardalos, Panos (ed.) et al., Mathematical optimization theory and operations research. 20th international conference, MOTOR 2021, Irkutsk, Russia, July 5–10, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12755, 111-124 (2021).
MSC:  90C10 90C59
PDF BibTeX XML Cite
Full Text: DOI

Towards a compact SAT-based encoding of itemset mining tasks. (English) Zbl 07493628

Stuckey, Peter J. (ed.), Integration of constraint programming, artificial intelligence, and operations research. 18th international conference, CPAIOR 2021, Vienna, Austria, July 5–8, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12735, 163-178 (2021).
MSC:  68T20 90C27
PDF BibTeX XML Cite
Full Text: DOI

Compositional satisfiability solving in separation logic. (English) Zbl 1472.03025

Henglein, Fritz (ed.) et al., Verification, model checking, and abstract interpretation. 22nd international conference, VMCAI 2021, Copenhagen, Denmark, January 17–19, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12597, 578-602 (2021).
MSC:  03B70 03B25 68T20
PDF BibTeX XML Cite
Full Text: DOI

Formal semantics and verification of network-based biocomputation circuits. (English) Zbl 1472.68057

Henglein, Fritz (ed.) et al., Verification, model checking, and abstract interpretation. 22nd international conference, VMCAI 2021, Copenhagen, Denmark, January 17–19, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12597, 464-485 (2021).
PDF BibTeX XML Cite
Full Text: DOI

Generating extended resolution proofs with a BDD-based SAT solver. (English) Zbl 1467.68203

Groote, Jan Friso (ed.) et al., Tools and algorithms for the construction and analysis of systems. 27th international conference, TACAS 2021, held as part of the European joint conferences on theory and practice of software, ETAPS 2021, Luxembourg City, Luxembourg, March 27 – April 1, 2021. Proceedings. Part I. Cham: Springer. Lect. Notes Comput. Sci. 12651, 76-93 (2021).
MSC:  68V15 68R07 68T20
PDF BibTeX XML Cite
Full Text: DOI arXiv

A flexible proof format for SAT solver-elaborator communication. (English) Zbl 1467.68159

Groote, Jan Friso (ed.) et al., Tools and algorithms for the construction and analysis of systems. 27th international conference, TACAS 2021, held as part of the European joint conferences on theory and practice of software, ETAPS 2021, Luxembourg City, Luxembourg, March 27 – April 1, 2021. Proceedings. Part I. Cham: Springer. Lect. Notes Comput. Sci. 12651, 59-75 (2021).
MSC:  68T20 68R07
PDF BibTeX XML Cite
Full Text: DOI arXiv

Quasipolynomial computation of nested fixpoints. (English) Zbl 1467.68085

Groote, Jan Friso (ed.) et al., Tools and algorithms for the construction and analysis of systems. 27th international conference, TACAS 2021, held as part of the European joint conferences on theory and practice of software, ETAPS 2021, Luxembourg City, Luxembourg, March 27 – April 1, 2021. Proceedings. Part I. Cham: Springer. Lect. Notes Comput. Sci. 12651, 38-56 (2021).
PDF BibTeX XML Cite
Full Text: DOI arXiv

Theory and applications of satisfiability testing – SAT 2021. 24th international conference, Barcelona, Spain, July 5–9, 2021. Proceedings. (English) Zbl 1482.68030

Lecture Notes in Computer Science 12831. Cham: Springer (ISBN 978-3-030-80222-6/pbk; 978-3-030-80223-3/ebook). xi, 564 p. (2021).
PDF BibTeX XML Cite
Full Text: DOI

Complexity of infinite-domain constraint satisfaction. (English) Zbl 07344230

Lecture Notes in Logic 52. Cambridge: Cambridge University Press; Ithaca, NY: Association for Symbolic Logic (ASL) (ISBN 978-1-107-04284-1/hbk; 978-1-107-33753-4/ebook). xii, 524 p. (2021).
PDF BibTeX XML Cite
Full Text: DOI

Handbook of satisfiability. In 2 parts. 2nd updated and revised edition. (English) Zbl 1456.68001

Frontiers in Artificial Intelligence and Applications 336. Amsterdam: IOS Press (ISBN 978-1-64368-160-3/pbk; 978-1-64368-161-0/ebook). xvii, 1465 p. (2021).
PDF BibTeX XML Cite
Full Text: Link

Finding small satisfying assignments faster than brute force: a fine-grained perspective into Boolean constraint satisfaction. (English) Zbl 07561755

Saraf, Shubhangi (ed.), 35th computational complexity conference, CCC 2020, July 28–31, 2020, Saarbrücken, Germany, virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 169, Article 27, 28 p. (2020).
MSC:  68Q25
PDF BibTeX XML Cite
Full Text: DOI

Algorithms and lower bounds for de Morgan formulas of low-communication leaf gates. (English) Zbl 07561743

Saraf, Shubhangi (ed.), 35th computational complexity conference, CCC 2020, July 28–31, 2020, Saarbrücken, Germany, virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 169, Article 15, 41 p. (2020).
MSC:  68Q25
PDF BibTeX XML Cite
Full Text: DOI

Improving effectiveness of neighborhood-based algorithms for optimization of costly pseudo-Boolean black-box functions. (English) Zbl 1464.90039

Kononov, Alexander (ed.) et al., Mathematical optimization theory and operations research. 19th international conference, MOTOR 2020, Novosibirsk, Russia, July 6–10, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12095, 373-388 (2020).
MSC:  90C09 90C59
PDF BibTeX XML Cite
Full Text: DOI

Incremental encoding of pseudo-Boolean goal functions based on comparator networks. (English) Zbl 07331043

Pulina, Luca (ed.) et al., Theory and applications of satisfiability testing – SAT 2020. 23rd international conference, Alghero, Italy, July 3–10, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12178, 519-535 (2020).
MSC:  68Q25 68R07 68T20
PDF BibTeX XML Cite
Full Text: DOI

SAT-based encodings for optimal decision trees with explicit paths. (English) Zbl 07331042

Pulina, Luca (ed.) et al., Theory and applications of satisfiability testing – SAT 2020. 23rd international conference, Alghero, Italy, July 3–10, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12178, 501-518 (2020).
MSC:  68Q25 68R07 68T20
PDF BibTeX XML Cite
Full Text: DOI

SAT solving with fragmented Hamiltonian path constraints for wire arc additive manufacturing. (English) Zbl 07331041

Pulina, Luca (ed.) et al., Theory and applications of satisfiability testing – SAT 2020. 23rd international conference, Alghero, Italy, July 3–10, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12178, 492-500 (2020).
MSC:  68Q25 68R07 68T20
PDF BibTeX XML Cite
Full Text: DOI

Satisfiability solving meets evolutionary optimisation in designing approximate circuits. (English) Zbl 07331040

Pulina, Luca (ed.) et al., Theory and applications of satisfiability testing – SAT 2020. 23rd international conference, Alghero, Italy, July 3–10, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12178, 481-491 (2020).
MSC:  68Q25 68R07 68T20
PDF BibTeX XML Cite
Full Text: DOI

Matrix multiplication: verifying strong uniquely solvable puzzles. (English) Zbl 07331039

Pulina, Luca (ed.) et al., Theory and applications of satisfiability testing – SAT 2020. 23rd international conference, Alghero, Italy, July 3–10, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12178, 464-480 (2020).
MSC:  68Q25 68R07 68T20
PDF BibTeX XML Cite
Full Text: DOI

Positional games and QBF: the corrective encoding. (English) Zbl 07331038

Pulina, Luca (ed.) et al., Theory and applications of satisfiability testing – SAT 2020. 23rd international conference, Alghero, Italy, July 3–10, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12178, 447-463 (2020).
MSC:  68Q25 68R07 68T20
PDF BibTeX XML Cite
Full Text: DOI arXiv

Multi-linear strategy extraction for QBF expansion proofs via local soundness. (English) Zbl 07331037

Pulina, Luca (ed.) et al., Theory and applications of satisfiability testing – SAT 2020. 23rd international conference, Alghero, Italy, July 3–10, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12178, 429-446 (2020).
MSC:  68Q25 68R07 68T20
PDF BibTeX XML Cite
Full Text: DOI

Short Q-resolution proofs with homomorphisms. (English) Zbl 07331036

Pulina, Luca (ed.) et al., Theory and applications of satisfiability testing – SAT 2020. 23rd international conference, Alghero, Italy, July 3–10, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12178, 412-428 (2020).
MSC:  68Q25 68R07 68T20
PDF BibTeX XML Cite
Full Text: DOI

Strong (D)QBF dependency schemes via tautology-free resolution paths. (English) Zbl 07331035

Pulina, Luca (ed.) et al., Theory and applications of satisfiability testing – SAT 2020. 23rd international conference, Alghero, Italy, July 3–10, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12178, 394-411 (2020).
MSC:  68Q25 68R07 68T20
PDF BibTeX XML Cite
Full Text: DOI

Speeding up quantified bit-vector SMT solvers by bit-width reductions and extensions. (English) Zbl 07331034

Pulina, Luca (ed.) et al., Theory and applications of satisfiability testing – SAT 2020. 23rd international conference, Alghero, Italy, July 3–10, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12178, 378-393 (2020).
MSC:  68Q25 68R07 68T20
PDF BibTeX XML Cite
Full Text: DOI

Reducing bit-vector polynomials to SAT using Gröbner bases. (English) Zbl 07331033

Pulina, Luca (ed.) et al., Theory and applications of satisfiability testing – SAT 2020. 23rd international conference, Alghero, Italy, July 3–10, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12178, 361-377 (2020).
MSC:  68Q25 68R07 68T20
PDF BibTeX XML Cite
Full Text: DOI

Taming high treewidth with abstraction, nested dynamic programming, and database technology. (English) Zbl 07331032

Pulina, Luca (ed.) et al., Theory and applications of satisfiability testing – SAT 2020. 23rd international conference, Alghero, Italy, July 3–10, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12178, 343-360 (2020).
MSC:  68Q25 68R07 68T20
PDF BibTeX XML Cite
Full Text: DOI

Reasoning about strong inconsistency in ASP. (English) Zbl 07331031

Pulina, Luca (ed.) et al., Theory and applications of satisfiability testing – SAT 2020. 23rd international conference, Alghero, Italy, July 3–10, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12178, 332-342 (2020).
MSC:  68Q25 68R07 68T20
PDF BibTeX XML Cite
Full Text: DOI

On weakening strategies for PB solvers. (English) Zbl 07331030

Pulina, Luca (ed.) et al., Theory and applications of satisfiability testing – SAT 2020. 23rd international conference, Alghero, Italy, July 3–10, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12178, 322-331 (2020).
MSC:  68Q25 68R07 68T20
PDF BibTeX XML Cite
Full Text: DOI arXiv

MaxSAT resolution and subcube sums. (English) Zbl 07331028

Pulina, Luca (ed.) et al., Theory and applications of satisfiability testing – SAT 2020. 23rd international conference, Alghero, Italy, July 3–10, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12178, 295-311 (2020).
MSC:  68Q25 68R07 68T20
PDF BibTeX XML Cite
Full Text: DOI arXiv

Filter Results by …

Document Type

Reviewing State

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Classification

all top 3

Software