↓ Skip to main content
What is this page? Embed badge

Program Development in Computational Logic

Overview of attention for book
Cover of 'Program Development in Computational Logic'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Specifying Compositional Units for Correct Program Development in Computational Logic
  3. Altmetric Badge
    Chapter 2 Synthesis of Programs in Computational Logic
  4. Altmetric Badge
    Chapter 3 Developing Logic Programs from Specifications Using Stepwise Refinement
  5. Altmetric Badge
    Chapter 4 Declarative Semantics of Input Consuming Logic Programs
  6. Altmetric Badge
    Chapter 5 On the Semantics of Logic Program Composition
  7. Altmetric Badge
    Chapter 6 Analysing Logic Programs by Reasoning Backwards
  8. Altmetric Badge
    Chapter 7 Binding-Time Analysis for Mercury
  9. Altmetric Badge
    Chapter 8 A Generic Framework for Context-Sensitive Analysis of Modular Programs
  10. Altmetric Badge
    Chapter 9 Unfold/Fold Transformations for Automated Verification of Parameterized Concurrent Systems
  11. Altmetric Badge
    Chapter 10 Transformation Rules for Locally Stratified Constraint Logic Programs
  12. Altmetric Badge
    Chapter 11 Specialising Interpreters Using Offline Partial Deduction
  13. Altmetric Badge
    Chapter 12 Characterisations of Termination in Logic Programming
  14. Altmetric Badge
    Chapter 13 On the Inference of Natural Level Mappings
  15. Altmetric Badge
    Chapter 14 Proving Termination for Logic Programs by the Query-Mapping Pairs Approach
  16. Altmetric Badge
    Chapter 15 Herbrand Constraints in HAL
Attention for Chapter 14: Proving Termination for Logic Programs by the Query-Mapping Pairs Approach
Altmetric Badge

Citations

dimensions_citation
1 Dimensions

Readers on

mendeley
2 Mendeley
Summary Dimensions citations
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Chapter title
Proving Termination for Logic Programs by the Query-Mapping Pairs Approach
Chapter number 14
Book title
Program Development in Computational Logic
Published by
Springer, Berlin, Heidelberg, January 2004
DOI 10.1007/978-3-540-25951-0_14
Book ISBNs
978-3-54-022152-4, 978-3-54-025951-0
Authors

Naomi Lindenstrauss, Yehoshua Sagiv, Alexander Serebrenik

View on publisher site
Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 2 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 2 100%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 1 50%
Professor > Associate Professor 1 50%
Readers by discipline Count As %
Computer Science 2 100%

This page is provided by Altmetric.