scientific article

zbMATH Open0761.68027MaRDI QIDQ4029601FDOQ4029601

Author name not available (Why is that?)

Publication date: 28 March 1993

Title of this publication is not available (Why is that?)

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)

Cited In (12)

• Semantics of infinite tree logic programming
• Logic programming with infinite sets
• Bounded nondeterminism of logic programs
• Solving problems on finite concrete logics with the help of a PC
• Synthesis of positive logic programs for checking a class of definitions with infinite quantification
• Finite generation and presentation problems for lambda calculus and combinatory logic
• Title not available (Why is that?)
• Top-down semantics of fair computations of logic programs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Tight, consistent, and computable completions for unrestricted logic programs
• Computing with infinitary logic

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Infinite Computation, Co-induction and Computational Logic 👍 👎
• On computability by logic programs 👍 👎
• On Completeness of Logic Programs 👍 👎
• Computing with infinitary logic 👍 👎
• Complexity and undecidability results for logic programming 👍 👎
• Infinitary logic for computer science 👍 👎

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)