2-satisfiability - PDFSEARCH.IO - Document Search Engine

2-satisfiability
Results: 107

#	Item
11	¨ DES SAARLANDES UNIVERSITAT FR 6.2 – Informatik Christoph Weidenbach Lecture “Automated Reasoning II” Add to Reading List Source URL: resources.mpi-inf.mpg.de Language: English - Date: 2013-08-19 07:30:22 Logic Logical truth Mathematical logic Theoretical computer science Model theory Automated theorem proving Logic programming Philosophy of logic Satisfiability Substitution Boolean satisfiability problem
12	On Improving MUS Extraction Algorithms Joao Marques-Silva1,2 and Ines Lynce2 1 2 Add to Reading List Source URL: www.mancoosi.org Language: English - Date: 2012-12-16 04:54:55 Automated theorem proving Logic in computer science Propositional calculus Unsatisfiable core Boolean algebra Resolution Exponential time hypothesis Algorithm Maximum satisfiability problem Boolean satisfiability problem DavisPutnam algorithm
13	Abstraction-Based Algorithm for 2QBF Mikol´asˇ Janota2 and Joao Marques-Silva1,2 1 University College Dublin, Ireland 2 Add to Reading List Source URL: www.mancoosi.org Language: English - Date: 2012-12-16 04:54:55 Logic in computer science Boolean algebra Electronic design automation Formal methods NP-complete problems Boolean satisfiability problem True quantified Boolean formula Maximum satisfiability problem Model checking Conjunctive normal form Satisfiability Tseytin transformation
14	¨ DES SAARLANDES UNIVERSITAT FR 6.2 – Informatik Christoph Weidenbach Lecture “Automated Reasoning” Add to Reading List Source URL: resources.mpi-inf.mpg.de Language: English - Date: 2010-08-07 06:03:33 Automated theorem proving Model theory Formal methods Constraint programming Resolution Skolem normal form Lambda calculus Satisfiability Boolean satisfiability problem Conjunctive normal form
15	CS261: A Second Course in Algorithms Lecture #19: Beating Brute-Force Search∗ Tim Roughgarden† March 8, 2016 A popular myth is that, for N P -hard problems, there are no algorithms with worst-case running time better Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2016-03-15 10:47:56 NP-complete problems Computational complexity theory Analysis of algorithms Operations research NP-hard problems Vertex cover Travelling salesman problem Dynamic programming Parameterized complexity Independent set Algorithm 2-satisfiability
16	From F? to SMT (Extended Abstract) Alejandro Aguirre1,2 1 Inria Paris Add to Reading List Source URL: prosecco.gforge.inria.fr Language: English - Date: 2016-07-04 02:54:41 Theoretical computer science Formal methods Computability theory Functional languages Logic in computer science Satisfiability modulo theories Factorial ML Recursion Lambda calculus System F
17	¨ DES SAARLANDES UNIVERSITAT FR 6.2 – Informatik Christoph Weidenbach Lecture “Automated Reasoning” Add to Reading List Source URL: resources.mpi-inf.mpg.de Language: English - Date: 2013-08-19 07:46:27 Logic programming Automated theorem proving Logic in computer science Formal methods Theoretical computer science Unification Lambda calculus Boolean satisfiability problem Conjunctive normal form
18	Smoothed Complexity Theory Markus Bl¨aser1 and Bodo Manthey2 1 Saarland University, 2 Add to Reading List Source URL: www-cc.cs.uni-saarland.de Language: English - Date: 2014-01-17 04:45:53 Complexity classes Computational complexity theory Mathematical optimization Analysis of algorithms NP-complete problems Smoothed analysis IP PP NP Time complexity Average-case complexity Boolean satisfiability problem
19	A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality Jasmin Christian Blanchette1,2 , Mathias Fleury2 , and Christoph Weidenbach2 1 2 Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2016-06-17 09:50:06 Formal methods Automated theorem proving Logic in computer science Boolean algebra Electronic design automation Conflict-Driven Clause Learning Boolean satisfiability problem Satisfiability modulo theories Clause Vampire Propositional calculus Lambda calculus
20	First-order satisfiability in Gödel logics: an NP-complete fragment Matthias Baaza,1 , Agata Ciabattonia,2 , Norbert Preininga,b,3 a b Add to Reading List Source URL: www.preining.info Language: English - Date: 2014-04-03 01:14:57 Logic Mathematical logic Abstraction Model theory Non-classical logic Logic in computer science Predicate logic First-order logic Boolean satisfiability problem Gdel numbering Many-valued logic Kripke semantics

UPDATE