Nikolaj - PDFSEARCH.IO - Document Search Engine

Nikolaj
Results: 487

#	Item
81	Brd. Klee A/S – telefon – kontaktperson: Direktør Lars Ejnar Jensen. Side 1 af 4 Nasdaq Omx A/S Nikolaj PladsKøbenhavn K. Add to Reading List Source URL: www.klee.dk Language: Danish - Date: 2015-05-19 07:08:36
82	PDF Document Add to Reading List Source URL: www.cats-cons.dk Language: English - Date: 2014-03-21 05:41:33 Humanities Geography of Europe Statens Museum for Kunst Danish art Delft University of Technology Nikolaj Abraham Abildgaard Copenhagen Conservation-restoration Art history Museology
83	Z3 Lab exercises Leonardo de Moura and Nikolaj Bjørner Microsoft Research, One Microsoft Way, Redmond, WA, 98074, USA {leonardo, nbjorner}@microsoft.com June 18, 2008 Add to Reading List Source URL: leodemoura.github.io Language: English - Date: 2015-05-19 13:22:05 Computational complexity theory Recreational mathematics Z3 Gray code Eight queens puzzle Sudoku Constraint satisfaction Bit array Longest path problem Mathematics Theoretical computer science NP-complete problems
84	Accelerating lemma learning using joins - DPLL(t) Nikolaj Bjørner Microsoft Research Bruno Dutertre SRI International Add to Reading List Source URL: research.microsoft.com Language: English - Date: 2009-07-21 19:11:23 Automated theorem proving Constraint programming Formal methods Logic in computer science Electronic design automation DPLL algorithm Satisfiability Modulo Theories Boolean satisfiability problem Resolution Theoretical computer science Mathematics Mathematical logic
85	µZ– An Efficient Engine for Fixed points with Constraints? Kryˇstof Hoder, Nikolaj Bjørner, and Leonardo de Moura Manchester University and Microsoft Research Abstract. The µZ tool is a scalable, efficient engine Add to Reading List Source URL: research.microsoft.com Language: English - Date: 2011-09-16 13:09:02 Mathematical logic Mathematical structures Model theory Algebraic logic Boolean algebra Finitary relation Structure Relational algebra Relation algebra Mathematics Algebra Abstract algebra
86	Horn Clause Solvers for Program Verification Nikolaj Bjørner, Arie Gurfinkel, Ken McMillan and Andrey Rybalchenko Microsoft Research, Software Engineering Institutute Abstract. Several recent symbolic model checking too Add to Reading List Source URL: research.microsoft.com Language: English - Date: 2015-04-11 16:07:03 Logic in computer science Formal methods Mathematical logic Predicate logic Rules of inference Resolution Horn clause Predicate transformer semantics Constraint logic programming Theoretical computer science Mathematics Logic
87	Program Verification as Satisfiability Modulo Theories Nikolaj Bjørner Microsoft Research Ken McMillan Microsoft Research Add to Reading List Source URL: research.microsoft.com Language: English - Date: 2012-08-15 16:20:10 Applied mathematics Electronic design automation Logic in computer science NP-complete problems Constraint programming Satisfiability Modulo Theories Boolean satisfiability problem Prolog Predicate transformer semantics Theoretical computer science Mathematics Formal methods
88	Instantiations, Zippers and EPR Interpolation Nikolaj Bjørner, Arie Gurfinkel, Konstantin Korovin and Ori Lahav Microsoft Research, Software Engineering Institute, University of Manchester, Tel Aviv University Abstract Add to Reading List Source URL: research.microsoft.com Language: English - Date: 2014-05-07 12:02:18 Model theory Automated theorem proving Boolean algebra Resolution Interpolation First-order logic Interpretation Unsatisfiable core Atomic formula Logic Mathematical logic Propositional calculus
89	Proofs and Refutations, and Z3 Leonardo de Moura and Nikolaj Bjørner Microsoft Research Abstract Z3 [3] is a state-of-the-art Satisfiability Modulo Theories (SMT) solver freely available from Microsoft Research. It solv Add to Reading List Source URL: research.microsoft.com Language: English - Date: 2009-07-21 19:11:06 Formal methods Metalogic Logic in computer science Electronic design automation NP-complete problems Satisfiability Modulo Theories Boolean satisfiability problem Conjunctive normal form Mathematical proof Mathematics Theoretical computer science Logic
90	Software Engineering and Automated Deduction Willem Visser Nikolaj Bjørner Natarajan Shankar Add to Reading List Source URL: research.microsoft.com Language: English - Date: 2014-05-07 12:02:12 Formal methods Automated theorem proving Logic in computer science NP-complete problems Model checking Satisfiability Modulo Theories Boolean satisfiability problem KeY First-order logic Theoretical computer science Logic Mathematical logic