Bitte haben Sie einen Moment Geduld, wir legen Ihr Produkt in den Warenkorb.
Bitte haben Sie einen Moment Geduld, wir legen Ihr Produkt in den Warenkorb.
| Reihe | Lecture Notes in Computer Science |
|---|---|
| Themen | Informatik und Informationstechnologie Informatik Künstliche Intelligenz (KI) |
| ISBN | 9783540429357 |
| Sprache | Englisch |
| Erscheinungsdatum | 14.11.2001 |
| Größe | 235 x 155 mm |
| Verlag | Springer |
| Herausgegeben von | Philippe Codognet |
| Lieferzeit | Lieferung in 7-14 Werktagen |
| Herstellerangaben | Anzeigen Europaplatz 3 | DE-69115 Heidelberg ProductSafety@springernature.com |
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.
| Reihe | Lecture Notes in Computer Science |
|---|---|
| Themen | Informatik und Informationstechnologie Informatik Künstliche Intelligenz (KI) |
| ISBN | 9783540429357 |
| Sprache | Englisch |
| Erscheinungsdatum | 14.11.2001 |
| Größe | 235 x 155 mm |
| Verlag | Springer |
| Herausgegeben von | Philippe Codognet |
| Lieferzeit | Lieferung in 7-14 Werktagen |
| Herstellerangaben | Anzeigen Europaplatz 3 | DE-69115 Heidelberg ProductSafety@springernature.com |
Wie gefällt Ihnen unser Shop?