Proving Existential Termination of Normal Logic Programs

Lecture Notes in Computer Science- Germany

doi 10.1007/bfb0014328

Full Text

Abstract

Available in

Date

Authors

Publisher

Springer Berlin Heidelberg

Related search

Proving Properties of Constraint Logic Programs by Eliminating Existential Variables

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

Practical Methods for Proving Termination of General Logic Programs

Journal of Artificial Intelligence Research
Artificial Intelligence
1996English

On Termination of Constraint Logic Programs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1995English

Automatic Termination Analysis of Logic Programs

1997English

Termination of Logic Programs With Delay Declarations

The Journal of Logic Programming
1999English

Automatically Proving Program Termination

English

Proving Termination With Multiset Orderings

Communications of the ACM
Computer Science
1979English

Termination of Logic Programs With Block Declarations Running in Several Modes

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1998English

Proving Non-Termination Using Max-SMT

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy