Incremental Analysis of Logic Programs

doi 10.7551/mitpress/4298.003.0075

Full Text

Abstract

Available in

Date

Authors

Unknown

Publisher

The MIT Press

Related search

Mode Analysis of Functional Logic Programs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1994English

Automatic Termination Analysis of Logic Programs

1997English

Task Granularity Analysis in Logic Programs

1990English

Lower-Bound Time-Complexity Analysis of Logic Programs

1997English

Set-Based Failure Analysis for Logic Programs and Concurrent Constraint Programs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1999English

An Analysis of Loop Checking Mechanisms for Logic Programs

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
1991English

Goal Dependent vs. Goal Independent Analysis of Logic Programs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1994English

Reexecution-Based Analysis of Logic Programs With Delay Declarations

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2001English

A Program Transformation for Backwards Analysis of Logic Programs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy