Logic Programming
Subtitle: 20th International Conference, ICLP 2004, Saint-Malo, France, September 6-10, 2004, Proceedings (Lecture Notes in Computer Science)
Contributors: Bart Demoen (Editor); Vladimir Lifschitz (Editor)
Edition: 1 edition
Publisher: Springer
Published: October 15, 2004
Language: eng
Format: Paperback
Number of pages: 480
ISBN-13: 9783540226710
Subjects: Computer Programming; Programming Languages - General; Computers - Languages / Programming; Computers; Computer Books: Languages; Logic Design; Programming - General; Computers / Programming / General; Congresses; Congráes; Logic programming; Logisch programmeren; Programmation logique; gtt
First sentence: For as long as there have been algorithms, the question of their termination - though undecidable, in general - has had to be addressed.
Description: Logic Programming: 20th International Conference, ICLP 2004, Saint-Malo, France, September 6-10, 2004. Proceedings<br />Author: Bart Demoen, Vladimir Lifschitz<br /> Published by Springer Berlin Heidelberg<br /> ISBN: 978-3-540-22671-0<br /> DOI: 10.1007/b99475<br /><br />Table of Contents:<p></p><ul><li>Termination by Abstraction
</li><li>Answer Set Programming and the Design of Deliberative Agents
</li><li>Abstract Domains Based on Regular Types
</li><li>Termination of Logic Programs Using Various Dynamic Selection Rules
</li><li>Improving Prolog Programs: Refactoring for Prolog
</li><li>Smodels with CLP and Its Applications: A Simple and Effective Approach to Aggregates in ASP
</li><li>The Refined Operational Semantics of Constraint Handling Rules
</li><li>Compiling Ask Constraints
</li><li>Constraint Handling Rules and Tabled Execution
</li><li>Possible Worlds Semantics for Probabilistic Logic Programs
</li><li>Limiting Resolution: From Foundations to Implementation
</li><li>Generalised Kernel Sets for Inverse Entailment
</li><li>On Programs with Linearly Ordered Multiple Preferences
</li><li>Splitting an Operator
</li><li>Simplifying Logic Programs Under Answer Set Semantics
</li><li>On Acyclic and Head-Cycle Free Nested Logic Programs
</li><li>Fast Query Evaluation with (Lazy) Control Flow Compilation
</li><li>Speculative Computations in Or-Parallel Tabled Logic Programs
</li><li>αProlog: A Logic Programming Language with Names, Binding and α-Equivalence
</li><li>Implementation Results in Classical Constructive Negation</li></ul>