000 04303nam a22006135i 4500
001 978-3-540-45635-3
003 DE-He213
005 20240423132456.0
007 cr nn 008mamaa
008 121227s2001 gw | s |||| 0|eng d
020 _a9783540456353
_9978-3-540-45635-3
024 7 _a10.1007/3-540-45635-X
_2doi
050 4 _aQA76.9.S88
072 7 _aUYD
_2bicssc
072 7 _aCOM011000
_2bisacsh
072 7 _aUYD
_2thema
082 0 4 _a004.2
_223
245 1 0 _aLogic Programming
_h[electronic resource] :
_b17th International Conference, ICLP 2001, Paphos, Cyprus, November 26 - December 1, 2001. Proceedings /
_cedited by Philippe Codognet.
250 _a1st ed. 2001.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2001.
300 _aXI, 368 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,
_x1611-3349 ;
_v2237
505 0 _aInvited Speakers -- Solving the Multiplication Constraint in Several Approximation Spaces -- Is Logic Really Dead or Only Just Sleeping? -- Design of Syntactic Program Transformations by Abstract Interpretation of Semantic Transformations -- X-tegration — Some Cross-Enterprise Thoughts -- Tutorials -- Building Real-Life Applications with Prolog -- Natural Language Tabular Parsing -- A Close Look at Constraint-Based Concurrency -- Probabilistic Databases and Logic Programming -- Conference Papers -- Understanding Memory Management in Prolog Systems -- PALS: An Or-Parallel Implementation of Prolog on Beowulf Architectures -- On a Tabling Engine That Can Exploit Or-Parallelism -- Revisiting the Cardinality Operator and Introducing the Cardinality-PathConstraint Family -- Optimizing Compilation of Constraint Handling Rules -- Building Constraint Solvers with HAL -- Practical Aspects for a Working Compile Time Garbage Collection System for Mercury -- Positive Boolean Functions as Multiheaded Clauses -- Higher-Precision Groundness Analysis -- Speculative Beats Conservative Justification -- Local and Symbolic Bisimulation Using Tabled Constraint Logic Programming -- A Simple Scheme for Implementing Tabled Logic Programming Systems Based on Dynamic Reordering of Alternatives -- Fixed-Parameter Complexity of Semantics for Logic Programs -- Ultimate Well-Founded and Stable Semantics for Logic Programs with Aggregates -- Alternating Fixed Points in Boolean Equation Systems as Preferred Stable Models -- Fages’ Theorem for Programs with Nested Expressions -- Semantics of Normal Logic Programs with Embedded Implications -- A Multi-adjoint Logic Approach to Abductive Reasoning -- Proving Correctness and Completeness of Normal Programs — A Declarative Approach -- An Order-Sorted Resolution with ImplicitlyNegative Sorts -- Logic Programming in a Fragment of Intuitionistic Temporal Linear Logic -- A Computational Model for Functional Logic Deductive Databases -- A Logic Programming Approach to the Integration, Repairing and Querying of Inconsistent Databases.
650 0 _aComputer systems.
650 0 _aSoftware engineering.
650 0 _aComputer programming.
650 0 _aArtificial intelligence.
650 0 _aCompilers (Computer programs).
650 0 _aComputer science.
650 1 4 _aComputer System Implementation.
650 2 4 _aSoftware Engineering.
650 2 4 _aProgramming Techniques.
650 2 4 _aArtificial Intelligence.
650 2 4 _aCompilers and Interpreters.
650 2 4 _aComputer Science Logic and Foundations of Programming.
700 1 _aCodognet, Philippe.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540429357
776 0 8 _iPrinted edition:
_z9783662208083
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v2237
856 4 0 _uhttps://doi.org/10.1007/3-540-45635-X
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
912 _aZDB-2-BAE
942 _cSPRINGER
999 _c188172
_d188172