scientific article; zbMATH DE number 139622

MaRDI QIDQ4029601zbMATH OpenFDO

Authors

Publication date 28 March 1993

zbMATH Keywords

Herbrand universeHerbrand baseleast fixpoint semantics of a logic program

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 3888910
• On computability by logic programs
• scientific article; zbMATH DE number 4043305
• Infinitary logic for computer science
• scientific article; zbMATH DE number 1163938
• Complexity and undecidability results for logic programming
• Computing with infinitary logic
• Infinite computation, co-induction and computational logic
• scientific article; zbMATH DE number 4103047
• On completeness of logic programs

Cited in

(24)

• Logic programming with infinite sets
• Semantics of infinite tree logic programming
• scientific article; zbMATH DE number 3978355 (Why is no real title available?)
• Contributions to the semantics of logic perpetual processes
• The infinite-valued semantics: overview, recent results and future directions
• Bounded nondeterminism of logic programs
• Solving problems on finite concrete logics with the help of a PC
• Infinite trees, markings, and well-foundedness
• Synthesis of positive logic programs for checking a class of definitions with infinite quantification
• Metalogical control for logic programs
• Finite generation and presentation problems for lambda calculus and combinatory logic
• Toward a declarative semantics for infinite objects in logic programming
• scientific article; zbMATH DE number 1088041 (Why is no real title available?)
• scientific article; zbMATH DE number 683344 (Why is no real title available?)
• Completions of perpetual logic programs
• Top-down semantics of fair computations of logic programs
• Transformations of logic programs on infinite lists
• scientific article; zbMATH DE number 732053 (Why is no real title available?)
• scientific article; zbMATH DE number 4043305 (Why is no real title available?)
• scientific article; zbMATH DE number 4001441 (Why is no real title available?)
• scientific article; zbMATH DE number 3888910 (Why is no real title available?)
• scientific article; zbMATH DE number 3963828 (Why is no real title available?)
• Tight, consistent, and computable completions for unrestricted logic programs
• Computing with infinitary logic

This page was built for publication:

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