Norms on terms and their use in proving universal termination of a logic program (Q1318707): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Annalisa Bossi / rank
Normal rank
 
Property / author
 
Property / author: Nicoletta Cocco / rank
Normal rank
 
Property / author
 
Property / author: Annalisa Bossi / rank
 
Normal rank
Property / author
 
Property / author: Nicoletta Cocco / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385536 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reasoning about termination of pure Prolog programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3941433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2736363 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5688890 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inductive assertion method for logic pograms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3698285 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5688900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3339245 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Termination proofs for logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5688891 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035671 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:22, 22 May 2024

scientific article
Language Label Description Also known as
English
Norms on terms and their use in proving universal termination of a logic program
scientific article

    Statements

    Norms on terms and their use in proving universal termination of a logic program (English)
    0 references
    0 references
    0 references
    0 references
    5 April 1994
    0 references
    semi-linear norms
    0 references
    substitution
    0 references
    universal termination
    0 references
    pure Prolog programs
    0 references
    proof method
    0 references
    pre/post specifications
    0 references
    ordering functions
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers