Cantitate/Preț
Produs

Logic Programming: 20th International Conference, ICLP 2004, Saint-Malo, France, September 6-10, 2004, Proceedings: Lecture Notes in Computer Science, cartea 3132

Editat de Bart Demoen, Vladimir Lifschitz
en Limba Engleză Paperback – 24 aug 2004

Din seria Lecture Notes in Computer Science

Preț: 34874 lei

Preț vechi: 43592 lei
-20% Nou

Puncte Express: 523

Preț estimativ în valută:
6675 6957$ 5556£

Carte tipărită la comandă

Livrare economică 06-20 ianuarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540226710
ISBN-10: 3540226710
Pagini: 496
Ilustrații: XII, 484 p.
Dimensiuni: 152 x 229 x 26 mm
Greutate: 1.15 kg
Ediția:2004
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

Invited Talks.- Termination by Abstraction.- Answer Set Programming and the Design of Deliberative Agents.- Regular Talks.- Abstract Domains Based on Regular Types.- Termination of Logic Programs Using Various Dynamic Selection Rules.- Improving Prolog Programs: Refactoring for Prolog.- Smodels with CLP and Its Applications: A Simple and Effective Approach to Aggregates in ASP.- The Refined Operational Semantics of Constraint Handling Rules.- Compiling Ask Constraints.- Constraint Handling Rules and Tabled Execution.- Possible Worlds Semantics for Probabilistic Logic Programs.- Limiting Resolution: From Foundations to Implementation.- Generalised Kernel Sets for Inverse Entailment.- On Programs with Linearly Ordered Multiple Preferences.- Splitting an Operator.- Simplifying Logic Programs Under Answer Set Semantics.- On Acyclic and Head-Cycle Free Nested Logic Programs.- Fast Query Evaluation with (Lazy) Control Flow Compilation.- Speculative Computations in Or-Parallel Tabled Logic Programs.- ?Prolog: A Logic Programming Language with Names, Binding and ?-Equivalence.- Implementation Results in Classical Constructive Negation.- On Hybridization of Local Search and Constraint Propagation.- Arc-Consistency + Unit Propagation = Lookahead.- The period Constraint.- Non-viability Deductions in Arc-Consistency Computation.- Compiling Prioritized Circumscription into Answer Set Programming.- Enhancing the Magic-Set Method for Disjunctive Datalog Programs.- Rectilinear Steiner Tree Construction Using Answer Set Programming.- Adding Domain Dependent Knowledge into Answer Set Programs for Planning.- Multi-agent Coordination as Distributed Logic Programming.- Logic Programs with Annotated Disjunctions.- Poster Presentations.- Abstract Interpretation-Based Mobile CodeCertification.- Labeled Logic Programs.- Xcerpt and XChange – Logic Programming Languages for Querying and Evolution on the Web.- Protein Folding Simulation in CCP.- Applying CLP to Predict Extra-Functional Properties of Component-Based Models.- Main Results of the OADymPPaC Project.- FDBG, the CLP Debugger Library of SICStus Prolog.- Development of Semantic Debuggers Based on Refinement Calculus.- A Tracer Driver to Enable Debugging, Monitoring and Visualization of CLP Executions from a Single Tracer.- Grid Service Selection with PPDL.- Concurrent Constraint Programming and Tree–Based Acoustic Modelling.- MProlog: An Extension of Prolog for Modal Logic Programming.- Probabilistic Choice Operators as Global Constraints: Application to Statistical Software Testing.- Constraint-Based Synchronization and Verification of Distributed Java Programs.- JmmSolve: A Generative Java Memory Model Implemented in Prolog and CHR.- Agent Oriented Logic Programming Constructs in Jinni 2004.

Caracteristici

Includes supplementary material: sn.pub/extras