Local Soundness for QBF Calculi? Martin Suda and Bernhard Gleiss TU Wien, Vienna, Austria Abstract. We develop new semantics for resolution-based calculi for Quantified Boolean Formulas, covering both the CDCL-derived ca

Source URL: forsyte.at

• Measure theory
• FO
• Finite model theory
• Ergodic theory
• Mathematics
• Logic
• Mathematical logic
• Lie algebras
• Hopf decomposition
• Pattern language

Automatic Generation of Local Repairs for Boolean Programs Roopsha Samanta, Jyotirmoy V. Deshmukh and E. Allen Emerson Department of Electrical and Computer Engineering and Department of Computer Sciences, The University

Source URL: www.cs.purdue.edu

• Mathematical logic
• Theoretical computer science
• Mathematics
• Formal methods
• Boolean algebra
• Temporal logic
• Edsger W. Dijkstra
• Predicate transformer semantics
• Model theory
• Hoare logic
• True quantified Boolean formula
• Linear temporal logic

ZKBoo: Faster Zero-Knowledge for Boolean Circuits Irene Giacomelli Jesper Madsen Claudio Orlandi

Source URL: eprint.iacr.org

• Cryptography
• Computational complexity theory
• Randomized algorithms
• Zero-knowledge proof
• IP
• Proof of knowledge
• Non-interactive zero-knowledge proof
• Secure multi-party computation
• Soundness
• Commitment scheme
• Probabilistically checkable proof
• NP

Branch and Bound for Boolean Optimization and the Generation of Optimality Certificates Javier Larrosa, Robert Nieuwenhuis, Albert Oliveras, Enric Rodr´ıguez-Carbonell? Abstract. We consider optimization problems of th

Source URL: www.lsi.upc.edu

• Theoretical computer science
• Mathematics
• Formal methods
• Mathematical logic
• Boolean algebra
• Boolean satisfiability problem
• Electronic design automation
• Logic in computer science
• Resolution
• COMPASS/Sample Code
• BCD

Sparse Boolean Equations and Circuit Lattices Igor Semaev University of Bergen Norway SHARCS, 9 September 2009

Source URL: www.hyperelliptic.org

BDDs for Pseudo-Boolean Constraints – Revisited Ignasi Ab´ıo, Robert Nieuwenhuis, Albert Oliveras, and Enric Rodr´ıguez-Carbonell? Abstract. Pseudo-Boolean constraints are omnipresent in practical applications, and

Source URL: www.lsi.upc.edu

• Boolean algebra
• Constraint programming
• Diagrams
• Binary decision diagram
• Model checking
• Theoretical computer science
• Mathematics
• Local consistency
• Computing
• Propositional directed acyclic graph

EE104 SpringS. Lall and S. Boyd Boolean Classification

Source URL: ee104.stanford.edu

Boolean Satisfiability Solvers: Techniques and Extensions Georg WEISSENBACHER a and Sharad MALIK a a Princeton University Abstract. Contemporary satisfiability solvers are the corner-stone of many successful applications

Source URL: www.georg.weissenbacher.science

Learning Boolean Functions∗ Martin Anthony CDAM Research Report LSE-CDAMAbstract This report surveys some key results on the learning of Boolean functions in a

Source URL: www.cdam.lse.ac.uk

Boolean Solids Tutorial Introduction The CADMAX Solid Master Tutorial is a great way to learn about the benefits of constructive (boolean) solid modeling with CADMAX. We have assembled four typical parts that you will be

Source URL: www.cadmax.com