×

Found 54 Documents (Results 1–54)

DRMaxSAT with MaxHS: first contact. (English) Zbl 1441.68232

Janota, Mikoláš (ed.) et al., Theory and applications of satisfiability testing – SAT 2019. 22nd international conference, SAT 2019, Lisbon, Portugal, July 9–12, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11628, 239-249 (2019).
MSC:  68T20 68R07
PDFBibTeX XMLCite
Full Text: DOI

On computing the union of MUSes. (English) Zbl 1441.68230

Janota, Mikoláš (ed.) et al., Theory and applications of satisfiability testing – SAT 2019. 22nd international conference, SAT 2019, Lisbon, Portugal, July 9–12, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11628, 211-221 (2019).
MSC:  68T20 68R07
PDFBibTeX XMLCite
Full Text: DOI Link

A SAT-based approach to learn explainable decision sets. (English) Zbl 1511.68249

Galmiche, Didier (ed.) et al., Automated reasoning. 9th international joint conference, IJCAR 2018, held as part of the federated logic conference, FloC 2018, Oxford, UK, July 14–17, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10900, 627-645 (2018).
MSC:  68T20 68T05
PDFBibTeX XMLCite
Full Text: DOI

PySAT: a Python toolkit for prototyping with SAT oracles. (English) Zbl 1484.68215

Beyersdorff, Olaf (ed.) et al., Theory and applications of satisfiability testing – SAT 2018. 21st international conference, SAT 2018, held as part of the Federated Logic Conference, FloC 2018, Oxford, UK, July 9–12, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10929, 428-437 (2018).
MSC:  68T20 68V15
PDFBibTeX XMLCite
Full Text: DOI

SAT-based Horn least upper bounds. (English) Zbl 1471.68256

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

SAT-based formula simplification. (English) Zbl 1471.68245

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, 287-298 (2015).
MSC:  68T20 03B05
PDFBibTeX XMLCite
Full Text: DOI

Computing maximal autarkies with few and simple oracle queries. (English) Zbl 1471.68250

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, 138-155 (2015).
MSC:  68T20
PDFBibTeX XMLCite
Full Text: DOI arXiv

Progression in maximum satisfiability. (English) Zbl 1366.68266

Schaub, Torsten (ed.) et al., ECAI 2014. 21st European conference on artificial intelligence, Prague, Czech Republic, August 18–22, 2014. Proceedings. Including proceedings of the accompanied concerence on prestigious applications of intelligent systems (PAIS 2014). Amsterdam: IOS Press (ISBN 978-1-61499-418-3/pbk; 978-1-61499-419-0/ebook). Frontiers in Artificial Intelligence and Applications 263, 453-458 (2014).
MSC:  68T20
PDFBibTeX XMLCite
Full Text: Link

On reducing maximum independent set to minimum satisfiability. (English) Zbl 1423.68452

Sinz, Carsten (ed.) et al., Theory and applications of satisfiability testing – SAT 2014. 17th international conference, held as part of the Vienna summer of logic, VSL 2014, Vienna, Austria, July 14–17, 2014. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 8561, 103-120 (2014).
MSC:  68T20 05C69 68Q25
PDFBibTeX XMLCite
Full Text: DOI

On computing preferred MUSes and MCSes. (English) Zbl 1423.68460

Sinz, Carsten (ed.) et al., Theory and applications of satisfiability testing – SAT 2014. 17th international conference, held as part of the Vienna summer of logic, VSL 2014, Vienna, Austria, July 14–17, 2014. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 8561, 58-74 (2014).
MSC:  68T20 68Q25 68T15
PDFBibTeX XMLCite
Full Text: DOI

MUS extraction using clausal proofs. (English) Zbl 1423.68436

Sinz, Carsten (ed.) et al., Theory and applications of satisfiability testing – SAT 2014. 17th international conference, held as part of the Vienna summer of logic, VSL 2014, Vienna, Austria, July 14–17, 2014. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 8561, 48-57 (2014).
MSC:  68T20 68Q25 68T15
PDFBibTeX XMLCite
Full Text: DOI

On QBF proofs and preprocessing. (English) Zbl 1407.68454

McMillan, Ken (ed.) et al., Logic for programming, artificial intelligence, and reasoning. 19th international conference, LPAR-19, Stellenbosch, South Africa, December 14–19, 2013. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 8312, 473-489 (2013).
MSC:  68T20
PDFBibTeX XMLCite
Full Text: DOI arXiv

Maximal falsifiability. Definitions, algorithms, and applications. (English) Zbl 1407.68453

McMillan, Ken (ed.) et al., Logic for programming, artificial intelligence, and reasoning. 19th international conference, LPAR-19, Stellenbosch, South Africa, December 14–19, 2013. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 8312, 439-456 (2013).
MSC:  68T20
PDFBibTeX XMLCite
Full Text: DOI

SAT-based preprocessing for MaxSAT. (English) Zbl 1406.68108

McMillan, Ken (ed.) et al., Logic for programming, artificial intelligence, and reasoning. 19th international conference, LPAR-19, Stellenbosch, South Africa, December 14–19, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-45220-8/pbk). Lecture Notes in Computer Science 8312, 96-111 (2013).
MSC:  68T20
PDFBibTeX XMLCite
Full Text: DOI arXiv

Quantified maximum satisfiability: a core-guided approach. (English) Zbl 1390.68598

Järvisalo, Matti (ed.) et al., Theory and applications of satisfiability testing – SAT 2013. 16th international conference, Helsinki, Finland, July 8–12, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-39070-8/pbk). Lecture Notes in Computer Science 7962, 250-266 (2013).
MSC:  68T20
PDFBibTeX XMLCite
Full Text: DOI

Parallel MUS extraction. (English) Zbl 1390.68588

Järvisalo, Matti (ed.) et al., Theory and applications of satisfiability testing – SAT 2013. 16th international conference, Helsinki, Finland, July 8–12, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-39070-8/pbk). Lecture Notes in Computer Science 7962, 133-149 (2013).
MSC:  68T20 68T15
PDFBibTeX XMLCite
Full Text: DOI

Improvements to core-guided binary search for MaxSAT. (English) Zbl 1273.68357

Cimatti, Alessandro (ed.) et al., Theory and applications of satisfiability testing – SAT 2012. 15th international conference, Trento, Italy, June 17–20, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-31611-1/pbk). Lecture Notes in Computer Science 7317, 284-297 (2012).
MSC:  68T20
PDFBibTeX XMLCite
Full Text: DOI Link

Knowledge compilation with empowerment. (English) Zbl 1302.68248

Bieliková, Mária (ed.) et al., SOFSEM 2012: Theory and practice of computer science. 38th conference on current trends in theory and practice of computer science, Špindlerův Mlýn, Czech Republic, January 21–27, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-27659-0/pbk). Lecture Notes in Computer Science 7147, 612-624 (2012).
MSC:  68T20
PDFBibTeX XMLCite
Full Text: DOI Link

Empirical study of the anatomy of modern SAT solvers. (English) Zbl 1330.68271

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, 343-356 (2011).
MSC:  68T20 68T15
PDFBibTeX XMLCite
Full Text: DOI

On improving MUS extraction algorithms. (English) Zbl 1330.68273

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, 159-173 (2011).
MSC:  68T20 68T15
PDFBibTeX XMLCite
Full Text: DOI

Minimally unsatisfiable Boolean circuits. (English) Zbl 1330.68268

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, 145-158 (2011).
MSC:  68T20 03B05 68T15 94C10
PDFBibTeX XMLCite
Full Text: DOI

On computing backbones of propositional theories. (English) Zbl 1211.68389

Coelho, Helder (ed.) et al., ECAI 2010. 19th European conference on artificial intelligence, August 16–20, 2010 Lisbon, Portugal. Including proceedings of the 6th prestigious applications of artificial intelligence (PAIS-2010). Amsterdam: IOS Press (ISBN 978-1-60750-605-8/pbk; 978-1-60750-606-5/ebook). Frontiers in Artificial Intelligence and Applications 215, 15-20 (2010).
MSC:  68T20 68Q60
PDFBibTeX XMLCite
Full Text: DOI

Algorithms for weighted Boolean optimization. (English) Zbl 1247.68258

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, 495-508 (2009).
MSC:  68T20
PDFBibTeX XMLCite
Full Text: DOI

Symmetry breaking for maximum satisfiability. (English) Zbl 1182.68257

Cervesato, Iliano (ed.) et al., Logic for programming, artificial intelligence, and reasoning. 15th international conference, LPAR 2008, Doha, Qatar, November 22–27, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-89438-4/pbk). Lecture Notes in Computer Science 5330. Lecture Notes in Artificial Intelligence, 1-15 (2008).
MSC:  68T20
PDFBibTeX XMLCite
Full Text: DOI Link

Towards more effective unsatisfiability-based maximum satisfiability algorithms. (English) Zbl 1138.68548

Kleine Büning, Hans (ed.) et al., Theory and applications of satisfiability testing – SAT 2008. 11th international conference, SAT 2008, Guangzhou, China, May 12–15, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-79718-0/pbk). Lecture Notes in Computer Science 4996, 225-230 (2008).
MSC:  68T20
PDFBibTeX XMLCite
Full Text: DOI Link

Improvements to hybrid incremental SAT algorithms. (English) Zbl 1138.68544

Kleine Büning, Hans (ed.) et al., Theory and applications of satisfiability testing – SAT 2008. 11th international conference, SAT 2008, Guangzhou, China, May 12–15, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-79718-0/pbk). Lecture Notes in Computer Science 4996, 168-181 (2008).
MSC:  68T20
PDFBibTeX XMLCite
Full Text: DOI Link

Towards robust CNF encodings of cardinality constraints. (English) Zbl 1145.68525

Bessière, Christian (ed.), Principles and practice of constraint programming – CP 2007. 13th international conference, CP 2007, Providence, RI, USA, September 23–27, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-74969-1/pbk). Lecture Notes in Computer Science 4741, 483-497 (2007).
MSC:  68T20
PDFBibTeX XMLCite
Full Text: DOI Link

Categorisation of clauses in conjunctive normal forms: minimally unsatisfiable sub-clause-sets and the lean kernel. (English) Zbl 1187.68552

Biere, Armin (ed.) et al., Theory and applications of satisfiability testing – SAT 2006. 9th international conference, Seattle, WA, USA, August 12–15, 2006. Proceedings. Berlin: Springer (ISBN 3-540-37206-7/pbk). Lecture Notes in Computer Science 4121, 22-35 (2006).
MSC:  68T20
PDFBibTeX XMLCite
Full Text: DOI Link

A branch-and-bound algorithm for extracting smallest minimal unsatisfiable formulas. (English) Zbl 1128.68477

Bacchus, Fahiem (ed.) et al., Theory and applications of satisfiability testing. 8th international conference, SAT 2005, St Andrews, UK, June 19–23, 2005. Proceedings. Berlin: Springer (ISBN 3-540-26276-8/pbk). Lecture Notes in Computer Science 3569, 467-474 (2005).
MSC:  68T20 90C57 90C59
PDFBibTeX XMLCite
Full Text: DOI

On applying cutting planes in DLL-based algorithms for pseudo-Boolean optimization. (English) Zbl 1128.68474

Bacchus, Fahiem (ed.) et al., Theory and applications of satisfiability testing. 8th international conference, SAT 2005, St Andrews, UK, June 19–23, 2005. Proceedings. Berlin: Springer (ISBN 3-540-26276-8/pbk). Lecture Notes in Computer Science 3569, 451-458 (2005).
MSC:  68T20 90C09
PDFBibTeX XMLCite
Full Text: DOI

Heuristic-based backtracking for propositional satisfiability. (English) Zbl 1205.68370

Moura Pires, Fernando (ed.) et al., Progress in artificial intelligence. 11th Portuguese conference on artificial intelligence, EPIA 2003, Beja, Portugal, December 4–7, 2003. Proceedings. Berlin: Springer (ISBN 3-540-20589-6/pbk). Lect. Notes Comput. Sci. 2902, 116-130 (2003).
MSC:  68T20
PDFBibTeX XMLCite
Full Text: DOI

The effect of nogood recording in DPLL-CBJ SAT algorithms. (English) Zbl 1023.68669

O’Sullivan, Barry (ed.), Recent advances in constraints. Joint ERCIM/CologNet international workshop on constraint solving and constraint logic programming, Cork, Ireland, June 19-21, 2002. Selected papers. Berlin: Springer. Lect. Notes Comput. Sci. 2627, 144-158 (2003).
MSC:  68T20
PDFBibTeX XMLCite
Full Text: Link

Towards provably complete stochastic search algorithms for satisfiability. (English) Zbl 1053.68684

Brazdil, Pavel (ed.) et al., Progress in artificial intelligence. Knowledge extraction, multi-agent systems, logic programming, and constraint solving. 10th Portuguese conference, EPIA 2001, Porto, Portugal, December 17–20, 2001. Proceedings. Berlin: Springer (ISBN 3-540-43030-X). Lect. Notes Comput. Sci. 2258, 363-370 (2001).
MSC:  68T20
PDFBibTeX XMLCite
Full Text: Link

Improving SAT algorithms by using search pruning techniques. (English) Zbl 1067.68650

Walsh, Toby (ed.), Principles and practice of constraint programming - CP 2001. 7th international conference, Paphos, Cyprus, November 26 – December 1, 2001. Proceedings. Berlin: Springer (ISBN 3-540-42863-1). Lect. Notes Comput. Sci. 2239, 770 (2001).
MSC:  68T20
PDFBibTeX XMLCite
Full Text: Link

Algebraic simplification techniques for propositional satisfiability. (English) Zbl 1044.68781

Dechter, Rina (ed.), Principles and practice of constraint programming - CP 2000. 6th international conference, Singapore, September 18–21, 2000. Proceedings. Berlin: Springer (ISBN 3-540-41053-8). Lect. Notes Comput. Sci. 1894, 537-542 (2000).
MSC:  68T20
PDFBibTeX XMLCite
Full Text: Link

Using randomization and learning to solve hard real-world instances of satisfiability. (English) Zbl 1044.68736

Dechter, Rina (ed.), Principles and practice of constraint programming - CP 2000. 6th international conference, Singapore, September 18–21, 2000. Proceedings. Berlin: Springer (ISBN 3-540-41053-8). Lect. Notes Comput. Sci. 1894, 489-494 (2000).
MSC:  68T20 68T05 68T27
PDFBibTeX XMLCite
Full Text: Link

Filter Results by …

Document Type

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software