Paper Info
Title
Constructive Negation of Arithmetic Constraints Using Dataflow Graphs
Abstract
A system which extracts a dataflow graph from sets of arithmetic constraints is described. This information is used to simplify constraints and to extract positive information from negations of constraints. The context for this work is a Prolog implementation where intervals are used to represent the underlying arithmetic variables. The system uses simple information about the existence of solutions of primitive constraints to derive the dataflow graph. This makes the system easily extensible to new primitives and domains. A practical implementation over both real and integer arithmetic is described and an extended example of its application given.
Year
DOI
Venue
1997
10.1023/A:1009753625663
Constraints
Keywords
DocType
Volume
contructive negation,logic programming,interval arithmetic,constraint logic programming
Journal
2
Issue
ISSN
Citations 
2
1383-7133
0
PageRank 
References 
Authors
0.34
1
1
Name
Order
Citations
PageRank
John G. Cleary11791365.78