×

Found 84 Documents (Results 1–84)

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

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

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 arXiv

Truth assignments as conditional autarkies. (English) Zbl 1437.68132

Chen, Yu-Fang (ed.) et al., Automated technology for verification and analysis. 17th international symposium, ATVA 2019, Taipei, Taiwan, October 28–31, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11781, 48-64 (2019).
MSC:  68R07
PDF BibTeX XML Cite
Full Text: DOI

Decomposing SAT instances with pseudo backbones. (English) Zbl 1453.68170

Hu, Bin (ed.) et al., Evolutionary computation in combinatorial optimization. 17th European conference, EvoCOP 2017, Amsterdam, The Netherlands, April 19–21, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10197, 75-90 (2017).
MSC:  68T20 68R07 90C59
PDF BibTeX XML Cite
Full Text: DOI

Constraint CNF: SAT and CSP language under one roof. (English) Zbl 1428.68284

Carro, Manuel (ed.) et al., Technical communications of the 32nd international conference on logic programming, ICLP 2016, October 16–21, 2016, New York, NY, USA. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. OASIcs – OpenAccess Ser. Inform. 52, Article 12, 15 p. (2016).
MSC:  68T27 03B05 68T20
PDF BibTeX XML Cite
Full Text: DOI

LMHS: a SAT-IP hybrid MaxSat solver. (English) Zbl 1475.68449

Creignou, Nadia (ed.) et al., Theory and applications of satisfiability testing – SAT 2016. 19th international conference, Bordeaux, France, July 5–8, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9710, 539-546 (2016).
MSC:  68V15 68T20
PDF BibTeX XML Cite
Full Text: DOI

Predicate elimination for preprocessing in first-order theorem proving. (English) Zbl 1475.68441

Creignou, Nadia (ed.) et al., Theory and applications of satisfiability testing – SAT 2016. 19th international conference, Bordeaux, France, July 5–8, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9710, 361-372 (2016).
MSC:  68V15
PDF BibTeX XML Cite
Full Text: DOI

Finding finite models in multi-sorted first-order logic. (English) Zbl 1475.68447

Creignou, Nadia (ed.) et al., Theory and applications of satisfiability testing – SAT 2016. 19th international conference, Bordeaux, France, July 5–8, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9710, 323-341 (2016).
MSC:  68V15 03C13 68T20
PDF BibTeX XML Cite
Full Text: DOI arXiv

Synthesis of domain specific CNF encoders for bit-vector solvers. (English) Zbl 1475.68439

Creignou, Nadia (ed.) et al., Theory and applications of satisfiability testing – SAT 2016. 19th international conference, Bordeaux, France, July 5–8, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9710, 302-320 (2016).
MSC:  68V15
PDF BibTeX XML Cite
Full Text: DOI Link

Solving and verifying the Boolean Pythagorean triples problem via cube-and-conquer. (English) Zbl 1403.68226

Creignou, Nadia (ed.) et al., Theory and applications of satisfiability testing – SAT 2016. 19th international conference, Bordeaux, France, July 5–8, 2016. Proceedings. Cham: Springer (ISBN 978-3-319-40969-6/pbk; 978-3-319-40970-2/ebook). Lecture Notes in Computer Science 9710, 228-245 (2016).
MSC:  68T15 05D10 68T20
PDF BibTeX XML Cite
Full Text: DOI arXiv Link

On the hardness of SAT with community structure. (English) Zbl 1475.68353

Creignou, Nadia (ed.) et al., Theory and applications of satisfiability testing – SAT 2016. 19th international conference, Bordeaux, France, July 5–8, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9710, 141-159 (2016).
MSC:  68T20 68Q17
PDF BibTeX XML Cite
Full Text: DOI arXiv

Evaluating CDCL variable scoring schemes. (English) Zbl 1471.68238

Heule, Marijn (ed.) et al., Theory and applications of satisfiability testing – SAT 2015. 18th international conference, Austin, TX, USA, September 24–27, 2015. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9340, 405-422 (2015).
MSC:  68T20
PDF BibTeX XML Cite
Full Text: DOI

Recognition of nested gates in CNF formulas. (English) Zbl 1471.68246

Heule, Marijn (ed.) et al., Theory and applications of satisfiability testing – SAT 2015. 18th international conference, Austin, TX, USA, September 24–27, 2015. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9340, 255-271 (2015).
MSC:  68T20
PDF BibTeX XML Cite
Full Text: DOI

Preprocessing for DQBF. (English) Zbl 1471.68264

Heule, Marijn (ed.) et al., Theory and applications of satisfiability testing – SAT 2015. 18th international conference, Austin, TX, USA, September 24–27, 2015. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9340, 173-190 (2015).
MSC:  68T20
PDF BibTeX XML Cite
Full Text: DOI

PBLib – a library for encoding pseudo-Boolean constraints into CNF. (English) Zbl 1471.68261

Heule, Marijn (ed.) et al., Theory and applications of satisfiability testing – SAT 2015. 18th international conference, Austin, TX, USA, September 24–27, 2015. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9340, 9-16 (2015).
MSC:  68T20
PDF BibTeX XML Cite
Full Text: DOI

The complexity of inverting explicit Goldreich’s function by DPLL algorithms. (English. Russian original) Zbl 1261.68171

J. Math. Sci., New York 188, No. 1, 47-58 (2013); translation from Zap. Nauchn. Semin. POMI 399, 88-108 (2012).
MSC:  68W40 68Q17
PDF BibTeX XML Cite
Full Text: DOI

Algorithms for solving satisfiability problems with qualitative preferences. (English) Zbl 1357.68206

Erdem, Esra (ed.) et al., Correct reasoning. Essays on logic-based AI in honour of Vladimir Lifschitz. Berlin: Springer (ISBN 978-3-642-30742-3/pbk). Lecture Notes in Computer Science 7265, 327-344 (2012).
MSC:  68T20
PDF BibTeX XML Cite
Full Text: DOI

Experimental study of the shortest reset word of random automata. (English) Zbl 1297.68167

Bouchou-Markhoff, Béatrice (ed.) et al., Implementation and application of automata. 16th international conference, CIAA 2011, Blois, France, July 13–16, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22255-9/pbk). Lecture Notes in Computer Science 6807, 290-298 (2011).
MSC:  68Q45
PDF BibTeX XML Cite
Full Text: DOI Link

Blocked clause elimination for QBF. (English) Zbl 1341.68181

Bjørner, Nikolaj (ed.) et al., Automated deduction – CADE-23. 23rd international conference on automated deduction, Wrocław, Poland, July 31 – August 5, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22437-9/pbk; 978-3-642-22438-6/ebook). Lecture Notes in Computer Science 6803. Lecture Notes in Artificial Intelligence, 101-115 (2011).
MSC:  68T15 03B05
PDF BibTeX XML Cite
Full Text: DOI Link

Efficient CNF simplification based on binary implication graphs. (English) Zbl 1330.68269

Sakallah, Karem A. (ed.) et al., Theory and applications of satisfiability testing – SAT 2011. 14th international conference, SAT 2011, Ann Arbor, MI, USA, June 19–22, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-21580-3/pbk). Lecture Notes in Computer Science 6695, 201-215 (2011).
MSC:  68T20 03B05 68T15
PDF BibTeX XML Cite
Full Text: DOI Link

On freezing and reactivating learnt clauses. (English) Zbl 1330.68267

Sakallah, Karem A. (ed.) et al., Theory and applications of satisfiability testing – SAT 2011. 14th international conference, SAT 2011, Ann Arbor, MI, USA, June 19–22, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-21580-3/pbk). Lecture Notes in Computer Science 6695, 188-200 (2011).
MSC:  68T20
PDF BibTeX XML Cite
Full Text: DOI Link

SAT-based model checking without unrolling. (English) Zbl 1317.68109

Jhala, Ranjit (ed.) et al., Verification, model checking, and abstract interpretation. 12th international conference, VMCAI 2011, Austin, TX, USA, January 23–25, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-18274-7/pbk). Lecture Notes in Computer Science 6538, 70-87 (2011).
MSC:  68Q60
PDF BibTeX XML Cite
Full Text: DOI Link

Finding lean induced cycles in binary hypercubes. (English) Zbl 1247.68248

Kullmann, Oliver (ed.), Theory and applications of satisfiability testing – SAT 2009. 12th international conference, SAT 2009, Swansea, UK, June 30–July 3, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-02776-5/pbk). Lecture Notes in Computer Science 5584, 18-31 (2009).
MSC:  68T20
PDF BibTeX XML Cite
Full Text: DOI Link

Automatic termination. (English) Zbl 1242.68143

Treinen, Ralf (ed.), Rewriting techniques and applications. 20th international conference, RTA 2009, Brasília, Brazil, June 29–July 1, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-02347-7/pbk). Lecture Notes in Computer Science 5595, 1-16 (2009).
MSC:  68Q42 68Q45 68T15
PDF BibTeX XML Cite
Full Text: DOI

LCF-style propositional simplification with BDDs and SAT solvers. (English) Zbl 1165.68443

Mohamed, Otmane Ait (ed.) et al., Theorem proving in higher order logics. 21st international conference, TPHOLs 2008, Montreal, Canada, August 18–21, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-71065-3/pbk). Lecture Notes in Computer Science 5170, 55-70 (2008).
MSC:  68T15
PDF BibTeX XML Cite
Full Text: DOI

Filter Results by …

Document Type

Reviewing State

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software