2-satisfiability - PDFSEARCH.IO - Document Search Engine

2-satisfiability
Results: 107

#	Item
61	Solving Non-clausal Formulas with DPLL search Christian Thiffault1 , Fahiem Bacchus1 , and Toby Walsh 2 1 Department of Computer Science, University of Toronto, Toronto, Ontario, Canada Add to Reading List Source URL: www.cs.toronto.edu Language: English - Date: 2004-07-03 23:15:04 Applied mathematics Resolution True quantified Boolean formula Propositional variable Unit propagation Satz DPLL algorithm Boolean satisfiability problem Theoretical computer science Automated theorem proving Mathematics
62	Extending Sledgehammer with SMT Solvers Jasmin Christian Blanchette1,? , Sascha Böhme1 , and Lawrence C. Paulson2 1 Institut für Informatik, Technische Universität München, Germany 2 Computer Laboratory, University o Add to Reading List Source URL: www21.in.tum.de Language: English - Date: 2013-06-03 12:43:37 Logic in computer science Automated theorem proving Formal methods Constraint programming Reasoning Satisfiability Modulo Theories Proof assistant E theorem prover Isabelle Theoretical computer science Applied mathematics Mathematics
63	Runtime Verification Using a Temporal Description Logic Franz Baader,1 Andreas Bauer,2 and Marcel Lippmann1 1 2 Add to Reading List Source URL: www.immerundewig.at Language: English - Date: 2009-07-15 21:37:58 Mathematical logic Formal languages Metalogic Linear temporal logic Temporal logic Interpretation Dynamical system Satisfiability Function Logic Model theory Mathematics
64	Newsletter of the PC Community July 2011 Welcome doc positions at Berlin, Budapest, and Tel Aviv, and now holds a Humboldt Research Fellowship for Experienced Frances Rosamond, Editor Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2012-09-17 05:09:12 Analysis of algorithms NP-complete problems Parameterized complexity Kernelization Complexity classes Time complexity 2-satisfiability Dominating set Vertex cover Theoretical computer science Computational complexity theory Applied mathematics
65	EagleUP: Solving Random 3-SAT using SLS with Unit Propagation Oliver Gableske1 and Marijn Heule2 1 2 Add to Reading List Source URL: www.st.ewi.tudelft.nl Language: English - Date: 2011-09-26 11:40:39 NP-complete problems Logic in computer science Electronic design automation Formal methods Automated theorem proving Boolean satisfiability problem Conjunctive normal form Search algorithm Unit propagation Theoretical computer science Applied mathematics Mathematics
66	Blocked Clause Elimination Matti J¨arvisalo1 , Armin Biere2 , and Marijn Heule 3 1 2 Add to Reading List Source URL: www.st.ewi.tudelft.nl Language: English - Date: 2009-12-21 10:55:55 NP-complete problems Conjunctive normal form Automated theorem proving Boolean satisfiability problem Resolution Theoretical computer science Mathematics Applied mathematics
67	Dynamic Symmetry Breaking by Simulating Zykov Contraction Bas Schaafsma, Marijn Heule! and Hans van Maaren Department of Software Technology, Delft University of Technology [removed], [removed], h.van Add to Reading List Source URL: www.st.ewi.tudelft.nl Language: English - Date: 2009-04-21 07:17:46 Graph coloring NP-complete problems Complexity classes Boolean satisfiability problem SL 2-satisfiability Greedy coloring Theoretical computer science Graph theory Mathematics
68	EagleUP: Solving Random 3-SAT using SLS with Unit Propagation Oliver Gableske1 and Marijn Heule2 1 2 Add to Reading List Source URL: www.st.ewi.tudelft.nl Language: English - Date: 2011-09-26 11:40:37 Logic programming Conjunctive normal form Local search Boolean satisfiability problem DPLL algorithm Theoretical computer science Constraint programming Declarative programming
69	Exact DFA Identification Using SAT Solvers Marijn J.H. Heule1, and Sicco Verwer2 1 2 Add to Reading List Source URL: www.st.ewi.tudelft.nl Language: English - Date: 2010-11-29 07:36:36 Automata theory NP-complete problems Graph coloring Graph theory Boolean satisfiability problem Deterministic finite automaton Clique DFA Records Powerset construction Theoretical computer science Mathematics Applied mathematics
70	Blocked Clause Elimination and its Extensions Marijn J. H. Heule∗ joint work with Matti J¨arvisalo and Armin Biere Abstract Boolean satisfiability (SAT) has become a core technology in many application Add to Reading List Source URL: www.st.ewi.tudelft.nl Language: English - Date: 2010-11-29 08:16:51 NP-complete problems Conjunctive normal form Automated theorem proving Boolean satisfiability problem Resolution Logic programming 2-satisfiability Theoretical computer science Mathematics Applied mathematics

UPDATE