SAT - PDFSEARCH.IO - Document Search Engine

SAT
Results: 13930

#	Item
21	From SAT to ASP and back!? Torsten Schaub University of Potsdam & INRIA Rennes Torsten Schaub (KRR@UP) Add to Reading List Source URL: sat2016.labri.fr Language: English - Date: 2016-07-11 01:48:08 Programming paradigms Logic programming Software engineering Artificial intelligence Constraint programming Theoretical computer science Answer set programming Automated reasoning Constraint satisfaction problem Problem solving Solver Knowledge representation and reasoning
22	Solving Constraints over Bit-Vectors with SAT-based Model Checking Extended Abstract Yakir Vizel1 , Alexander Nadel2 , and Sharad Malik1 2 Add to Reading List Source URL: smt-workshop.cs.uiowa.edu Language: English - Date: 2017-09-02 14:08:49 Theoretical computer science Logic in computer science Formal methods Computational complexity theory Mathematics Electronic design automation NP-complete problems Constraint programming Satisfiability modulo theories Boolean satisfiability problem Z3 Solver
23	To Encode or to Propagate? The Best Choice for Each Constraint in SAT Ignasi Ab´ıo1 , Robert Nieuwenhuis2 , Albert Oliveras2 , Enric Rodr´ıguez-Carbonell2 , Peter J. Stuckey3 1 Add to Reading List Source URL: www.lsi.upc.edu Language: English - Date: 2013-07-22 05:26:24 Theoretical computer science Logic in computer science Constraint programming Electronic design automation Formal methods NP-complete problems Constraint satisfaction Satisfiability modulo theories Boolean satisfiability problem Maximum satisfiability problem Decomposition method Constraint
24	China Domestic Payment System Upgrade Dear HSBCnet User, To improve processing efficiency and payment service, HSBC China is planned to upgrade existing domestic RMB payment system from 5Nov16 (Sat) to 6Nov16 (Sun). Add to Reading List Source URL: www.hsbc.com.cn Language: English - Date: 2016-10-18 22:16:06 Economy Financial services Money Payment systems Single Euro Payments Area Payment BPAY Automated Clearing House Direct debit
25	Advanced Topics in SAT-Solving Part II: Theoretical Aspects Carsten Sinz Wilhelm-Schickard-Institut for Computer Science University of T¨ubingen Add to Reading List Source URL: formal.iti.kit.edu Language: English - Date: 2016-07-22 17:30:27 Computational complexity theory Theoretical computer science Logic in computer science Complexity classes Mathematical optimization Boolean algebra NP-complete problems Boolean satisfiability problem 2-satisfiability Horn-satisfiability P versus NP problem Exponential time hypothesis
26	A SAT-based Sudoku Solver Tjark Weber Club2, November 23rd, 2005 Add to Reading List Source URL: user.it.uu.se Language: English - Date: 2005-11-23 11:15:52 Logic puzzles Sudoku Recreational mathematics Abstract strategy games NP-complete problems Mathematics Logic
27	Introduction SAT Solvers Satisfiability Modulo Theories Conclusions Integrating SAT and SMT Solvers Add to Reading List Source URL: user.it.uu.se Language: English - Date: 2009-09-10 10:56:53 Theoretical computer science Logic Mathematics Formal methods Logic in computer science Boolean algebra Electronic design automation NP-complete problems Boolean satisfiability problem Satisfiability modulo theories Solver Propositional calculus
28	COSC 544 Probabilistic Proof SystemsA PCP of Quasilinear Size for Arithmetic Circuit-SAT Lecturer: Justin Thaler Add to Reading List Source URL: people.cs.georgetown.edu Language: English - Date: 2017-11-22 13:48:36 Mathematics Algebra Polynomials Probabilistically checkable proof Computer algebra IP Complex number MAX-3SAT
29	A Write-Based Solver for SAT Modulo the Theory of Arrays Miquel Bofill Universitat de Girona Robert Nieuwenhuis Add to Reading List Source URL: www.lsi.upc.edu Language: English - Date: 2008-07-14 06:59:10 Theoretical computer science Logic in computer science Electronic design automation Formal methods NP-complete problems Mathematics Constraint programming Satisfiability modulo theories Boolean satisfiability problem Array data type Literal Matrix
30	Introduction Finite Model Generation Proof-Producing SAT Solvers Satisfiability Modulo Theories Finite Model Generation, Proof-Producing Add to Reading List Source URL: user.it.uu.se Language: English - Date: 2009-02-03 09:54:08 Theoretical computer science Logic Mathematical logic Logic in computer science Formal methods Electronic design automation NP-complete problems Constraint programming Satisfiability modulo theories Satisfiability Propositional calculus Solver

UPDATE