000 | 05211nam a22005175i 4500 | ||
---|---|---|---|
001 | 978-3-540-39831-8 | ||
003 | DE-He213 | ||
005 | 20160624101945.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s1986 gw | s |||| 0|eng d | ||
020 |
_a9783540398318 _9978-3-540-39831-8 |
||
024 | 7 |
_a10.1007/3-540-16492-8 _2doi |
|
050 | 4 | _aQA76.9.L63 | |
050 | 4 | _aQA76.5913 | |
050 | 4 | _aQA76.63 | |
072 | 7 |
_aUM _2bicssc |
|
072 | 7 |
_aUYF _2bicssc |
|
072 | 7 |
_aCOM051000 _2bisacsh |
|
072 | 7 |
_aCOM036000 _2bisacsh |
|
082 | 0 | 4 |
_a005.1015113 _223 |
245 | 1 | 0 |
_aThird International Conference on Logic Programming _h[electronic resource] : _bImperial College of Science and Technology, London, United Kingdom, July 14–18, 1986 Proceedings / _cedited by Ehud Shapiro. |
260 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1986. |
|
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1986. |
|
300 |
_aIX, 723 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v225 |
|
505 | 0 | _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. | |
650 | 0 | _aComputer science. | |
650 | 0 | _aLogic design. | |
650 | 0 | _aArtificial intelligence. | |
650 | 1 | 4 | _aComputer Science. |
650 | 2 | 4 | _aLogics and Meanings of Programs. |
650 | 2 | 4 | _aArtificial Intelligence (incl. Robotics). |
700 | 1 |
_aShapiro, Ehud. _eeditor. |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783540164920 |
786 | _dSpringer | ||
830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v225 |
|
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/3-540-16492-8 |
942 |
_2EBK4731 _cEBK |
||
999 |
_c34025 _d34025 |