Pages that link to "Item:Q671989"
From MaRDI portal
The following pages link to Nondeterminism and infinite computations in constraint programming (Q671989):
Displaying 18 items.
- Belief, knowledge, lies and other utterances in an algebra for space and extrusion (Q347368) (← links)
- Modeling biological systems in stochastic concurrent constraint programming (Q941672) (← links)
- A fully abstract semantics for concurrent constraint programming (Q1275748) (← links)
- Decidability of infinite-state timed CCP processes and first-order LTL (Q1763732) (← links)
- Real number computation with committed choice logic programming languages (Q1779564) (← links)
- Characterizing right inverses for spatial constraint systems with applications to modal logic (Q1786563) (← links)
- An abstract interpretation framework to reason on finite failure and other properties of finite and infinite computations. (Q1853617) (← links)
- Reasoning about distributed information with infinitely many agents (Q2043805) (← links)
- Models and emerging trends of concurrent constraint programming (Q2348541) (← links)
- Slicing concurrent constraint programs (Q2409727) (← links)
- A Proof Theoretic Study of Soft Concurrent Constraint Programming (Q2931271) (← links)
- Deriving Inverse Operators for Modal Logic (Q3179402) (← links)
- (Q3385648) (← links)
- Abstract interpretation of temporal concurrent constraint programs (Q4592982) (← links)
- Linear Structures for Concurrency in Probabilistic Programming Languages (Q4923370) (← links)
- Probabilistic Confinement in a Declarative Framework (Q4923521) (← links)
- (Q5240218) (← links)
- (Q5875391) (← links)
