An Analysis of Loop Checking Mechanisms for Logic Programs

Theoretical Computer Science - Netherlands
doi 10.1016/0304-3975(91)90004-l
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Cc⊤: A Correspondence-Checking Tool for Logic Programs Under the Answer-Set Semantics

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

Incremental Analysis of Logic Programs

1995English

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

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1999English

Mode Analysis of Functional Logic Programs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1994English

Automatic Termination Analysis of Logic Programs

1997English

A Program Transformation for Backwards Analysis of Logic Programs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

Domain Construction for Mode Analysis of Typed Logic Programs

1997English

Task Granularity Analysis in Logic Programs

1990English

Loop Checking and Negation

The Journal of Logic Programming
1993English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy