## Found 1,264 Documents (Results 1–100)

100
MathJax

### Multiagent temporal logics, unification problems, and admissibilities. (English. Russian original)Zbl 07566687

Sib. Math. J. 63, No. 4, 769-776 (2022); translation from Sib. Mat. Zh. 63, No. 4, 924-934 (2022).
MSC:  03Bxx 68Txx 68Nxx
Full Text:

MSC:  68Txx
Full Text:

### Undecidability of the logic of partial quasiary predicates. (English)Zbl 07561917

MSC:  03B70 03B25 03B60
Full Text:

Full Text:

Full Text:

MSC:  68Txx
Full Text:

Full Text:

MSC:  68Qxx
Full Text:

### Parameterised complexity of model checking and satisfiability in propositional dependence logic. (English)Zbl 07473202

MSC:  68Q25 03B70
Full Text:

### The projection games conjecture and the hardness of approximation of Super-SAT and related problems. (English)Zbl 1472.68064

MSC:  68Q17 68R05 68R07
Full Text:

### Complexity of stability. (English)Zbl 1472.68113

MSC:  68R10 68Q25
Full Text:

Full Text:

### 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
Full Text:

### A heuristic prover for elementary analysis in Theorema. (English)Zbl 1485.68284

Kamareddine, Fairouz (ed.) et al., Intelligent computer mathematics. 14th international conference, CICM 2021, Timisoara, Romania, July 26–31, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12833, 130-134 (2021).
Full Text:

### Satisfiability in Boolean logic (SAT problem) is polynomial. (English)Zbl 07510991

MSC:  03D15 68Q25
Full Text:

### Fine-grained reductions from approximate counting to decision. (English)Zbl 07495898

MSC:  68Q25 68W25 68W40
Full Text:

### 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
Full Text:

### 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
Full Text:

### 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
Full Text:

### 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
Full Text:

### A proof builder for Max-SAT. (English)Zbl 07495593

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, 488-498 (2021).
MSC:  68Q25 68R07 68T20
Full Text:

### 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
Full Text:

### 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
Full Text:

### 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
Full Text:

### 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
Full Text:

### 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
Full Text:

### 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
Full Text:

### 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
Full Text:

### 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
Full Text:

### 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
Full Text:

### 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
Full Text:

### 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
Full Text:

### 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
Full Text:

### 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
Full Text:

### 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
Full Text:

### 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
Full Text:

### 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
Full Text:

### 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
Full Text:

### Chinese remainder encoding for Hamiltonian cycles. (English)Zbl 07495575

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, 216-224 (2021).
MSC:  68Q25 68R07 68T20
Full Text:

### 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
Full Text:

### 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
Full Text:

### 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
Full Text:

### 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
Full Text:

### 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
Full Text:

### 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
Full Text:

### Hardness and optimality in QBF proof systems modulo NP. (English)Zbl 07495568

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, 98-115 (2021).
MSC:  68Q25 68R07 68T20
Full Text:

### Hash-based preprocessing and inprocessing techniques in SAT solvers. (English)Zbl 07495567

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, 82-97 (2021).
MSC:  68Q25 68R07 68T20
Full Text:

### 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
Full Text:

### 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
Full Text:

### 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
Full Text:

### 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
Full Text:

### 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
Full Text:

### 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
Full Text:

### 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
Full Text:

### 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
Full Text:

MSC:  68Txx
Full Text:

MSC:  68T20
Full Text:

### SAT competition 2020. (English)Zbl 1478.68320

MSC:  68T20 68R07
Full Text:

MSC:  68Txx
Full Text:

MSC:  68-XX
Full Text:

### 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
Full Text:

### 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).
Full Text:

Full Text:

### Accelerating numerical simulation of continuous-time Boolean satisfiability solver using discrete gradient. (English)Zbl 07382106

MSC:  65Cxx 90Cxx 68Txx
Full Text:

### 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
Full Text:

### 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
Full Text:

### 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).
Full Text:

### 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).
Full Text:

### Branching time logics with multiagent temporal accessibility relations. (English. Russian original)Zbl 1474.68341

Sib. Math. J. 62, No. 3, 503-510 (2021); translation from Sib. Mat. Zh. 62, No. 3, 623-632 (2021).
MSC:  68T27 03B44 68T42
Full Text:

### A satisfiability and workload-based exact method for the resource constrained project scheduling problem with generalized precedence constraints. (English)Zbl 1487.90285

MSC:  90B35 68T20
Full Text:

### Parallel algorithms for minimal nondeterministic finite automata inference. (English)Zbl 1482.68114

MSC:  68Q32 68Q45 68W10
Full Text:

### 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).
Full Text:

### Optimized SAT encoding of conformance checking artefacts. (English)Zbl 1473.68185

MSC:  68T20 68Q85 90B70
Full Text:

Full Text:

### Complexity of finite-variable fragments of products with K. (English)Zbl 07332113

MSC:  03-XX 68-XX
Full Text:

MSC:  68Txx
Full Text:

### 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).
Full Text:

### Complexity of inverse constraint problems and a dichotomy for the inverse satisfiability problem. (English)Zbl 1477.68127

MSC:  68Q25 08A70 68R07
Full Text:

### Generating clause sequences of a CNF formula. (English)Zbl 1476.68186

MSC:  68R05 68Q25 68R07
Full Text:

### Approximating partition functions of bounded-degree Boolean counting constraint satisfaction problems. (English)Zbl 1464.68272

MSC:  68R07 68Q17 68Q25
Full Text:

### 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
Full Text:

### 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
Full Text:

Full Text:

### 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
Full Text:

### 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
Full Text:

### 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
Full Text:

### 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
Full Text:

### 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
Full Text:

### 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
Full Text:

### 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
Full Text:

### 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
Full Text:

### 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
Full Text:

### 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
Full Text:

### 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
Full Text:

### 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
Full Text:

### 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
Full Text:

### 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
Full Text:

### 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
Full Text:

### A lower bound on DNNF encodings of pseudo-Boolean constraints. (English)Zbl 07331029

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, 312-321 (2020).
MSC:  68Q25 68R07 68T20
Full Text:

### 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
Full Text:

all top 5

all top 5

all top 5

all top 3

all top 3