Boolean

Results: 2137



#Item
541Applied 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

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
542Complexity classes / NP-complete problems / Combinatorial optimization / Operations research / Computational problems / Linear programming relaxation / APX / NP-complete / Boolean satisfiability problem / Theoretical computer science / Computational complexity theory / Mathematics

CCCG 2004, Montreal, Quebec, August 9–11, 2004 Separating points by axis-parallel lines  Gruia C˘alinescu

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2004-08-23 15:27:23
543Model theory / Automated theorem proving / Boolean algebra / Resolution / Interpolation / First-order logic / Interpretation / Unsatisfiable core / Atomic formula / Logic / Mathematical logic / Propositional calculus

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
544Boolean algebra / Boolean data type / Computer programming / Q / Constructor / Software engineering / Data types / Computing

WINGS ACCOUNTING INTERFACE ( V E R SI O NG ENERAL The Wings Accounting Interface (WAI) is conceived as a COM Automation Server. This implies that it supports dual interfaces, in other words both early and late bin

Add to Reading List

Source URL: www.wings.be

Language: English - Date: 2013-12-03 09:14:52
545Critical thinking / Arguments / Logic / Argumentation theory / NP-complete / Boolean satisfiability problem / NP-hard / Oracle machine / Algorithm / Theoretical computer science / Applied mathematics / Complexity classes

Advanced Procedures for Hard Problems in Abstract Argumentation Johannes Peter Wallner Institute of Information Systems Vienna University of Technology

Add to Reading List

Source URL: www.inf.kcl.ac.uk

Language: English - Date: 2013-06-09 11:47:58
546NP-complete problems / Exponential time hypothesis / Conjunctive normal form / Boolean satisfiability problem / Vertex cover / Set cover problem / Time complexity / Graph coloring / Independent set / Theoretical computer science / Computational complexity theory / Applied mathematics

On Problems as Hard as CNF-SAT∗ Marek Cygan† Holger Dell‡ Jesper Nederlofk

Add to Reading List

Source URL: arxiv.org

Language: English - Date: 2014-03-27 21:09:14
547Propositional calculus / Semantics / Boolean algebra / Logical connective / Truth table / Valuation / If and only if / Tautology / Natural deduction / Abstract algebra / Logic / Mathematics

Three-Valued Logics Notation: p, q, r atomic formulas; A, B, C arbitrary formulas Values = {T, F, N} Valuation = assignment of a value from Values to each atomic formula Can be extended to an assignment of values to each

Add to Reading List

Source URL: johnmacfarlane.net

Language: English
548Algebraic logic / Camera lens / Anamorphism / Fold / Heap / Surjective function / Binary relation / Boolean algebra / Mathematics / Mathematical logic / Mathematical analysis

Symmetric Lenses Martin Hofmann Benjamin Pierce Daniel Wagner

Add to Reading List

Source URL: dmwit.com

Language: English - Date: 2011-01-31 16:10:19
549Data types / Boolean algebra / Boolean data type / J / Literal / Constant / Software engineering / Computer programming / Computing

3. Wishlist Fig. 1 Fig. 2

Add to Reading List

Source URL: docs.g-vo.org

Language: English - Date: 2011-10-17 05:19:12
550Applied mathematics / Boolean algebra / Boolean satisfiability problem / Electronic design automation / Logic in computer science / Permutation / Theoretical computer science / Mathematics / NP-complete problems

CCCG 2006, Kingston, Ontario, August 14–16, 2006 Minimizing the Number of Arcs Linking a Permutation of Points in the Plane Stephane Durocher∗ Chris Gray†

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2008-10-27 22:59:44
UPDATE