Logic Programming 20th International Conference, ICLP 2004, Saint-Malo, France, September 6-10, 2004. Proceedings /

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Demoen, Bart (Επιμελητής έκδοσης), Lifschitz, Vladimir (Επιμελητής έκδοσης)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2004.
Σειρά:Lecture Notes in Computer Science, 3132
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
Πίνακας περιεχομένων:
  • 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 Code Certification
  • 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.