Journal on Satisfiability, Boolean Modeling and ComputationTranslating Pseudo-Boolean Constraints into SAT Niklas E´ en

Source URL: minisat.se

BRICS DS-04-5 B. Skjernaa: Exact Algorithms for Variants of Satisfiability and Colouring Problems BRICS Basic Research in Computer Science

Source URL: www.brics.dk

• NP-complete problems
• Boolean satisfiability problem
• NP-complete
• Satisfiability
• Maximum cut
• Algorithm
• Graph coloring
• 2-satisfiability
• Theoretical computer science
• Mathematics
• Applied mathematics

RUDIN-KEISLER POSETS OF COMPLETE BOOLEAN ALGEBRAS PETER JIPSEN, ALEXANDER PINUS, HENRY ROSE Abstract. The Rudin-Keisler ordering of ultrafilters is extended to complete Boolean algebras and characterised in terms of elem

Source URL: www1.chapman.edu

• Model theory
• Boolean algebra
• Order theory
• Non-standard analysis
• Universal algebra
• Ultrafilter
• Symbol
• Structure
• Ultraproduct
• Mathematics
• Mathematical logic
• Logic

Gene-O-Matic • Genetic network modelling and simulation tool • Graphical user interface to design networks • Discrete model: Boolean network/ matrix multiplication

Source URL: sbml.org

• Nature
• Cell
• Cell biology
• Gene regulatory network

The categorical equivalence between complete (semi)lattices with operators and contexts with relations Peter Jipsen

Source URL: math.chapman.edu

• Boolean algebra
• Algebraic logic
• Algebraic structures
• Lattice theory
• Heyting algebra
• Kripke semantics
• Residuated lattice
• Distributive lattice
• Relation algebra
• Logic
• Mathematical logic
• Mathematics

Building a Semantic Parser Overnight Yushi Wang∗ Stanford University Jonathan Berant∗ Stanford University

Source URL: nlp.stanford.edu

• Language
• Theoretical computer science
• Computational linguistics
• Categorial grammar
• Formal grammar
• Parsing
• Syntax
• Semantics
• Boolean algebra
• Formal languages
• Linguistics
• Grammar

The Premiss-Based Approach to Judgment Aggregation Franz Dietrich & Philippe Mongin December 2007 Abstract We investigate judgment aggregation by assuming that some formulas of the

Source URL: personal.lse.ac.uk

• Model theory
• Propositional calculus
• Semantics
• Order theory
• Boolean algebra
• Interpretation
• Filter
• Logic
• Mathematical logic
• Mathematics

MASSACHUSETTS INSTITUTE OF TECHNOLOGY DEPARTMENT OF ELECTRICAL ENGINEERING AND COMPUTER SCIENCEComputation Structures Fall 2006 Quiz #1: September 22, 2006 Name

Source URL: 6004.csail.mit.edu

• Electronics
• Electronic design
• Logic gate
• CMOS
• Boolean algebra
• Ternary numeral system
• Electronic engineering
• Digital electronics
• Logic families

CS 170 Algorithms Spring 2009

Source URL: www-inst.eecs.berkeley.edu

• Complexity classes
• NP-complete problems
• Boolean algebra
• Electronic design automation
• Formal methods
• Boolean satisfiability problem
• Conjunctive normal form
• NP-complete
• Canonical form
• Theoretical computer science
• Mathematics
• Applied mathematics

Logical- and Meta-Logical Frameworks Lecture 3 Carsten Sch¨ urmann August 9, 2006

Source URL: www.itu.dk

• Mathematical logic
• Programming language theory
• Dependently typed programming
• Twelf
• Logical framework
• Boolean algebra
• Propositional calculus
• Specific Area Message Encoding
• Functional completeness
• Logic in computer science
• Theoretical computer science
• Type theory