Amanote Research

Amanote Research

  • Register
  • Sign In

Termination of Logic Programs With Block Declarations Running in Several Modes

Lecture Notes in Computer Science- Germany

doi 10.1007/bfb0056608

Full Text

Abstract

Available in

Categories

Computer ScienceTheoretical Computer Science

Date

January 1, 1998

Authors

Jan-Georg SmausPat HillAndy King

Publisher

Springer Berlin Heidelberg


Related search

Termination of Logic Programs With Delay Declarations

The Journal of Logic Programming
1999English

Reexecution-Based Analysis of Logic Programs With Delay Declarations

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2001English

On Termination of Constraint Logic Programs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1995English

Automatic Termination Analysis of Logic Programs

1997English

Proving Existential Termination of Normal Logic Programs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1996English

Practical Methods for Proving Termination of General Logic Programs

Journal of Artificial Intelligence Research
Artificial Intelligence
1996English

Logic Programs With Refutation Rules

1994English

Optimization of Logic Programs With Dynamic Scheduling

1997English

Extending Logic Programs With Description Logic Expressions for the Semantic Web

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Amanote Research

Note-taking for researchers

Follow Amanote


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

Privacy PolicyRefund Policy