scientific article; zbMATH DE number 3888910
From MaRDI portal
Publication:3221399
Recommendations
- scientific article; zbMATH DE number 139622
- Computing with infinitary logic
- Infinite computation, co-induction and computational logic
- Infinitary logic for computer science
- Logic programming with infinite sets
- Toward a declarative semantics for infinite objects in logic programming
- Reasoning about infinite computations
- On computability by logic programs
- Semantics of infinite tree logic programming
- Computational complexity of infinite-valued Łukasiewicz propositional logic
Cited in
(23)- Semantics of infinite tree logic programming
- Applications of compactness in the Smyth powerdomain of streams
- Completions of perpetual logic programs
- Reasoning about infinite computations
- An abstract interpretation framework to reason on finite failure and other properties of finite and infinite computations.
- The fixed points of logic programs with Herbrand base \({\mathbb{N}}\)
- scientific article; zbMATH DE number 1670488 (Why is no real title available?)
- Top-down semantics of fair computations of logic programs
- scientific article; zbMATH DE number 3978355 (Why is no real title available?)
- scientific article; zbMATH DE number 4043305 (Why is no real title available?)
- Toward a declarative semantics for infinite objects in logic programming
- scientific article; zbMATH DE number 4101138 (Why is no real title available?)
- scientific article; zbMATH DE number 139622 (Why is no real title available?)
- scientific article; zbMATH DE number 683344 (Why is no real title available?)
- On Greatest Fixpoint Semantics of Logic Programming
- Representing any-time and program-iteration by infinitary conjunction
- scientific article; zbMATH DE number 4001441 (Why is no real title available?)
- Nondeterminism and infinite computations in constraint programming
- Computing with infinitary logic
- Infinity in logic and computation. International conference, ILC 2007, Cape Town, South Africa, November 3--5, 2007. Revised selected papers
- Corrigendum: On infinite computations in denotational semantics
- Logic programming with infinite sets
- Recursion equation sets computing logic programs
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 Q3221399)
