Non-termination analysis of logic programs with integer arithmetics (Q3087440): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1109.3256 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A dynamic approach to characterizing termination of general logic programs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Termination prediction for general logic programs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Inference of Termination Conditions for Numerical Loops in Prolog / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: <tt>Polytool</tt>: Polynomial interpretations as a basis for termination analysis of logic programs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Termination of logic programs: the never-ending story / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3992908 / rank | |||
Normal rank | |||
Revision as of 10:02, 4 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Non-termination analysis of logic programs with integer arithmetics |
scientific article |
Statements
Non-termination analysis of logic programs with integer arithmetics (English)
0 references
16 August 2011
0 references
non-termination analysis
0 references
numerical computation
0 references
constraint-based approach
0 references
0 references
