| Record ID | ia:inferencerulesfo955plai |
| Source | Internet Archive |
| Download MARC XML | https://archive.org/download/inferencerulesfo955plai/inferencerulesfo955plai_marc.xml |
| Download MARC binary | https://www.archive.org/download/inferencerulesfo955plai/inferencerulesfo955plai_meta.mrc |
LEADER: 00950nam 2200265Ia 4500
001 7216052
005 20130426090920.0
008 130426s1979 ilu b s000 0 eng
035 $a(OCoLC)ocn840914683
040 $aUIU$cUIU
049 $aUIUU
100 1 $aPlaisted, David A.
245 10 $aInference rules for unsatisfiability /$cby David A. Plaisted.
260 $aUrbana, Illinois :$bDept. of Computer Science, University of Illinois at Urbana-Champaign,$c1979.
300 $a18 p. ;$c28 cm.
490 1 $aReport ;$v955
500 $aUIUCDCS-R-79-955
504 $aIncludes bibliographical references (page 18).
650 0 $aPropositional calculus.
650 0 $aPolynomials.
650 0 $aInference.
710 2 $aUniversity of Illinois at Urbana-Champaign.$bDepartment of Computer Science.
740 01 $aUnsatisfiability.
830 0 $aReport (University of Illinois at Urbana-Champaign. Department of Computer Science) ;$v955.
994 $aC0$bUIU