000 | 03568nam a22005055i 4500 | ||
---|---|---|---|
001 | 978-3-540-46599-7 | ||
003 | DE-He213 | ||
005 | 20160624102016.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s1991 gw | s |||| 0|eng d | ||
020 |
_a9783540465997 _9978-3-540-46599-7 |
||
024 | 7 |
_a10.1007/3-540-54938-2 _2doi |
|
050 | 4 | _aQA76.6-76.66 | |
072 | 7 |
_aUM _2bicssc |
|
072 | 7 |
_aCOM051000 _2bisacsh |
|
082 | 0 | 4 |
_a005.11 _223 |
100 | 1 |
_aJacquet, Jean-Marie. _eauthor. |
|
245 | 1 | 0 |
_aConclog: A Methodological Approach to Concurrent Logic Programming _h[electronic resource] / _cby Jean-Marie Jacquet. |
260 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1991. |
|
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1991. |
|
300 |
_aXIII, 787 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 ; _v556 |
|
505 | 0 | _aLogic programming -- A reconciliation calculus -- A basic scheme for concurrent logic programming -- Incorporating negation -- Adding extra-logical features -- Event-driven reconciliation -- Comparison with related work -- Conclusion -- Towards a methodology of concurrent logic programming -- Programming non-behavioral applications -- Programming behavorial applications -- Conclusion -- Conclusion. | |
520 | _aThis book presents a new concurrent logic programming language called Conclog and a methodology for programming in it. Conclog was designed bytaking the ideal features of logic programming as reference, rather than by concentrating directly on operational tricks to ensure efficiency. This leads to quite easy declarative programming. Concern for soundness and completeness ensures that multi-directional and multi-solution correct procedures can be coded quite straightforwardly. Assuming suitable hypotheses on their uses, they can be transformed into very efficient versions thanks to the introduction of appropriate control information. Correctness-preserving properties are given for that purpose. The designof Conclog involves three steps. First, a sound and complete parallel execution model of Horn clause programs is proposed which reduces subgoals of conjunctions independently and uses a calculus for reconciling inconsistent bindings. Second, this is extended to handle negation as completely as possible. Third, a minimal and reasonably complete set of extra-logical features are defined for optimization and practical purposes. The second part of the book presents a methodology for constructing Conclog in a rigorous way. This covers the entire programming process, from informal specifications via logic descriptions to efficient programs. The methodology can be adapted to other languages. | ||
650 | 0 | _aComputer science. | |
650 | 0 | _aSoftware engineering. | |
650 | 0 | _aArtificial intelligence. | |
650 | 1 | 4 | _aComputer Science. |
650 | 2 | 4 | _aProgramming Techniques. |
650 | 2 | 4 | _aSoftware Engineering. |
650 | 2 | 4 | _aProgramming Languages, Compilers, Interpreters. |
650 | 2 | 4 | _aArtificial Intelligence (incl. Robotics). |
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783540549383 |
786 | _dSpringer | ||
830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v556 |
|
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/3-540-54938-2 |
942 |
_2EBK5832 _cEBK |
||
999 |
_c35126 _d35126 |