LEADER 05156nam 22005775 450 001 996466137703316 005 20200706053751.0 010 $a3-540-47830-2 024 7 $a10.1007/3-540-56944-8 035 $a(CKB)1000000000233988 035 $a(SSID)ssj0000324518 035 $a(PQKBManifestationID)11251057 035 $a(PQKBTitleCode)TC0000324518 035 $a(PQKBWorkID)10305234 035 $a(PQKB)10385292 035 $a(DE-He213)978-3-540-47830-0 035 $a(PPN)155186442 035 $a(EXLCZ)991000000000233988 100 $a20121227d1993 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aLogic Programming and Automated Reasoning$b[electronic resource] $e4th International Conference, LPAR'93, St.Petersburg, Russia, July 13-20, 1993. Proceedings /$fedited by Andrei Voronkov 205 $a1st ed. 1993. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1993. 215 $a1 online resource (XIV, 394 p.) 225 1 $aLecture Notes in Artificial Intelligence ;$v698 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-56944-8 327 $aEntailment and disentailment of order-sorted feature constraints -- Computing extensions of default logic ? Preliminary report -- Prolog with arrays and bounded quantifications -- Linear 0?1 inequalities and extended clauses -- Search space pruning by checking dynamic term growth -- A proof search system for a modal substructural logic based on labelled deductive systems -- Consistency checking of automata functional specifications -- Yet another application for Toupie: Verification of mutual exclusion algorithms -- Parsing with DCG-terms -- A first order resolution calculus with symmetries -- Ordered paramodulation and resolution as decision procedure -- Static analysis of Prolog with cut -- A new type theory for representing logics -- Verification of Switch-level designs with many-valued logic -- Deciding in HFS-theory via linear integer programming -- The completion of typed logic programs and SLDNF-resolution -- Increasing the versatility of heuristic based theorem provers -- Sequentialization of parallel logic programs with mode analysis -- Refinements and extensions of model elimination -- Executable specifications based on dynamic algebras -- Generic resolution in propositional modal systems -- Optimized translation of multi modal logic into predicate logic -- Default reasoning with a constraint resolution principle -- Non-clausal deductive techniques for computing prime implicants and prime implicates -- Unification under one-sided distributivity with a multiplicative unit -- Unification in Order-Sorted Logic with Term Declarations -- Extracting inheritance hierarchies from Prolog programs: A system based on the inference of type relations -- A comparison of mechanisms for avoiding repetition of subdeductions in chain format linear deduction systems -- Neutralization and preemption in extended logic programs -- MULTLOG: A system for axiomatizing many-valued logics -- SKIL: A system for programming with proofs -- Reasoning about the reals: the marriage of HOL and maple -- System description of LAMBDALG -- Mixing metafor -- A complete axiom system for isomorphism of types in closed categories -- Reasoning, modeling, and component-based technology. 330 $aLPAR is an international conference series aimed at bringing together researchers interested in logic programming and automated reasoning. The research in logic programming grew out of the research in automated reasoning in the early 1970s. Later, the implementation techniques known from logic programming were used in implementing theorem proving systems. Results from both fields applied to deductive databases. This volume contains the proceedings of LPAR '93, which was organized by the Russian Association for Logic Programming. The volume contains 35 contributed papers selected from 84 submissions, together with an invited paper by Peter Wegner entitled "Reasoning versus modeling in computer science". 410 0$aLecture Notes in Artificial Intelligence ;$v698 606 $aArtificial intelligence 606 $aMathematical 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 $aMathematical Logic and Foundations$3https://scigraph.springernature.com/ontologies/product-market-codes/M24005 615 0$aArtificial intelligence. 615 0$aMathematical logic. 615 14$aArtificial Intelligence. 615 24$aMathematical Logic and Formal Languages. 615 24$aMathematical Logic and Foundations. 676 $a006.3 702 $aVoronkov$b Andrei$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aLPAR (Conference) 906 $aBOOK 912 $a996466137703316 996 $aLogic Programming and Automated Reasoning$92830654 997 $aUNISA LEADER 01092cam a2200253Mu 4500 001 991002110569707536 008 130710s2013 it 000 0 ita d 020 $a9788820427511 035 $ab14122790-39ule_inst 040 $aDip.to di Storia, Società e Studi sull'Uomo - Sez. Scienze Sociali Com.$bita 082 0 $a331.7 100 1 $aChieffi, Daniele$0478691 245 10$aWorking on web :$bgiornalisti e comunicatori: come non si inventa una professione /$cDaniele Chieffi, Claudia Dani, Marco Renzi 260 $aMilano :$bFrancoAngeli,$c2013 490 0 $aManuali ;$v241 650 4$aInternet$xProfessioni 700 1 $aDani, Claudia$eauthor$4http://id.loc.gov/vocabulary/relators/aut$0732451 700 1 $aRenzi, Marco$eauthor$4http://id.loc.gov/vocabulary/relators/aut$0732452 907 $a.b14122790$b02-04-14$c10-07-13 912 $a991002110569707536 945 $aLE021SOC26G76$g1$i2021000162701$lle021$o-$pE20.00$q-$rl$s- $t0$u1$v0$w1$x0$y.i15527268$z30-07-13 996 $aWorking on web$91443055 997 $aUNISALENTO 998 $ale021$b10-07-13$cm$da $e-$fita$git $h0$i0