Amanote Research

Amanote Research

  • Register
  • Sign In

Reexecution-Based Analysis of Logic Programs With Delay Declarations

Lecture Notes in Computer Science- Germany

doi 10.1007/3-540-45575-2_39

Full Text

Abstract

Available in

Categories

Computer ScienceTheoretical Computer Science

Date

January 1, 2001

Authors

Agostino CortesiBaudouin Le CharlierSabina Rossi

Publisher

Springer Berlin Heidelberg


Related search

Termination of Logic Programs With Delay Declarations

The Journal of Logic Programming
1999English

Termination of Logic Programs With Block Declarations Running in Several Modes

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1998English

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

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1999English

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

Logic Programs for Consistency-Based Diagnosis.

English

Task Granularity Analysis in Logic Programs

1990English

Retroactive Subsumption-Based Tabled Evaluation of Logic Programs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Amanote Research

Note-taking for researchers

Follow Amanote


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

Privacy PolicyRefund Policy