Tight, consistent, and computable completions for unrestricted logic programs

DOI10.1016/0743-1066(93)90041-EzbMATH Open0787.68021MaRDI QIDQ4036289FDOQ4036289

Authors:

Publication date: 16 May 1993

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

Recommendations

• Strict completion of logic programs
• On the strong completion of logic programs
• On completeness of logic programs
• scientific article; zbMATH DE number 4057010
• Completed logic programs and their consistency
• Tight semantics for logic programs
• Completion for logically constrained rewriting
• scientific article; zbMATH DE number 139622
• scientific article; zbMATH DE number 1396180
• Completions of perpetual logic programs

zbMATH Keywords

negation in logic programmingClark's program completionfirst-order semantics for logic programs

Mathematics Subject Classification ID

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

Cited In (25)

• Uniform closures: Order-theoretically reconstructing logic program semantics and abstract domain refinements
• Tight semantics for logic programs
• A logical semantics for depth-first Prolog with ground negation
• Lloyd-Topor completion and general stable models
• Graph properties for normal logic programs
• Twelve Definitions of a Stable Model
• Efficient TBox Reasoning with Value Restrictions using the wer Reasoner
• A formalization of programs in first-order logic with a discrete linear order
• Applications of the situation calculus to formalizing control and strategic information: the Prolog cut operator
• Stable models and circumscription
• On the strong completion of logic programs
• Title not available (Why is that?)
• Completed logic programs and their consistency
• Title not available (Why is that?)
• What is failure? An approach to constructive negation
• Decidability of the Clark's completion semantics for monadic programs and queries
• Program completion in the input language of GRINGO
• Completions of perpetual logic programs
• Title not available (Why is that?)
• Thirteen Definitions of a Stable Model
• Title not available (Why is that?)
• Bottom-up evaluation and query optimization of well-founded models
• The 3 Frenchmen method proves undecidability of the uniform boundedness for single recursive rule ternary DATALOG Programs
• Tight logic programs
• Strict completion of logic programs

This page was built for publication: Tight, consistent, and computable completions for unrestricted logic programs

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