<--- Back to Details
First PageDocument Content
Logic / Disjunctive normal form / Well-formed formula
Date: 2012-09-26 17:01:08
Logic
Disjunctive normal form
Well-formed formula

Formulas and Circuits 1 Formulas as circuits

Add to Reading List

Source URL: www.cs.rice.edu

Download Document from Source Website

File Size: 68,27 KB

Share Document on Facebook

Similar Documents

Recursion / Binary trees / Knowledge representation / Computability theory / B-tree / Binary expression tree / Tree traversal / Disjunctive normal form / Tree / Parallel Tree Contraction / Interval tree

Efficiently Evaluating Complex Boolean Expressions Marcus Fontoura Suhas Sadanandan Jayavel Shanmugasundaram Sergei Vassilvitski Erik Vee Srihari Venkatesan Jason Zien Yahoo! Research, 701 First Ave., Sunnyvale, CA 94089

DocID: 1pncy - View Document

Syntax / Temporal logic / Disjunctive normal form / Model checking / Well-formed formula / Formula

Verifying arbitrary temporal formulas in the temporal logic of actions Lucian Wischik In SRC Technical NoteThis report describes a summer project undertaken by Lucian Wischik of the University of Cambridge, at

DocID: 1p5N4 - View Document

Boolean algebra / Formal methods / Theoretical computer science / Implicant / Disjunctive normal form / IP / Lambda calculus / Vector space / Boolean satisfiability problem / Bayesian network

RESEARCHCONTRIBUTIONS Artificial Intelligence and Language Processing

DocID: 1p0xt - View Document

Logic / Disjunctive normal form / Well-formed formula

Formulas and Circuits 1 Formulas as circuits

DocID: 1aAPX - View Document

Logical consequence / Deduction / Boolean algebra / Entailment / Disjunctive syllogism / Validity / Modus ponens / Disjunctive normal form / Relevance logic / Logic / Rules of inference / Propositional calculus

Relevance Logic John MacFarlane—Philosophy 142 March 29, 2011 1

DocID: 18n52 - View Document