Logic Programming
Editat de Philippe Codogneten Limba Engleză Paperback – 14 noi 2001
Preț: 326.47 lei
Preț vechi: 408.09 lei
-20%
Puncte Express: 490
Carte tipărită la comandă
Livrare economică 27 iulie-10 august
Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 400.00 lei Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
Specificații
ISBN-13: 9783540429357
ISBN-10: 3540429352
Pagini: 384
Ilustrații: XI, 368 p.
Dimensiuni: 155 x 235 x 21 mm
Greutate: 0.58 kg
Ediția:2001
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540429352
Pagini: 384
Ilustrații: XI, 368 p.
Dimensiuni: 155 x 235 x 21 mm
Greutate: 0.58 kg
Ediția:2001
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Invited 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.