Toward a declarative semantics for infinite objects in logic programming

DOI10.1016/0743-1066(88)90016-7zbMATH Open0644.68025OpenAlexW1999459111MaRDI QIDQ3787447FDOQ3787447

Authors: William G. Golson 

Publication date: 1988

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

Full work available at URL: https://doi.org/10.1016/0743-1066(88)90016-7

Recommendations

• scientific article; zbMATH DE number 3888910
• scientific article; zbMATH DE number 3978355
• scientific article; zbMATH DE number 139622
• Completions of perpetual logic programs
• scientific article; zbMATH DE number 1670488

zbMATH Keywords

fixed point characterizationminimal infinite objectsnonterminating logic program

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65)

Cited In (13)

• Title not available (Why is that?)
• Semantics of infinite tree logic programming
• Logic programming with infinite sets
• Verifying Properties of Infinite Sequences of Description Logic Actions
• Computing Minimal Axiomatizations in Godel Propositional Logic
• Declarative modeling of the operational behavior of logic languages
• Title not available (Why is that?)
• On Greatest Fixpoint Semantics of Logic Programming
• Title not available (Why is that?)
• Nondeterminism and infinite computations in constraint programming
• Completions of perpetual logic programs
• An abstract interpretation framework to reason on finite failure and other properties of finite and infinite computations.
• Title not available (Why is that?)

This page was built for publication: Toward a declarative semantics for infinite objects in logic programming

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