Boolean - PDFSEARCH.IO - Document Search Engine

Boolean
Results: 2137

#	Item
651	/home/lwb/beta/doc/ref/ref_lwb2.dvi Add to Reading List Source URL: www.lwb.unibe.ch Language: English - Date: 2010-05-10 07:17:13 Propositional calculus Logic programming Logical syntax Default logic Well-formed formula Logical connective FO Stable model semantics Logic Mathematical logic Boolean algebra
652	The Disjunction and Conjunction Theses Gonzalo Rodriguez-Pereyra This paper is a response to replies by Dan López de Sa and Mark Jago to my ‘Truthmaking, Entailment, and the Conjuction Thesis’. In that paper, my mai Add to Reading List Source URL: www.philosophy.ox.ac.uk Language: English - Date: 2009-05-18 11:40:49 Semantics Veracity Boolean algebra Propositional calculus Truthmaker Negation Logical truth Truth Modal logic Logic Philosophy Philosophical logic
653	/home/lwb/beta/doc/ref/ref_lwb2.dvi Add to Reading List Source URL: www.lwb.unibe.ch Language: English - Date: 2010-05-10 07:17:13 Propositional calculus Logical connectives Semantics Well-formed formula Negation FO Intuitionistic logic First-order logic Logic Mathematical logic Boolean algebra
654	Topics in Knowledge Representation and Reasoning Optimizing Description Logic Subsumption Maryam Fazel-Zarandi DepartmentCompany Add to Reading List Source URL: www.cs.toronto.edu Language: English - Date: 2006-03-10 16:34:57 Logic in computer science Electronic design automation Formal methods NP-complete problems Reasoning Satisfiability Boolean satisfiability problem Description logic Knowledge representation and reasoning Theoretical computer science Science Mathematics
655	CS109B Notes for LectureGates No, not Bill \| we mean a circuit element that implements a logical function. Gate inputs and outputs are usually voltages. Add to Reading List Source URL: infolab.stanford.edu Language: English - Date: 2008-09-19 00:59:15 Logic gates Mathematics Boolean algebra Semantics Truth table Sequential logic Circuit Logical connective Flip-flop Theoretical computer science Digital electronics Electronic engineering
656	CS109B Notes for LectureHow to Prove Things 1. Truth tables \| check it out; it takes O(2n ) time on an expression with n variables, but if n is small this is ne. Add to Reading List Source URL: infolab.stanford.edu Language: English - Date: 2008-09-19 00:59:13 Boolean algebra Logical truth Rules of inference Modus ponens Substitution Tautology First-order logic Contradiction Resolution Logic Mathematical logic Propositional calculus
657	Resolution versus Search: Two Strategies for SAT Irina Rish and Rina Dechter Information and Computer Science University of California, Irvine Add to Reading List Source URL: www.ics.uci.edu Language: English - Date: 2000-11-01 13:42:40 Mathematics Automated theorem proving Logic in computer science Boolean algebra Boolean satisfiability problem Electronic design automation Conjunctive normal form Unit propagation Resolution Theoretical computer science Constraint programming Applied mathematics
658	PDF Document Add to Reading List Source URL: www.cl.cam.ac.uk Language: English - Date: 2014-08-27 06:04:04 Proof theory Mathematical constructivism Predicate logic Boolean algebra Propositional calculus First-order logic Intuitionistic logic Well-formed formula Sequent Logic Mathematical logic Mathematics
659	/home/lwb/beta/doc/ref/ref_lwb2.dvi Add to Reading List Source URL: www.lwb.unibe.ch Language: English - Date: 2010-05-10 07:17:13 Boolean algebra Logical syntax Formal languages Well-formed formula Logical connective Propositional calculus FO Modal depth Propositional formula Logic Mathematical logic Modal logic
660	/home/lwb/beta/doc/ref/ref_lwb2.dvi Add to Reading List Source URL: www.lwb.unibe.ch Language: English - Date: 2010-05-10 07:17:13 Formal languages Logical syntax Boolean algebra Well-formed formula Logical connective Logic Mathematical logic Propositional calculus

UPDATE