Amanote Research

Amanote Research

    RegisterSign In

Task Granularity Analysis in Logic Programs

doi 10.1145/93542.93564
Full Text
Open PDF
Abstract

Available in full text

Date

January 1, 1990

Authors
Saumya K. DebrayNai-Wei LinManuel Hermnegildo
Publisher

ACM Press


Related search

Lazy Task Creation: A Technique for Increasing the Granularity of Parallel Programs

1990English

Incremental Analysis of Logic Programs

1995English

Mode Analysis of Functional Logic Programs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1994English

Automatic Termination 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

Granularity, Multi-Valued Logic, Bayes’ Theorem and Rough Sets

Studies in Fuzziness and Soft Computing
Computational MathematicsComputer Science
2002English

Lower-Bound Time-Complexity Analysis of Logic Programs

1997English

Managing Uncertainty and Vagueness in Description Logics, Logic Programs and Description Logic Programs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2008English

An Analysis of Loop Checking Mechanisms for Logic Programs

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
1991English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy