<--- Back to Details
First PageDocument Content
Mathematical logic / Constraint programming / Boolean algebra / Resolution / Conjunctive normal form / Unit propagation / Davis–Putnam algorithm / Ansgar / Boolean satisfiability problem / Automated theorem proving / Theoretical computer science / Mathematics
Date: 2006-06-05 00:33:08
Mathematical logic
Constraint programming
Boolean algebra
Resolution
Conjunctive normal form
Unit propagation
Davis–Putnam algorithm
Ansgar
Boolean satisfiability problem
Automated theorem proving
Theoretical computer science
Mathematics

Overview Modelling Algorithmic Verification Comp4151 Lecture 9-A

Add to Reading List

Source URL: www.cse.unsw.edu.au

Download Document from Source Website

File Size: 213,78 KB

Share Document on Facebook

Similar Documents

Elements of Mathematical Logic Michael Meyling May 24, 2013 2

DocID: 1v8gE - View Document

INL (instantial neighborhood logic) - tableau, sequent calculus, interpolation Junhua Yu () Tsinghua University (Beijing, China @ Steklov Mathematical Institute

DocID: 1v7WD - View Document

List of Publications Ofer Arieli Books 1. A.Avron, O.Arieli. A.Zamansky. Theory of Effective Propositional Paraconsistent Logics. Studies in Logic, volume 75 (sub-series: Mathematical Logic and Foundations), College Publ

DocID: 1v75y - View Document

DraftNot to be quoted or cited without permission. Evidence and the hierarchy of mathematical theories Charles Parsons It is a well-known fact of mathematical logic, by now developed in considerable detail, t

DocID: 1uWo1 - View Document

Title : The Cultural Red King Effect Published in : The Journal of Mathematical Sociology Author : Cailin O’Connor Address : Department of Logic and Philosophy of Science, University of California, Irvine, 3151 Social

DocID: 1uOFQ - View Document