Top-down semantics of fair computations of logic programs

DOI10.1016/0743-1066(85)90005-6zbMath0592.68019OpenAlexW2018969105MaRDI QIDQ3721791

M. A. Nait Abdallah, Maarten 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

fairnesslogic programmingfixpoint semanticsHerbrand base

Mathematics Subject Classification ID

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

Related Items (5)

Contributions to the semantics of logic perpetual processes ⋮ Productive corecursion in logic programming ⋮ Sémantique logique et dénotationnelle des interpréteurs PROLOG ⋮ Completions of perpetual logic programs ⋮ \(\exists\)-Universal termination of logic programs

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