×

Found 17 Documents (Results 1–17)

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
PDFBibTeX XMLCite
Full Text: DOI arXiv

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
PDFBibTeX XMLCite
Full Text: DOI

A faster algorithm for propositional model counting parameterized by incidence treewidth. (English) Zbl 07331026

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, 267-276 (2020).
MSC:  68Q25 68R07 68T20
PDFBibTeX XMLCite
Full Text: DOI

SAT-based local improvement for finding tree decompositions of small width. (English) Zbl 1496.68154

Gaspers, Serge (ed.) et al., Theory and applications of satisfiability testing – SAT 2017. 20th international conference, Melbourne, VIC, Australia, August 28 – September 1, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10491, 401-411 (2017).
MSC:  68Q17 68R10 68T20
PDFBibTeX XMLCite
Full Text: DOI

Community structure inspired algorithms for SAT and #SAT. (English) Zbl 1471.68322

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, 223-237 (2015).
PDFBibTeX XMLCite
Full Text: DOI

Satisfiability of acyclic and almost acyclic CNF formulas. (English) Zbl 1245.68112

Lodaya, Kamal (ed.) et al., IARCS annual conference on foundations of software technology and theoretical computer science (FSTTCS 2010), December 15–18, 2010, Chennai, India. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-23-1). LIPIcs – Leibniz International Proceedings in Informatics 8, 84-95, electronic only (2010).
PDFBibTeX XMLCite
Full Text: DOI Link

Backdoor sets of quantified Boolean formulas. (English) Zbl 1214.68372

Marques-Silva, João (ed.) et al., Theory and applications of satisfiability testing – SAT 2007. 10th international conference, Lisbon, Portugal, May 28–31, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-72787-3/pbk). Lecture Notes in Computer Science 4501, 230-243 (2007).
MSC:  68T20 68Q17 68Q25
PDFBibTeX XMLCite
Full Text: DOI

Matched formulas and backdoor sets. (English) Zbl 1187.68253

Marques-Silva, João (ed.) et al., Theory and applications of satisfiability testing – SAT 2007. 10th international conference, Lisbon, Portugal, May 28–31, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-72787-3/pbk). Lecture Notes in Computer Science 4501, 94-99 (2007).
MSC:  68Q17 68Q25 68T15 68T20
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Year of Publication

Main Field

all top 3

Software