Finite - PDFSEARCH.IO - Document Search Engine

Finite
Results: 6380

#	Item
11	Finding Finite Models in Multi-Sorted First-Order Logic? Giles Reger1 , Martin Suda1 , and Andrei Voronkov1,2,University of Manchester, Manchester, UK Add to Reading List Source URL: www.cs.man.ac.uk Language: English - Date: 2016-07-20 16:49:46 Mathematics Mathematical logic Logic Model theory Logic in computer science Semantics Universal algebra Boolean satisfiability problem Interpretation First-order logic Resolution Clause
12	SAT-based Finite Model Generation for Isabelle/HOL Tjark Weber Summer School Marktoberdorf, August 9, 2005 Add to Reading List Source URL: user.it.uu.se Language: English - Date: 2005-09-13 07:36:34 Mathematical logic Computability theory Type theory Theoretical computer science Metalogic Model theory Lambda calculus Constructible universe Mathematics
13	SMT Techniques for Fast Predicate Abstraction Shuvendu K. Lahiri? , Robert Nieuwenhuis?? , and Albert Oliveras?? Abstract. Predicate abstraction is a technique for automatically extracting finite-state abstractions for s Add to Reading List Source URL: www.lsi.upc.edu Language: English - Date: 2006-06-09 05:24:28 Mathematical logic Mathematics Theoretical computer science Formal methods Electronic design automation Logic in computer science NP-complete problems Boolean algebra Satisfiability modulo theories Boolean satisfiability problem 120-cell Predicate
14	Introduction Finite Model Generation Extensions and Optimizations Case Studies Integration of Proof-Producing SAT Solvers Conclusion Add to Reading List Source URL: user.it.uu.se Language: English - Date: 2008-10-09 08:41:17 Mathematical logic Logic Boolean algebra Mathematics Classical logic Propositional calculus Model theory
15	A NOTION OF GEOMETRIC COMPLEXITY AND ITS APPLICATION TO TOPOLOGICAL RIGIDITY ERIK GUENTNER, ROMAIN TESSERA, AND GUOLIANG YU Abstract. We introduce a geometric invariant, called finite decomposition complexity (FDC), to s Add to Reading List Source URL: www.normalesup.org Language: English - Date: 2011-10-21 02:00:00 Mathematics Geometry Algebra Geometric group theory Topological groups Topology Field theory Metric geometry Amenable group Kazhdan's property Valuation Von Neumann algebra
16	Invariants for Finite Instances and Beyond Sylvain Conchon∗† Amit Goel‡ Sava Krsti´c‡ Add to Reading List Source URL: cubicle.lri.fr Language: English - Date: 2013-07-31 06:27:46 120-cell Reachability FO Tiny Encryption Algorithm Mathematics Discrete mathematics Mathematical logic
17	Reachability Computation for Switching Diffusions: Finite Abstractions with Certifiable and Tuneable Precision Alessandro Abate Luca Bortolussi Add to Reading List Source URL: qav.comlab.ox.ac.uk Language: English - Date: 2017-01-31 07:04:26
18	Smoothness Testing of Polynomials over Finite Fields Jean-Franc ¸ ois Biasse and Michael J. Jacobson Jr. Department of Computer Science, University of Calgary 2500 University Drive NW Add to Reading List Source URL: www.lix.polytechnique.fr Language: English - Date: 2016-05-19 17:03:48 Mathematics Multiplication Polynomials Algebra Multiplication algorithm Computer algebra ToomCook multiplication Karatsuba algorithm Degree of a polynomial Finite field Remainder Computational complexity of mathematical operations
19	Towards Self-Verification in Finite Difference Code Generation Jan H¨ uckelheim1 , Ziqing Luo2 , Fabio Luporini1 ,Navjot Kukreja1 , Michael Lange1 , Gerard Gorman1 , Stephen Siegel2 , Matthew Dwyer3 , Paul Hovland4 Add to Reading List Source URL: correctness-workshop.github.io Language: English - Date: 2017-11-14 22:52:13 Computing Computer programming Software engineering Operator theory Fortran OpenMP Parallel computing Hermitian adjoint Adjoint
20	Invariants for Finite Instances and Beyond Sylvain Conchon∗† Amit Goel‡ Sava Krsti´c‡ Add to Reading List Source URL: mebsout.github.io Language: English - Date: 2017-07-21 11:03:15 120-cell Reachability FO Tiny Encryption Algorithm Mathematics Discrete mathematics Mathematical logic