Loop checking and the well-founded semantics

DOI10.1007/3-540-59487-6_10MaRDI QIDQ5101446zbMATH OpenOpenAlexFDO

Authors Vladimir Lifschitz, Norman McCain, Robert F. Stärk, Teodor C. Przymusinski

Publication date 30 August 2022

Published in Logic Programming and Nonmonotonic Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-59487-6_10

Mathematics Subject Classification ID

Logic programming (68N17) Semantics in the theory of computing (68Q55)

Recommendations

• scientific article; zbMATH DE number 549972
• scientific article; zbMATH DE number 813263
• The well-founded semantics for general logic programs
• Computing the well-founded semantics faster
• Loop checking in SLD-derivations by well-quasi-ordering of goals

Cites work

• A goal-oriented approach to computing the well-founded semantics
• scientific article; zbMATH DE number 4160107 (Why is no real title available?)
• scientific article; zbMATH DE number 25190 (Why is no real title available?)
• scientific article; zbMATH DE number 25191 (Why is no real title available?)
• scientific article; zbMATH DE number 25192 (Why is no real title available?)
• scientific article; zbMATH DE number 3999251 (Why is no real title available?)
• Well-founded and stationary models of logic programs

Cited in

(4)

• Computing Preconditions and Postconditions of While Loops
• scientific article; zbMATH DE number 549972 (Why is no real title available?)
• scientific article; zbMATH DE number 1487498 (Why is no real title available?)
• scientific article; zbMATH DE number 813263 (Why is no real title available?)

This page was built for publication: Loop checking and the well-founded semantics

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