×

Found 45 Documents (Results 1–45)

Constrained image generation using binarized neural networks with decision procedures. (English) Zbl 1511.68297

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, 438-449 (2018).
MSC:  68U10 68T05 68T20
PDFBibTeX XMLCite
Full Text: DOI arXiv

The seventh QBF solvers evaluation (QBFEVAL’10). (English) Zbl 1306.68173

Strichman, Ofer (ed.) et al., Theory and applications of satisfiability testing – SAT 2010. 13th international conference, SAT 2010, Edinburgh, UK, July 11–14, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-14185-0/pbk). Lecture Notes in Computer Science 6175, 237-250 (2010).
MSC:  68T20 68T15
PDFBibTeX XMLCite
Full Text: DOI

Learning to integrate deduction and search in reasoning about quantified Boolean formulas. (English) Zbl 1193.68214

Ghilardi, Silvio (ed.) et al., Frontiers of combining systems. 7th international symposium, FroCoS 2009, Trento, Italy, September 16–18, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-04221-8/pbk). Lecture Notes in Computer Science 5749. Lecture Notes in Artificial Intelligence, 350-365 (2009).
MSC:  68T05 68T15 68T20
PDFBibTeX XMLCite
Full Text: DOI

Treewidth: A useful marker of empirical hardness in quantified Boolean logic encodings. (English) Zbl 1182.68263

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, 528-542 (2008).
MSC:  68T20 68Q25
PDFBibTeX XMLCite
Full Text: DOI

SAT-based decision procedures for automated reasoning: A unifying perspective. (English) Zbl 1098.68693

Hutter, Dieter (ed.) et al., Mechanizing mathematical reasoning. Essays in honor of Jörg H. Siekmann on the occasion of his 60th birthday. Berlin: Springer (ISBN 3-540-25051-4/pbk). Lecture Notes in Computer Science 2605. Lecture Notes in Artificial Intelligence, 46-58 (2005).
MSC:  68T15 03B35 68T20
PDFBibTeX XMLCite
Full Text: DOI

QBF reasoning on real-world instances. (English) Zbl 1122.68596

Hoos, Holger H. (ed.) et al., Theory and applications of satisfiability testing. 7th international conference, SAT 2004, Vancouver, BC, Canada, May 10–13, 2004. Revised selected papers. Berlin: Springer (ISBN 3-540-27829-X/pbk). Lecture Notes in Computer Science 3542, 105-121 (2005).
MSC:  68T20
PDFBibTeX XMLCite
Full Text: DOI

The second QBF solvers comparative evaluation. (English) Zbl 1122.68608

Hoos, Holger H. (ed.) et al., Theory and applications of satisfiability testing. 7th international conference, SAT 2004, Vancouver, BC, Canada, May 10–13, 2004. Revised selected papers. Berlin: Springer (ISBN 3-540-27829-X/pbk). Lecture Notes in Computer Science 3542, 376-392 (2005).
MSC:  68T20
PDFBibTeX XMLCite
Full Text: DOI

Challenges in the QBF arena: The SAT’03 evaluation of QBF solvers. (English) Zbl 1204.68204

Giunchiglia, Enrico (ed.) et al., Theory and applications of satisfiability testing. 6th international conference, SAT 2003, Santa Margherita Ligure, Italy, May 5–8, 2003. Selected revised papers. Berlin: Springer (ISBN 3-540-20851-8/pbk). Lect. Notes Comput. Sci. 2919, 468-485 (2004).
MSC:  68T20
PDFBibTeX XMLCite
Full Text: DOI

Watched data structures for QBF solvers. (English) Zbl 1204.68195

Giunchiglia, Enrico (ed.) et al., Theory and applications of satisfiability testing. 6th international conference, SAT 2003, Santa Margherita Ligure, Italy, May 5–8, 2003. Selected revised papers. Berlin: Springer (ISBN 3-540-20851-8/pbk). Lect. Notes Comput. Sci. 2919, 25-36 (2004).
MSC:  68T20 68P05
PDFBibTeX XMLCite
Full Text: DOI

Monotone literals and learning in QBF reasoning. (English) Zbl 1152.68554

Wallace, Mark (ed.), Principles and practice of constraint programming – CP 2004. 10th international conference, CP 2004, Toronto, Canada, September 27–October 1, 2004. Proceedings. Berlin: Springer (ISBN 978-3-540-23241-4/pbk). Lecture Notes in Computer Science 3258, 260-273 (2004).
MSC:  68T20 68T05
PDFBibTeX XMLCite
Full Text: DOI

QuBE++: An efficient QBF solver. (English) Zbl 1117.68488

Hu, Alan J. (ed.) et al., Formal methods in computer-aided design. 5th international conference, FMCAD 2004, Austin, Texas, USA, November 15–17, 2004. Proceedings. Berlin: Springer (ISBN 3-540-23738-0/pbk). Lecture Notes in Computer Science 3312, 201-213 (2004).
MSC:  68T20 68T15
PDFBibTeX XMLCite
Full Text: DOI

Theory and applications of satisfiability testing. 6th international conference, SAT 2003, Santa Margherita Ligure, Italy, May 5–8, 2003. Selected revised papers. (English) Zbl 1030.00034

Lecture Notes in Computer Science. 2919. Berlin: Springer. xi, 530 p. (2004).
MSC:  00B25 68-06 68T20 68T15
PDFBibTeX XMLCite
Full Text: DOI Link

Integrating BDD-based and SAT-based symbolic model checking. (English) Zbl 1057.68623

Armando, Alessandro (ed.), Frontiers of combining systems. 4th international workshop, FroCos 2002, Santa Margherita Ligure, Italy, April 8–10, 2002. Proceedings. Berlin: Springer (ISBN 3-540-43381-3). Lect. Notes Comput. Sci. 2309, 49-56 (2002).
MSC:  68Q60 68T15 68W30
PDFBibTeX XMLCite
Full Text: Link

Dependent and independent variables in propositional satisfiability. (English) Zbl 1014.68528

Flesca, Sergio (ed.) et al., Logics in artificial intelligence. 8th European conference, JELIA 2002, Cosenza, Italy, September 23-26, 2002. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2424, 296-307 (2002).
MSC:  68T15 68T20 68T27 03B05 03B35
PDFBibTeX XMLCite
Full Text: Link

NuSMV 2: An OpenSource tool for symbolic model checking. (English) Zbl 1010.68766

Brinksma, Ed (ed.) et al., Computer aided verification. 14th international conference, CAV 2002, Copenhagen, Denmark, July 27-31, 2002. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2404, 359-364 (2002).
MSC:  68U99 68Q60
PDFBibTeX XMLCite
Full Text: Link

An analysis of backjumping and trivial truth in quantified Boolean formulas satisfiability. (English) Zbl 1007.68577

Esposito, Floriana (ed.), AI*IA 2001: Advances in artificial intelligence. 7th congress of the Italian Association for Artificial Intelligence, Bari, Italy, September 25-28, 2001. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2175, 111-122 (2001).
MSC:  68T15
PDFBibTeX XMLCite
Full Text: Link

QUBE: A system for deciding quantified Boolean formulas satisfiability. (English) Zbl 0988.68598

Goré, Rajeev (ed.) et al., Automated reasoning. 1st international joint conference, IJCAR 2001, Siena, Italy, June 18-22, 2001. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2083, 364-369 (2001).
MSC:  68T15
PDFBibTeX XMLCite
Full Text: Link

Evaluating search heuristics and optimization techniques in propositional satisfiability. (English) Zbl 0988.68608

Goré, Rajeev (ed.) et al., Automated reasoning. 1st international joint conference, IJCAR 2001, Siena, Italy, June 18-22, 2001. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2083, 347-363 (2001).
MSC:  68T15 68T20
PDFBibTeX XMLCite
Full Text: Link

Towards an efficient library for SAT: A manifesto. (English) Zbl 0990.90559

Kautz, Henry (ed.) et al., LICS 2001 workshop on theory and application of satisfiability testing (SAT 2001). Boston, MA, USA, June 14-15, 2001. Amsterdam: Elsevier, Electron. Notes Discrete Math. 9, no pag., electronic only (2001).
MSC:  90C27 90C59
PDFBibTeX XMLCite

Getting to the airport: The oldest planning problem in AI. (English) Zbl 0979.68099

Minker, Jack (ed.), Logic-based artificial intelligence. Proceedings of a workshop, Washington, DC, USA, June 1999. Dordrecht: Kluwer Academic Publishers. Kluwer Int. Ser. Eng. Comput. Sci. 597, 147-165 (2000).
MSC:  68T27 68T20
PDFBibTeX XMLCite

System description: *SAT. A platform for the development of modal decision procedures. (English) Zbl 0963.68538

McAllester, David (ed.), Automated deduction - CADE-17. 17th international conference, Pittsburgh, PA, USA, June 17-20, 2000. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1831, 291-296 (2000).
MSC:  68T15 03B45 03B25
PDFBibTeX XMLCite

A subset-matching size-bounded cache for satisfiability in modal logics. (English) Zbl 0963.68178

Dyckhoff, Roy (ed.), Automated reasoning with analytic tableaux and related methods. International conference, TABLEAUX 2000, St Andrews, Scotland, GB, July 3-7, 2000. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1847, 237-251 (2000).
MSC:  68T15 03B45
PDFBibTeX XMLCite

Evaluating *SAT on TANCS 2000 benchmarks. (English) Zbl 0963.68520

Dyckhoff, Roy (ed.), Automated reasoning with analytic tableaux and related methods. International conference, TABLEAUX 2000, St Andrews, Scotland, GB, July 3-7, 2000. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1847, 77-81 (2000).
MSC:  68T15
PDFBibTeX XMLCite

The SAT-based approach for classical modal logics. (English) Zbl 0961.03015

Lamma, Evelina (ed.) et al., AI*IA 99: Advances in artificial intelligence. 6th congress of Italian Association for Artificial Intelligence. Bologna, Italy, September 14-17, 1999. Selected papers. Berlin: Springer. Lect. Notes Comput. Sci. 1792, 95-106 (2000).
MSC:  03B35 03B45 68T15
PDFBibTeX XMLCite

Filter Results by …

Document Type

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software