An introduction to solid modeling
An introduction to solid modeling
Handbook of theoretical computer science (vol. B)
Implementing type-based constructive negation
Proceedings of the 2007 ACM symposium on Applied computing
| Hi-index | 0.00 |
A system which extracts a dataflow graph from sets ofarithmetic constraints is described. This information is usedto simplify constraints and to extract positive information fromnegations of constraints. The context for this work is a Prologimplementation where intervals are used to represent the underlyingarithmetic variables. The system uses simple information aboutthe existence of solutions of primitive constraints to derivethe dataflow graph. This makes the system easily extensible tonew primitives and domains. A practical implementation over bothreal and integer arithmetic is described and an extended exampleof its application given.