000 08150cam a2201117 a 4500
001 ocn150398402
003 OCoLC
005 20250703143538.0
006 m o d
007 cr |||||||||||
008 060821s1993 gw a ob 100 0 eng d
010 _z 93243523
040 _aNLGGC
_beng
_epn
_cNLGGC
_dOCLCO
_dCUSER
_dKIJ
_dC$Q
_dGW5XE
_dOCLCA
_dGW5XE
_dITD
_dOCLCF
_dOCLCQ
_dOCLCO
_dOCLCQ
_dUAB
_dESU
_dOCLCQ
_dVT2
_dTFW
_dOCLCA
_dOCLCQ
_dOCLCO
_dOCLCE
_dOCLCO
_dOCLCQ
_dOCL
_dOCLCO
_dOCLCL
_dOCLCQ
_dCAUOI
_dINARC
_dOCLCO
019 _a321334071
_a827360305
_a1005748969
_a1081178893
_a1152978680
_a1162748315
_a1292180787
_a1321039341
_a1335733936
020 _a9783540478300
_q(electronic bk.)
020 _a3540478302
_q(electronic bk.)
020 _a3540569448
020 _a9783540569442
020 _z9783540569442
020 _z0387569448
_q(New York)
020 _z9780387569444
_q(New York)
029 0 _aNLGGC
_b296872709
029 1 _aAU@
_b000058030245
029 1 _aNZ1
_b15580595
035 _a(OCoLC)150398402
_z(OCoLC)321334071
_z(OCoLC)827360305
_z(OCoLC)1005748969
_z(OCoLC)1081178893
_z(OCoLC)1152978680
_z(OCoLC)1162748315
_z(OCoLC)1292180787
_z(OCoLC)1321039341
_z(OCoLC)1335733936
042 _adlr
050 4 _aQA76.63
_b.I55 1993
082 0 4 _a006.3
_220
084 _a54.72
_2bcl
084 _a54.51
_2bcl
084 _a54.10
_2bcl
084 _a54.71
_2bcl
084 _a*00B25
_2msc
084 _a68-06
_2msc
084 _a68N17
_2msc
084 _a68T15
_2msc
084 _a68T27
_2msc
049 _aMAIN
111 2 _aLPAR (Conference)
_n(4th :
_d1993 :
_cSaint Petersburg, Russia)
_921081
245 1 0 _aLogic programming and automated reasoning :
_b4th international conference, LPAR '93, St. Petersburg, Russia, July 1320, 1993 : proceedings /
_cAndrei Voronkov (ed.).
246 3 _aLPAR '93
264 1 _aBerlin :
_bSpringerVerlag,
_c©1993.
300 _a1 online resource (XIII, 386 pages) :
_billustrations
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
490 1 _aLecture notes in computer science,
_x0302-9743 ;
_v698.
_aLecture notes in artificial intelligence
504 _aIncludes bibliographical references.
588 0 _aOnline resource; title from PDF title page (SpringerLink, viewed October 16, 2013).
520 _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."
505 0 _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.
506 _3Use copy
_fRestrictions unspecified
_2star
_5MiAaHDL
533 _aElectronic reproduction.
_b[Place of publication not identified]:
_cHathiTrust Digital Library.
_d2022.
_5MiAaHDL
538 _aMaster and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002.
_uhttp://purl.oclc.org/DLF/benchrepro0212
_5MiAaHDL
583 1 _adigitized
_c2022.
_hHathiTrust Digital Library
_lcommitted to preserve
_2pda
_5MiAaHDL
650 0 _aComputer science.
_9941
650 0 _aArtificial intelligence.
_91340
650 0 _aLogic
_xSymbolic and mathematical.
650 0 _aLogic programming
_vCongresses.
_914819
650 0 _aAutomatic theorem proving
_vCongresses.
_914919
650 0 _aLogic programming
_xCongresses.
_9966929
650 0 _aAutomatic theorem proving
_xCongresses.
_9966928
650 0 _aLogic, Symbolic and mathematical.
_91341
650 1 _aAutomatic theorem proving.
_914923
650 2 _aElectronic Data Processing
_96665
650 2 _aArtificial Intelligence
_91340
650 6 _aProgrammation logique
_xCongrès.
_914822
650 6 _aThéorèmes
_xDémonstration automatique
_xCongrès.
_914928
650 6 _aInformatique.
_914930
650 6 _aIntelligence artificielle.
_915884
650 6 _aLogique symbolique et mathématique.
_911864
650 6 _aProgrammation logique
_vCongrès.
_914820
650 6 _aThéorèmes
_xDémonstration automatique
_vCongrès.
_914921
650 7 _aartificial intelligence.
_2aat
_91340
650 7 _aLogic programming
_2fast
_96178
650 7 _aAutomatic theorem proving
_2fast
_914923
650 7 _aArtificial intelligence
_2fast
_91340
650 7 _aComputer science
_2fast
_9941
650 7 _aLogic, Symbolic and mathematical
_2fast
_91341
650 1 7 _aAutomatische bewijsvoering.
_2gtt
_914926
650 1 7 _aLogisch programmeren.
_2gtt
650 7 _aLinguagens Formais E Automatos.
_2larpcal
_920615
650 7 _aAutomatic theorem proving
_xCongresses.
_2nli
_9966928
650 7 _aLogic programming
_xCongresses.
_2nli
_9966929
650 7 _aProgrammation logique.
_2ram
_917686
650 7 _aThéorèmes
_xDémonstration automatique.
_2ram
_915071
655 7 _aConference papers and proceedings
_2fast
_96065
655 7 _aCongressen (vorm)
_2gtt
_98970
700 1 _aVoronkov, Andrei,
_d1959-
_4edt
_1https://id.oclc.org/worldcat/entity/E39PBJcgthTcG6JvmR8d8V6xjC
_916227
776 0 8 _iPrint version:
_tLogic programming and automated reasoning
_w(NLLeOCL)109099613
830 0 _aLecture notes in computer science ;
_v698.
_x0302-9743
830 0 _aLecture notes in computer science.
_pLecture notes in artificial intelligence.
_914916
856 4 0 _uhttps://link.springer.com/10.1007/3-540-56944-8
938 _aInternet Archive
_bINAR
_nlogicprogramming0000lpar_w6y7
994 _a92
_bATIST
999 _c636150
_d636150