LEADER 05403nam 22005295 450 001 996465707603316 005 20210902162831.0 010 $a3-540-39831-7 024 7 $a10.1007/3-540-16492-8 035 $a(CKB)1000000000230522 035 $a(SSID)ssj0000327248 035 $a(PQKBManifestationID)11232916 035 $a(PQKBTitleCode)TC0000327248 035 $a(PQKBWorkID)10301507 035 $a(PQKB)11083924 035 $a(DE-He213)978-3-540-39831-8 035 $a(PPN)155214519 035 $a(EXLCZ)991000000000230522 100 $a20121227d1986 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aThird International Conference on Logic Programming$b[electronic resource] $eImperial College of Science and Technology, London, United Kingdom, July 14-18, 1986. Proceedings /$fedited by Ehud Shapiro 205 $a1st ed. 1986. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1986. 215 $a1 online resource (IX, 723 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v225 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-16492-8 327 $aThe role of logic programming in the Fifth Generation Computer Project -- An abstract machine for restricted AND-parallel execution of logic programs -- Efficient management of backtracking in AND-Parallelism -- An intelligent backtracking algorithm for parallel execution of logic programs -- Delta Prolog: A distributed backtracking extension with events -- OLD resolution with tabulation -- Logic programs and alternation -- Intractable unifiability problems and backtracking -- On the complexity of unification sequences -- How to invent a Prolog machine -- A sequential implementation of Parlog -- A GHC abstract machine and instruction set -- A Prolog processor based on a pattern matching memory device -- An improved version of Shapiro's model inference system -- A framework for ICAI systems based on inductive inference and logic programming -- Rational debugging in logic programming -- Using definite clauses and integrity constraints as the basis for a theory formation approach to diagnostic reasoning -- Some issues and trends in the semantics of logic programming -- Parallel logic programming languages -- P-Prolog: A parallel logic language based on exclusive relation -- Making exhaustive search programs deterministic -- Compiling OR-parallelism into AND-parallelism -- Shared memory execution of committed-choice languages -- Logic program semantics for programming with equations -- On the semantics of logic programming languages -- Towards a formal semantics for concurrent logic programming languages -- Design of a Prolog-based machine translation system -- Parallel logic programming for numeric applications -- Sequential and concurrent deterministic logic grammars -- A parallel parsing system for natural language analysis -- Equivalences of logic programs -- Qualified answers and their application to transformation -- Procedures in Horn-clause programming -- Higher-order logic programming -- Abstract interpretation of Prolog programs -- Verifleation of Prolog programs using an extension of execution -- Detection and optimization of functional computations in Prolog -- Control of logic program execution based on the functional relation -- Declarative graphics -- Test-pattern generation for VLSI circuits in a Prolog environment -- Using Prolog to represent and reason about protein structure -- A New approach for introducing Prolog to naive users -- Prolog programming environments: Architecture and implementation -- Design overview of the NAIL! System -- A superimposed codeword indexing scheme for very large Prolog databases -- Interfacing Prolog to a persistent data store -- A general model to implement DIF and FREEZE -- Cyclic tree traversal -- Completeness of the SLDNF-resolution for a class of logic programs -- Choices in, and limitations of, logic programming -- Negation and quantifiers in NU-Prolog -- Gracefully adding negation and disjunction to Prolog -- Memory performance of Lisp and Prolog programs -- The design and implementation of a high-speed incremental portable Prolog compiler -- Compiler optimizations for the WAM -- Fast decompilation of compiled Prolog clauses -- Logic continuations -- Cut & Paste ? defining the impure primitives of Prolog -- Tokio: Logic programming language based on temporal logic and its compilation to Prolog -- The OR-forest description for the execution of logic programs. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v225 606 $aComputer logic 606 $aArtificial intelligence 606 $aLogics and Meanings of Programs$3https://scigraph.springernature.com/ontologies/product-market-codes/I1603X 606 $aArtificial Intelligence$3https://scigraph.springernature.com/ontologies/product-market-codes/I21000 615 0$aComputer logic. 615 0$aArtificial intelligence. 615 14$aLogics and Meanings of Programs. 615 24$aArtificial Intelligence. 676 $a005.1015113 702 $aShapiro$b Ehud Y$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996465707603316 996 $aThird International Conference on Logic Programming$9382929 997 $aUNISA