LEADER 01305nam0 22003493i 450 
001 UBO0009847
005 20251003044417.0
010   $a0817635300
010   $a3764335300
100   $a20081006d1990    ||||0itac50      ba
101 | $aeng
102   $aus
181  1$6z01$ai $bxxxe  
182  1$6z01$an
200 1 $aGraph-based proof procedures for Horn clauses$fStan Raatz
210   $aBoston [etc.]$cBirkhauser$dc1990
215   $a147 p.$d24 cm.
225 | $aProgress in computer science and applied logic$v10
410  0$1001MIL0098321$12001 $aProgress in computer science and applied logic$v10
606   $aProgrammazione logica$2FIR$3CFIC136733$9E
606   $aElaboratori elettronici$xProgrammazione$2FIR$3CFIC000860$9E
676   $a005.1$9PROGRAMMAZIONE$v14
676   $a005.115$9PROGRAMMAZIONE LOGICA$v22
700  1$aRaatz$b, Stan$3UBOV008041$4070$0771872
801  3$aIT$bIT-000000$c20081006
850   $aIT-BN0095          
901   $bNAP 01$cSALA DING $n$
912   $aUBO0009847
950  0$aBiblioteca Centralizzata di Ateneo$c1 v.$d 01SALA DING 005.1                   RAA.gr$e 0102 0000009745  VMA A4                    1 v.$fY $h19940429$i19940429
977   $a 01
996   $aGraph-based proof procedures for Horn clauses$91575480
997   $aUNISANNIO