Satisfiability - PDFSEARCH.IO - Document Search Engine

Satisfiability
Results: 637

#	Item
81	¨ 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
82	Leveraging SMT: Using SMT Solvers to Improve Verification; Using Verification to Improve SMT Solvers Clark Barrett Christopher L. Conway Add to Reading List Source URL: fm.csl.sri.com Language: English - Date: 2010-10-30 16:21:50 Theoretical computer science Formal methods Logic in computer science Constraint programming Electronic design automation NP-complete problems Satisfiability modulo theories Solver SMT Uninterpreted function Model checking Alt-Ergo
83	A Decision Procedure for Satisfiability in Separation Logic with Inductive Predicates James Brotherston ∗ Carsten Fuhs † Juan A. Navarro P´erez ‡ University College London Add to Reading List Source URL: www.dcs.bbk.ac.uk Language: English - Date: 2014-05-16 12:03:54 Logic Mathematics Abstraction Automated theorem proving Smooth functions Logic programming Logical truth Propositional calculus Substitution Well-formed formula Distribution Constructible universe
84	Complexity and Approximability of Parameterized MAX-CSPs Holger Dell1 , Eun Jung Kim2 , Michael Lampis3 , Valia Mitsou4 , and Tobias Mömke5 1 Add to Reading List Source URL: drops.dagstuhl.de Language: English - Date: 2015-11-09 10:22:02 Theoretical computer science Computational complexity theory Mathematics Constraint programming NP-complete problems Boolean algebra Parameterized complexity Boolean satisfiability problem Constraint satisfaction problem Exponential time hypothesis Treewidth Tree decomposition
85	Unleashing the Verification Genie in the Cloud Nikolaj Bjørner Microsoft Research, One Microsoft Way, Redmond, WA, 98074, USA Abstract Z3 is a state-of-the-art SMT (Satisfiability Modulo Theories) Add to Reading List Source URL: fm.csl.sri.com Language: English - Date: 2010-11-01 03:01:08 Mathematics Theoretical computer science Mathematical logic Predicate logic Constraint programming Electronic design automation Logic in computer science Satisfiability modulo theories Z3 First-order logic Language Integrated Query Computer program
86	Transformation rules from UML4MBT meta-model to SMT meta-model for model animation Jérôme Cantenot Fabrice Ambert Add to Reading List Source URL: st.inf.tu-dresden.de Language: English - Date: 2012-09-25 06:20:13 Software engineering Theoretical computer science Mathematical logic Formal methods Computability theory Lambda calculus Subroutines Satisfiability modulo theories XC HindleyMilner type system First-order logic Recursion
87	Solving Geometry Problems using a Combination of Symbolic and Numerical Reasoning Shachar Itzhaky1 , Sumit Gulwani2 , Neil Immerman3 , and Mooly Sagiv1 1 Add to Reading List Source URL: www.cs.tau.ac.il Language: English Mathematical logic Programming paradigms Algorithm Theoretical computer science Axiom Euclidean geometry Logic programming Constraint satisfaction Constraint programming Satisfiability modulo theories Foundations of geometry
88	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
89	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