SAT - PDFSEARCH.IO - Document Search Engine

SAT
Results: 13930

#	Item
11	Splitting on Demand in SAT Modulo Theories Clark Barrett? , Robert Nieuwenhuis?? , Albert Oliveras??, and Cesare Tinelli? ? ? Abstract. Lazy algorithms for Satisfiability Modulo Theories (SMT) combine a generic DPLL-base Add to Reading List Source URL: www.lsi.upc.edu Language: English - Date: 2006-07-31 08:38:18 Theoretical computer science Mathematical logic Mathematics Constraint programming Automated theorem proving Logic in computer science Formal methods Propositional calculus Satisfiability modulo theories DPLL algorithm Unit propagation Solver
12	Splitting on Demand in SAT Modulo Theories Clark Barrett, Robert Nieuwenhuis, Albert Oliveras, Cesare Tinelli New York Univ. Techn. Univ. Catalonia Add to Reading List Source URL: www.lsi.upc.edu Language: English - Date: 2006-11-16 20:30:50 Theoretical computer science Mathematical logic Mathematics Boolean algebra Logic in computer science Electronic design automation Formal methods NP-complete problems Boolean satisfiability problem Phnom Penh Solver Propositional calculus
13	SAT Modulo the Theory of Linear Arithmetic: Exact, Inexact and Commercial Solvers Germain Faure, Robert Nieuwenhuis, Albert Oliveras and Enric Rodr´ıguez-Carbonell? Abstract. Many highly sophisticated tools exist for Add to Reading List Source URL: www.lsi.upc.edu Language: English - Date: 2008-05-08 10:37:46 Theoretical computer science Mathematics Computational complexity theory Electronic design automation Formal methods Logic in computer science NP-complete problems Boolean algebra Satisfiability modulo theories Boolean satisfiability problem Linear programming AMPL
14	Verification Using SAT and SMT Solvers1 N. Shankar Computer Science Laboratory SRI International Menlo Park, CA Add to Reading List Source URL: dream.inf.ed.ac.uk Language: English - Date: 2010-08-25 09:00:40 Theoretical computer science Mathematical logic Mathematics Boolean algebra Logic in computer science Electronic design automation Formal methods NP-complete problems Boolean satisfiability problem Satisfiability modulo theories Propositional calculus Model checking
15	COSC 544 Probabilistic Proof SystemsLFKN’s Interactive Proof for #SAT Lecturer: Justin Thaler Add to Reading List Source URL: people.cs.georgetown.edu Language: English - Date: 2017-09-18 12:17:56 Computational complexity theory Complexity classes Boolean algebra IP True quantified Boolean formula Interactive proof system PSPACE NP Boolean satisfiability problem FO Linear temporal logic ArthurMerlin protocol
16	Using a SAT Solver as a Fast Decision Procedure for Propositional Logic in an LCF-style Theorem Prover Tjark Weber Add to Reading List Source URL: user.it.uu.se Language: English - Date: 2005-09-13 07:36:36 Theoretical computer science NP-complete problems Formal methods Boolean algebra Boolean satisfiability problem Electronic design automation Logic in computer science Isabelle Constructible universe LCF Mathematics (SAT -UNSAT)
17	Bounded Model Generation for Isabelle/HOL and Related Applications of SAT Solvers in Interactive Theorem Proving Tjark Weber Add to Reading List Source URL: user.it.uu.se Language: English - Date: 2005-09-13 07:36:16 Computability theory Lambda calculus Theoretical computer science Model theory Higher-order logic Constructible universe Metaphilosophy Mathematics
18	A SAT-based Sudoku Solver Tjark Weber LPAR’05, December 3rd, 2005 Add to Reading List Source URL: user.it.uu.se Language: English - Date: 2005-11-29 11:04:14 Logic puzzles Sudoku Recreational mathematics Abstract strategy games NP-complete problems Mathematics Logic
19	On SAT Modulo Theories and Optimization Problems Robert Nieuwenhuis and Albert Oliveras? Abstract. Solvers for SAT Modulo Theories (SMT) can nowadays handle large industrial (e.g., formal hardware and software verificati Add to Reading List Source URL: www.lsi.upc.edu Language: English - Date: 2006-04-28 13:17:24 Theoretical computer science Mathematics Mathematical logic Logic in computer science Automated theorem proving Electronic design automation Formal methods NP-complete problems Satisfiability modulo theories Boolean satisfiability problem Maximum satisfiability problem Unit propagation
20	Decision procedures for SAT, SAT Modulo Theories and Beyond. The BarcelogicTools? Robert Nieuwenhuis and Albert Oliveras?? Abstract. An overview is given of a number of recent developments Add to Reading List Source URL: www.lsi.upc.edu Language: English - Date: 2005-10-12 08:17:46 Theoretical computer science Mathematical logic Mathematics Automated theorem proving Logic in computer science Constraint programming Boolean algebra Electronic design automation Boolean satisfiability problem Satisfiability modulo theories Unit propagation Resolution