scientific article; zbMATH DE number 139622
From MaRDI portal
Publication:4029601
zbMATH Open0761.68027MaRDI QIDQ4029601FDOQ4029601
Authors:
Publication date: 28 March 1993
Title of this publication is not available (Why is that?)
Recommendations
- scientific article
- 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 (23)
- Title not available (Why is that?)
- Semantics of infinite tree logic programming
- Logic programming with infinite sets
- Contributions to the semantics of logic perpetual processes
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Top-down semantics of fair computations of logic programs
- Transformations of logic programs on infinite lists
- Completions of perpetual logic programs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
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)
