首页 | 本学科首页   官方微博 | 高级检索  
     


Constructive Negation of Arithmetic Constraints Using Dataflow Graphs
Authors:John G. Cleary
Affiliation:(1) Department of Computer Science, University of Waikato, Hamilton, New Zealand
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.
Keywords:contructive negation  logic programming  interval arithmetic  constraint logic programming
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号