LEADER 00849nam a2200241 i 4500 001 991002474519707536 005 20020503165730.0 008 010315s1980 it ||| | ita 035 $ab10369934-39ule_inst 035 $aEXGIL104504$9ExL 040 $aBiblioteca Interfacoltà$bita 082 0 $a323 110 2 $aAmnesty international$040000 245 12$aI differenti volti della detenzione 260 $aGenova :$bAmnesty international,$c1980 300 $a34 p. ;$c30 cm. 650 4$aPerseguitati politici$ySec. 20. 907 $a.b10369934$b02-04-14$c27-06-02 912 $a991002474519707536 945 $aLE002 Busta 22 4$g1$i2002000794864$lle002$o-$pE0.00$q-$rl$s- $t0$u1$v0$w1$x0$y.i10432553$z27-06-02 996 $aDifferenti volti della detenzione$9203621 997 $aUNISALENTO 998 $ale002$b01-01-01$cm$da $e-$fita$git $h2$i1 LEADER 05713nam 22006735 450 001 9910143638903321 005 20251116234014.0 010 $a3-540-46508-1 024 7 $a10.1007/3-540-46508-1 035 $a(CKB)1000000000211206 035 $a(SSID)ssj0000321528 035 $a(PQKBManifestationID)11227087 035 $a(PQKBTitleCode)TC0000321528 035 $a(PQKBWorkID)10280880 035 $a(PQKB)10116997 035 $a(DE-He213)978-3-540-46508-9 035 $a(MiAaPQ)EBC3072101 035 $a(PPN)155177648 035 $a(BIP)6425303 035 $a(EXLCZ)991000000000211206 100 $a20121227d2000 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAutomated Deduction in Classical and Non-Classical Logics $eSelected Papers /$fedited by Ricardo Caferra, Gernot Salzer 205 $a1st ed. 2000. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2000. 215 $a1 online resource (VIII, 304 p.) 225 1 $aLecture Notes in Artificial Intelligence ;$v1761 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-540-67190-0 320 $aIncludes bibliographical references and index. 327 $aInvited Papers -- Automated Theorem Proving in First-Order Logic Modulo: On the Difference between Type Theory and Set Theory -- Higher-Order Modal Logic?A Sketch -- Proving Associative-Commutative Termination Using RPO-Compatible Orderings -- Decision Procedures and Model Building or How to Improve Logical Information in Automated Deduction -- Replacement Rules with Definition Detection -- Contributed Papers -- On the Complexity of Finite Sorted Algebras -- A Further and Effective Liberalization of the ?-Rule in Free Variable Semantic Tableaux -- A New Fast Tableau-Based Decision Procedure for an Unquantified Fragment of Set Theory -- Interpretation of a Mizar-Like Logic in First Order Logic -- An ((n · log n)3)-Time Transformation from Grz into Decidable Fragments of Classical First-Order Logic -- Implicational Completeness of Signed Resolution -- An Equational Re-engineering of Set Theories -- Issues of Decidability for Description Logics in the Framework of Resolution -- Extending Decidable Clause Classes via Constraints -- Completeness and Redundancy in Constrained Clause Logic -- Effective Properties of Some First Order Intuitionistic Modal Logics -- Hidden Congruent Deduction -- Resolution-Based Theorem Proving for SH n-Logics -- Full First-Order Sequent and Tableau Calculi With Preservation of Solutions and the Liberalized ?-Rule but Without Skolemization. 330 $aThisvolumeisacollectionofpapers onautomateddeduction inclassical,modal, and many-valued logics, with an emphasis on rst-order theories. Some authors bridgethe gaptohigher-order logicbydealingwithsimpletype theory ina r- order setting, or by resolving shortcomings of r st-order logic with the help of higher-order notions. Most papers rely on resolution or tableaux methods, with a few exceptions choosing the equational paradigm. In its entirety the volume is a mirror of contemporary research in r st-order theorem proving. One trend to be observed is the interest in e ective decision procedures. The main aim of rs t-order theorem proving was and still is to demonstrate the validity or unsatisa bility of formulas, by more and more - phisticatedmethods. Withinthelastyears,however,theothersideofthemedal{ falsi abilityand satisab ility { has r eceived growing attention. Though in g- eral non-terminating, theorem provers sometimes act as decision procedures on subclasses ofrs t-order logic. Inparticularcases theiroutputcanevenbeused to extract n ite representations of models or counter-examples. Another devel- mentistheextension ofdeductiontechniquesfromclassicallogictomany-valued and modal logics. By suitably generalizing classical concepts many results carry over to non-classical logics. This line of research is stimulated by artici al int- ligence with its need for more expressive logics capable of modeling real-world reasoning. From a formal point of view this volume comprises two types of papers, invited and contributed ones. Gilles Dowek, Melvin Fitting, Deepak Kapur, Alexander Leitsch, and David Plaisted accepted our invitation to present recent developments in and their view of the e ld. Contributed papers on the other hand underwent a two-staged selection process. 410 0$aLecture Notes in Artificial Intelligence ;$v1761 606 $aArtificial intelligence 606 $aLogic, Symbolic and mathematical 606 $aComputer logic 606 $aArtificial Intelligence$3https://scigraph.springernature.com/ontologies/product-market-codes/I21000 606 $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048 606 $aLogics and Meanings of Programs$3https://scigraph.springernature.com/ontologies/product-market-codes/I1603X 615 0$aArtificial intelligence. 615 0$aLogic, Symbolic and mathematical. 615 0$aComputer logic. 615 14$aArtificial Intelligence. 615 24$aMathematical Logic and Formal Languages. 615 24$aLogics and Meanings of Programs. 676 $a006.3/33 702 $aCaferra$b Ricardo$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aSalzer$b Gernot$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910143638903321 996 $aAutomated deduction in classical and non-classical logics$91488828 997 $aUNINA