RESEARCHCONTRIBUTIONS Artificial Intelligence and Language Processing

First Page		Document Content
Date: 2011-07-13 14:33:31 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 Add to Reading List Source URL: aml.media.mit.edu Download Document from Source Website File Size: 787,49 KB Share Document on Facebook

	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
	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
	RESEARCHCONTRIBUTIONS Artificial Intelligence and Language Processing DocID: 1p0xt - View Document
	Formulas and Circuits 1 Formulas as circuits DocID: 1aAPX - View Document
	Relevance Logic John MacFarlane—Philosophy 142 March 29, 2011 1 DocID: 18n52 - View Document