| Record ID | marc_loc_2016/BooksAll.2016.part12.utf8:129115167:858 |
| Source | Library of Congress |
| Download Link | /show-records/marc_loc_2016/BooksAll.2016.part12.utf8:129115167:858?format=raw |
LEADER: 00858cam a2200253 i 4500
001 79622689
003 DLC
005 20130412101027.0
008 790815s1979 ilu b s000 0 eng
010 $a 79622689
040 $aDLC$cDLC$dDLC
050 00 $aQA76$b.I4 no. 955$aQA9.3
082 00 $a001.6/4/08 s$a511/.3
100 1 $aPlaisted, David A.
245 10 $aInference rules for unsatisfiability /$cby David A. Plaisted.
260 $aUrbana :$bDept. of Computer Science, University of Illinois at Urbana-Champaign,$c1979.
300 $a18 p. ;$c28 cm.
490 1 $aUIUCDCS-R ; 955
504 $aIncludes bibliographical references.
650 0 $aPropositional calculus.
650 0 $aPolynomials.
650 0 $aInference.
740 $aUnsatisfiability.
810 1 $aIllinois.$bUniversity at Urbana-Champaign.$bDepartment of Computer Science.$tReport ;$v955.