The following pages link to (Q4391452):
Displaying 15 items.
- The two variable per inequality abstract domain (Q656848) (← links)
- Transformations of CLP modules (Q671648) (← links)
- Nondeterminism and infinite computations in constraint programming (Q671989) (← links)
- Generating efficient diagnostic procedures from model-based knowledge using logic programming techniques (Q805270) (← links)
- CAL: A theoretical background of constraint logic programming and its applications (Q908680) (← links)
- Abstraction-carrying code: a model for mobile code safety (Q949170) (← links)
- Unfolding and fixpoint semantics of concurrent constraint logic programs (Q1200981) (← links)
- Constraint reasoning based on interval arithmetic: The tolerance propagation approach (Q1204867) (← links)
- Constraint satisfaction using constraint logic programming (Q1204868) (← links)
- Hybrid reasoning using universal attachment (Q1329365) (← links)
- Incremental constraint satisfaction for equational logic programming (Q1367535) (← links)
- Tesseral spatio-temporal reasoning for multi-dimensional data (Q1818123) (← links)
- MACLP: multi agent constraint logic programming (Q1857098) (← links)
- A foundation for higher-order concurrent constraint programming (Q5096300) (← links)
- Path consistency in clp(FD) (Q5096309) (← links)
