Bottom-up dataflow analysis of normal logic programs
From MaRDI portal
Publication:4012707
DOI10.1016/0743-1066(92)90031-WzbMath0776.68025DBLPjournals/jlp/MarriottS92WikidataQ57665093 ScholiaQ57665093MaRDI QIDQ4012707
Kim Marriott, Harald Søndergaard
Publication date: 27 September 1992
Published in: The Journal of Logic Programming (Search for Journal in Brave)
Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Logic programming (68N17) General topics in the theory of software (68N01)
Related Items (5)
SLDNF resolution with non-safe rule and fixpoint semantics for general logic programs ⋮ Truth versus information in logic programming ⋮ Repeated redundant inequalities in constraint logic programming ⋮ S-semantics for logic programming: a retrospective look ⋮ Frameworks for abstract interpretation
This page was built for publication: Bottom-up dataflow analysis of normal logic programs