Automatic Termination Analysis of Logic Programs

doi 10.7551/mitpress/4299.003.0011

Full Text

Abstract

Available in

Date

Authors

Unknown

Publisher

The MIT Press

Related search

On Termination of Constraint Logic Programs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1995English

Proving Existential Termination of Normal Logic Programs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1996English

Termination of Logic Programs With Delay Declarations

The Journal of Logic Programming
1999English

Practical Methods for Proving Termination of General Logic Programs

Journal of Artificial Intelligence Research
Artificial Intelligence
1996English

Termination of Logic Programs With Block Declarations Running in Several Modes

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1998English

Incremental Analysis of Logic Programs

1995English

Mode Analysis of Functional Logic Programs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1994English

Task Granularity Analysis in Logic Programs

1990English

Lower-Bound Time-Complexity Analysis of Logic Programs

1997English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy