The following pages link to (Q3221399):
Displaying 16 items.
- Nondeterminism and infinite computations in constraint programming (Q671989) (← links)
- Computing with infinitary logic (Q672337) (← links)
- Infinity in logic and computation. International conference, ILC 2007, Cape Town, South Africa, November 3--5, 2007. Revised selected papers (Q732868) (← links)
- Corrigendum: On infinite computations in denotational semantics (Q789892) (← links)
- Logic programming with infinite sets (Q812390) (← links)
- Recursion equation sets computing logic programs (Q920624) (← links)
- Semantics of infinite tree logic programming (Q1090469) (← links)
- Applications of compactness in the Smyth powerdomain of streams (Q1107301) (← links)
- Completions of perpetual logic programs (Q1193890) (← links)
- Reasoning about infinite computations (Q1341752) (← links)
- An abstract interpretation framework to reason on finite failure and other properties of finite and infinite computations. (Q1853617) (← links)
- The fixed points of logic programs with Herbrand base \({\mathbb{N}}\) (Q2639644) (← links)
- Top-down semantics of fair computations of logic programs (Q3721791) (← links)
- (Q4029601) (← links)
- On Greatest Fixpoint Semantics of Logic Programming (Q4542241) (← links)
- Representing any-time and program-iteration by infinitary conjunction (Q4583319) (← links)
