Constructive negation of arithmetic constraints using dataflow graphs (Q1370977)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Constructive negation of arithmetic constraints using dataflow graphs |
scientific article; zbMATH DE number 1080191
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Constructive negation of arithmetic constraints using dataflow graphs |
scientific article; zbMATH DE number 1080191 |
Statements
Constructive negation of arithmetic constraints using dataflow graphs (English)
0 references
2 June 1998
0 references
constraint logic programming
0 references
dataflow graph
0 references
Prolog
0 references
0.712730348110199
0 references
0.6975502967834473
0 references
0.6698715090751648
0 references
0.6698428392410278
0 references
0.6694709062576294
0 references
