Logic Programming

22nd International Conference, ICLP 2006, Seattle, WA, USA, August 17-20, 2006. Proceedings

Editors:

ISBN: 978-3-540-36635-5 (Print) 978-3-540-36636-2 (Online)

Table of contents (54 chapters)

previous Page of 3
  1. Front Matter

    Pages -

  2. Invited Talks

    1. No Access

      Book Chapter

      Pages 1-1

      Why Use Datalog to Analyze Programs?

    2. No Access

      Book Chapter

      Pages 2-2

      Semantic Web: The Story of the RIFt so Far

  3. Invited Tutorial

    1. No Access

      Book Chapter

      Pages 3-10

      Overcoming Performance Barriers: Efficient Verification Techniques for Logical Frameworks

  4. Regular Talks Theory

    1. No Access

      Book Chapter

      Pages 11-25

      Tableau Calculi for Answer Set Programming

    2. No Access

      Book Chapter

      Pages 26-40

      Declarative Semantics of Production Rules for Integrity Maintenance

    3. No Access

      Book Chapter

      Pages 41-55

      Modules for Prolog Revisited

    4. No Access

      Book Chapter

      Pages 56-71

      A Local Algorithm for Incremental Evaluation of Tabled Logic Programs

  5. Functional and Constraint Logic Programming

    1. No Access

      Book Chapter

      Pages 72-86

      Memory Reuse for CHR

    2. No Access

      Book Chapter

      Pages 87-101

      Overlapping Rules and Logic Variables in Functional Logic Programs

    3. No Access

      Book Chapter

      Pages 102-116

      Towards “Propagation = Logic + Control”

    4. No Access

      Book Chapter

      Pages 117-131

      ACD Term Rewriting

  6. Program Analysis

    1. No Access

      Book Chapter

      Pages 132-147

      Detecting Determinacy in Prolog Programs

    2. No Access

      Book Chapter

      Pages 148-162

      Collapsing Closures

    3. No Access

      Book Chapter

      Pages 163-178

      Reduced Certificates for Abstraction-Carrying Code

    4. No Access

      Book Chapter

      Pages 179-195

      Proving Properties of Constraint Logic Programs by Eliminating Existential Variables

  7. Answer-Set Programming

    1. No Access

      Book Chapter

      Pages 196-210

      Justifications for Logic Programs Under Answer Set Semantics

    2. No Access

      Book Chapter

      Pages 211-225

      Generality Relations in Answer Set Programming

    3. No Access

      Book Chapter

      Pages 226-241

      Cooperating Answer Set Programming

    4. No Access

      Book Chapter

      Pages 242-256

      Predicate Introduction Under Stable and Well-Founded Semantics

  8. Special Interest Paper

    1. No Access

      Book Chapter

      Pages 257-269

      Improving the ISO Prolog Standard by Analyzing Compliance Test Results

previous Page of 3