×

Found 109 Documents (Results 1–100)

An empirical study of branching heuristics through the lens of global learning rate. (English) Zbl 1496.68304

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, 119-135 (2017).
MSC:  68T20 68T05
PDFBibTeX XMLCite
Full Text: DOI

Decision procedures. An algorithmic point of view. 2nd edition. (English) Zbl 1358.68002

Texts in Theoretical Computer Science. An EATCS Series. Berlin: Springer (ISBN 978-3-662-50496-3/hbk; 978-3-662-50497-0/ebook). xxi, 356 p. (2016).
MSC:  68-01 68-02 68T15 68T20 68T27
PDFBibTeX XMLCite
Full Text: DOI

Learning rate based branching heuristic for SAT solvers. (English) Zbl 1475.68348

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, 123-140 (2016).
MSC:  68T20 68T05
PDFBibTeX XMLCite
Full Text: DOI

Reducing chaos in SAT-like search: finding solutions close to a given one. (English) Zbl 1330.68266

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, 273-286 (2011).
MSC:  68T20 68Q25
PDFBibTeX XMLCite
Full Text: DOI

Optimization methods for the partner units problem. (English) Zbl 1302.90164

Achterberg, Tobias (ed.) et al., Integration of AI and OR techniques in constraint programming for combinatorial optimization problems. 8th international conference, CPAIOR 2011, Berlin, Germany, May 23–27, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-21310-6/pbk). Lecture Notes in Computer Science 6697, 4-19 (2011).
MSC:  90C27 68T20 90C10
PDFBibTeX XMLCite
Full Text: DOI

Boundary points and resolution. (English) Zbl 1247.68234

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, 147-160 (2009).
MSC:  68T15
PDFBibTeX XMLCite
Full Text: DOI

Clause-learning algorithms with many restarts and bounded-width resolution. (English) Zbl 1247.68245

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, 114-127 (2009).
MSC:  68T20 68T05 68T15
PDFBibTeX XMLCite
Full Text: DOI arXiv

Efficient generation of unsatisfiability proofs and cores in SAT. (English) Zbl 1182.68215

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, 16-30 (2008).
MSC:  68T20 68T15
PDFBibTeX XMLCite
Full Text: DOI

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

A decision-making procedure for resolution-based SAT-solvers. (English) Zbl 1138.68539

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, 119-132 (2008).
MSC:  68T20 68T15
PDFBibTeX XMLCite
Full Text: DOI

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

Experimenting with look-back heuristics for hard ASP programs. (English) Zbl 1149.68330

Baral, Chitta (ed.) et al., Logic programming and nonmonotonic reasoning. 9th international conference, LPNMR 2007, Tempe, AZ, USA, May 15–17, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-72199-4/pbk). Lecture Notes in Computer Science 4483. Lecture Notes in Artificial Intelligence, 110-122 (2007).
MSC:  68N17 68T15 68T20
PDFBibTeX XMLCite
Full Text: DOI

A Gröbner basis approach to CNF-formulae preprocessing. (English) Zbl 1186.68576

Grumberg, Orna (ed.) et al., Tools and algorithms for the construction and analysis of systems. 13th international conference, TACAS 2007, held as part of the joint European conferences on theory and practice of software, ETAPS 2007, Braga, Portugal, March 24 – April 1, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-71208-4/pbk). Lecture Notes in Computer Science 4424, 618-631 (2007).
MSC:  68W30 68T15 68T20
PDFBibTeX XMLCite
Full Text: DOI

A Boolean encoding including SAT and \(n\)-ary CSPs. (English) Zbl 1158.68496

Euzenat, Jérôme (ed.) et al., Artificial intelligence: Methodology, systems, and applications. 12th international conference, AIMSA 2006, Varna, Bulgaria, September 12–15, 2006. Proceedings. Berlin: Springer (ISBN 978-3-540-40930-4/pbk). Lecture Notes in Computer Science 4183. Lecture Notes in Artificial Intelligence, 33-44 (2006).
MSC:  68T20 68T27 68T30
PDFBibTeX XMLCite
Full Text: DOI

Determinization of resolution by an algorithm operating on complete assignments. (English) Zbl 1187.68543

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, 90-95 (2006).
MSC:  68T20 68T15
PDFBibTeX XMLCite
Full Text: DOI

A scalable algorithm for minimal unsatisfiable core extraction. (English) Zbl 1187.68538

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, 36-41 (2006).
MSC:  68T20 68Q60
PDFBibTeX XMLCite
Full Text: DOI arXiv

Applications of SAT solvers to cryptanalysis of hash functions. (English) Zbl 1187.94028

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, 102-115 (2006).
MSC:  94A60 68T20
PDFBibTeX XMLCite
Full Text: DOI

Fast and flexible difference constraint propagation for DPLL(T). (English) Zbl 1187.68537

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, 170-183 (2006).
MSC:  68T20 68T15
PDFBibTeX XMLCite
Full Text: DOI

Satisfiability checking of non-clausal formulas using general matings. (English) Zbl 1187.68549

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, 75-89 (2006).
MSC:  68T20 68T15
PDFBibTeX XMLCite
Full Text: DOI

Extended resolution proofs for symbolic SAT solving with quantification. (English) Zbl 1187.68550

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, 54-60 (2006).
MSC:  68T20 68T15
PDFBibTeX XMLCite
Full Text: DOI

On solving the partial MAX-SAT problem. (English) Zbl 1187.68540

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, 252-265 (2006).
MSC:  68T20
PDFBibTeX XMLCite
Full Text: DOI

Extended resolution proofs for conjoining BDDs. (English) Zbl 1185.68635

Grigoriev, Dima (ed.) et al., Computer science – theory and applications. First international computer science symposium in Russia, CSR 2006, St. Petersburg, Russia, June 8–12, 2006. Proceedings. Berlin: Springer (ISBN 3-540-34166-8/pbk). Lecture Notes in Computer Science 3967, 600-611 (2006).
MSC:  68T15
PDFBibTeX XMLCite
Full Text: DOI

Building efficient decision procedures on top of SAT solvers. (English) Zbl 1182.68114

Bernardo, Marco (ed.) et al., Formal methods for hardware verification. 6th international school on formal methods for the design of computer, communication, and software systems, SFM 2006, Bertinoro, Italy, May 22–27, 2006. Advanced lectures. Berlin: Springer (ISBN 3-540-34304-0/pbk). Lecture Notes in Computer Science 3965, 144-175 (2006).
MSC:  68Q60 68T15
PDFBibTeX XMLCite
Full Text: DOI

HaifaSat: A new robust SAT solver. (English) Zbl 1176.68120

Ur, Shmuel (ed.) et al., Hardware and software verification and testing. First international Haifa verification conference, Haifa, Israel, November 13–16, 2005. Revised selected papers. Berlin: Springer (ISBN 3-540-32604-9/pbk). Lecture Notes in Computer Science 3875, 76-89 (2006).
MSC:  68Q60 68T20
PDFBibTeX XMLCite
Full Text: DOI

Exploiting unit propagation to compute lower bounds in branch and bound max-SAT solvers. (English) Zbl 1153.68470

van Beek, Peter (ed.), Principles and practice of constraint programming – CP 2005. 11th international conference, CP 2005, Sitges, Spain, October 1–5, 2005. Proceedings. Berlin: Springer (ISBN 978-3-540-29238-8/pbk). Lecture Notes in Computer Science 3709, 403-414 (2005).
MSC:  68T20
PDFBibTeX XMLCite
Full Text: DOI

Another complete local search method for SAT. (English) Zbl 1143.68592

Sutcliffe, Geoff (ed.) et al., Logic for programming, artificial intelligence, and reasoning. 12th international conference, LPAR 2005, Montego Bay, Jamaica, December 2–6, 2005. Proceedings. Berlin: Springer (ISBN 978-3-540-30553-8/pbk). Lecture Notes in Computer Science 3835, 595-605 (2005).
MSC:  68T20
PDFBibTeX XMLCite
Full Text: DOI

Pool resolution and its relation to regular resolution and DPLL with clause learning. (English) Zbl 1143.68582

Sutcliffe, Geoff (ed.) et al., Logic for programming, artificial intelligence, and reasoning. 12th international conference, LPAR 2005, Montego Bay, Jamaica, December 2–6, 2005. Proceedings. Berlin: Springer (ISBN 978-3-540-30553-8/pbk). Lecture Notes in Computer Science 3835, 580-594 (2005).
MSC:  68T15
PDFBibTeX XMLCite
Full Text: DOI

Deciding separation logic formulae by SAT and incremental negative cycle elimination. (English) Zbl 1143.68583

Sutcliffe, Geoff (ed.) et al., Logic for programming, artificial intelligence, and reasoning. 12th international conference, LPAR 2005, Montego Bay, Jamaica, December 2–6, 2005. Proceedings. Berlin: Springer (ISBN 978-3-540-30553-8/pbk). Lecture Notes in Computer Science 3835, 322-336 (2005).
MSC:  68T15 03B35 03B70 68Q60
PDFBibTeX XMLCite
Full Text: DOI

Decision procedures for SAT, SAT modulo theories and beyond. The BarcelogicTools. (English) Zbl 1143.68579

Sutcliffe, Geoff (ed.) et al., Logic for programming, artificial intelligence, and reasoning. 12th international conference, LPAR 2005, Montego Bay, Jamaica, December 2–6, 2005. Proceedings. Berlin: Springer (ISBN 978-3-540-30553-8/pbk). Lecture Notes in Computer Science 3835, 23-46 (2005).
MSC:  68T15 68Q60
PDFBibTeX XMLCite
Full Text: DOI

Analysis of search based algorithms for satisfiability of propositional and quantified Boolean formulas arising from circuit state space diameter problems. (English) Zbl 1122.68619

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, 292-305 (2005).
MSC:  68T20
PDFBibTeX XMLCite
Full Text: DOI

NiVER: Non-increasing variable elimination resolution for preprocessing SAT instances. (English) Zbl 1122.68618

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, 276-291 (2005).
MSC:  68T20 68T15
PDFBibTeX XMLCite
Full Text: DOI

Worst case bounds for some NP-complete modified Horn-SAT problems. (English) Zbl 1122.68614

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, 251-262 (2005).
MSC:  68T20 68Q17
PDFBibTeX XMLCite
Full Text: DOI

A clause-based heuristic for SAT solvers. (English) Zbl 1128.68461

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, 46-60 (2005).
MSC:  68T20 68T15
PDFBibTeX XMLCite
Full Text: DOI

Speedup techniques utilized in modern SAT solvers – an analysis in the MIRA environment. (English) Zbl 1128.68471

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, 437-443 (2005).
MSC:  68T20 68T15
PDFBibTeX XMLCite
Full Text: DOI

Cost-effective hyper-resolution for preprocessing CNF formulas. (English) Zbl 1128.68465

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, 423-429 (2005).
MSC:  68T20 68T15
PDFBibTeX XMLCite
Full Text: DOI

Variable ordering for efficient SAT search by analyzing constraint-variable dependencies. (English) Zbl 1128.68462

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, 415-422 (2005).
MSC:  68T20
PDFBibTeX XMLCite
Full Text: DOI

Heuristics for fast exact model counting. (English) Zbl 1128.68481

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, 226-240 (2005).
MSC:  68T20
PDFBibTeX XMLCite
Full Text: DOI

Random walk with continuously smoothed variable weights. (English) Zbl 1128.68478

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, 203-215 (2005).
MSC:  68T20
PDFBibTeX XMLCite
Full Text: DOI

Efficient conflict analysis for finding all satisfying assignments of a Boolean circuit. (English) Zbl 1087.68631

Halbwachs, Nicolas (ed.) et al., Tools and algorithms for the construction and analysis of systems. 11th international conference, TACAS 2005, held as part of the joint European conference on theory and practice of software, ETAPS 2005, Edinburgh, UK, April 4–8, 2005. Proceedings. Berlin: Springer (ISBN 3-540-25333-5/pbk). Lecture Notes in Computer Science 3440, 287-300 (2005).
MSC:  68T15 68T20 94C10
PDFBibTeX XMLCite
Full Text: DOI

Applications of general exact satisfiability in propositional logic modelling. (English) Zbl 1108.68571

Baader, Franz (ed.) et al., Logic for programming, artificial intelligence, and reasoning. 11th international conference, LPAR 2004, Montevideo, Uruguay, March 14–18, 2005. Proceedings. Berlin: Springer (ISBN 3-540-25236-3/pbk). Lecture Notes in Computer Science 3452. Lecture Notes in Artificial Intelligence, 95-109 (2005).
MSC:  68T15 68Q25
PDFBibTeX XMLCite
Full Text: DOI

Abstract DPLL and abstract DPLL modulo theories. (English) Zbl 1109.68097

Baader, Franz (ed.) et al., Logic for programming, artificial intelligence, and reasoning. 11th international conference, LPAR 2004, Montevideo, Uruguay, March 14–18, 2005. Proceedings. Berlin: Springer (ISBN 3-540-25236-3/pbk). Lecture Notes in Computer Science 3452. Lecture Notes in Artificial Intelligence, 36-50 (2005).
MSC:  68T15 03B35
PDFBibTeX XMLCite
Full Text: DOI

The essentials of the SAT 2003 competition. (English) Zbl 1204.68203

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, 452-467 (2004).
MSC:  68T20
PDFBibTeX XMLCite
Full Text: DOI

SBSAT: a state-based, BDD-based satisfiability solver. (English) Zbl 1204.68193

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, 398-410 (2004).
MSC:  68T20
PDFBibTeX XMLCite
Full Text: DOI

Cache performance of SAT solvers: a case study for efficient implementation of algorithms. (English) Zbl 1204.68213

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

A case for efficient solution enumeration. (English) Zbl 1204.68180

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, 272-286 (2004).
MSC:  68T15 68Q25 68T20
PDFBibTeX XMLCite
Full Text: DOI

Abstraction-driven SAT-based analysis of security protocols. (English) Zbl 1204.68031

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, 257-271 (2004).
MSC:  68M12 68Q60 68T20
PDFBibTeX XMLCite
Full Text: DOI

How good can a resolution based SAT-solver be? (English) Zbl 1204.68196

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, 37-52 (2004).
MSC:  68T20 68T15
PDFBibTeX XMLCite
Full Text: DOI

Satisfiability and computing van der Waerden numbers. (English) Zbl 1204.05097

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, 1-13 (2004).
MSC:  05D10 03B35 68Q25 68T15
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

Filter Results by …

Document Type

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software