Satisfiability - PDFSEARCH.IO - Document Search Engine

Satisfiability
Results: 637

#	Item
91	EMERGENCE OF INTELLIGENT MACHINES: CHALLENGES AND OPPORTUNITIES Non-Human Intelligence Bart Selman Add to Reading List Source URL: intelligence.org Language: English - Date: 2016-06-03 18:01:36 Boolean algebra Logic in computer science Boolean satisfiability problem Electronic design automation SAT Human intelligence
92	¨ 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
93	A Fixed-Point Algorithm for Automated Static Detection of Infinite Loops Andreas Ibing, Alexandra Mai Chair for IT Security TU M¨unchen Boltzmannstrasse 3, 85748 Garching, Germany {ibing,mai}@sec.in.tum.de Add to Reading List Source URL: www.sec.in.tum.de Language: English - Date: 2016-02-01 08:36:29 Recursion Theoretical computer science Formal methods Compiler optimizations Infinite loop Satisfiability modulo theories Control flow For loop Algorithm Termination analysis Loop unrolling Satisfiability
94	On interpolation in decision procedures⋆ Maria Paola Bonacina and Moa Johansson Dipartimento di Informatica, Universit` a degli Studi di Verona Strada Le Grazie 15, IVerona, Italy Add to Reading List Source URL: www.cse.chalmers.se Language: English - Date: 2012-03-21 07:54:00 Automated theorem proving Logic in computer science Boolean algebra Electronic design automation Formal methods Craig interpolation Boolean satisfiability problem Unit propagation Resolution Interpolation Propositional calculus Satisfiability modulo theories
95	Noname manuscript No. (will be inserted by the editor) Extending Sledgehammer with SMT Solvers Jasmin Christian Blanchette · Sascha Böhme · Lawrence C. Paulson Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2015-01-25 16:18:54 Logic in computer science Automated theorem proving Formal methods Theoretical computer science Constraint programming Satisfiability modulo theories Z3 Isabelle Formal verification Proof assistant Automated reasoning E theorem prover
96	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
97	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
98	Combinatorial Optimization Solutions for the Maximum Quartet Consistency Problem Ant´ onio Morgado and Joao Marques-Silva School of Electronics and Computer Science, University of Southampton, UK ,jpms@e Add to Reading List Source URL: ceur-ws.org Language: English - Date: 2008-12-04 03:04:56 Operations research Mathematical optimization Constraint programming Logic in computer science NP-complete problems Topology Satisfiability modulo theories Dynamic programming Semidefinite programming
99	TFF1: The TPTP Typed First-Order Form with Rank-1 Polymorphism Jasmin Christian Blanchette1 and Andrei Paskevich2,3 1 Fakultät für Informatik, Technische Universität München, Germany Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2015-01-25 16:18:54 Type theory Data types Formal methods Functional programming Logic in computer science Symbol Satisfiability modulo theories HindleyMilner type system Geoff Sutcliffe Xi Polymorphism Type variable
100	Aachen Department of Computer Science Technical Report SAT Encodings: From Constraint-Based Termination Add to Reading List Source URL: sunsite.informatik.rwth-aachen.de Language: English - Date: 2012-10-02 11:28:08 Logic in computer science Mathematical logic Aachen RWTH Aachen University Termination analysis Boolean satisfiability problem NP-completeness Algorithm Rewriting