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
• Publication:3221399
• Publication:3339245
• Fixpoint semantics for logic programming a survey
• A closer look at declarative interpretations
• Publication:3030249
• Publication:4856950
• Recursion equation sets computing logic programs
• Publication:4029601
• Publication:4375821

Cited in

(8)

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

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)