Top-down semantics of fair computations of logic programs

DOI10.1016/0743-1066(85)90005-6MaRDI QIDQ3721791zbMATH OpenOpenAlexFDO

Authors M. A. Nait Abdallah, M. H. van Emden

Publication date 1985

Published in The Journal of Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0743-1066(85)90005-6

zbMATH Keywords

fairnessfixpoint semanticslogic programmingHerbrand base

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Publication:4727395
• scientific article; zbMATH DE number 3888910
• scientific article; zbMATH DE number 3872640
• Fixpoint semantics for logic programming a survey
• A closer look at declarative interpretations
• scientific article; zbMATH DE number 4018380
• scientific article; zbMATH DE number 823595
• Recursion equation sets computing logic programs
• scientific article; zbMATH DE number 139622
• scientific article; zbMATH DE number 1114052

Cited in

(8)

• Completions of perpetual logic programs
• Towards categorical models for fairness: Fully abstract presheaf semantics of SCCS with finite delay
• Closures and fairness in the semantics of programming logic
• Contributions to the semantics of logic perpetual processes
• scientific article; zbMATH DE number 4001441 (Why is no real title available?)
• \(\exists\)-Universal termination of logic programs
• Productive corecursion in logic programming
• Sémantique logique et dénotationnelle des interpréteurs PROLOG

This page was built for publication: Top-down semantics of fair computations of logic programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3721791)