Show simple item record  

dc.contributor.authorCleary, John G.
dc.date.accessioned2016-02-24T23:24:40Z
dc.date.available2016-02-24T23:24:40Z
dc.date.issued1993-10
dc.identifier.citationCleary, J.G. (1993). Proving the existence of solutions in logical arithmetic. (Working paper 93/5). Hamilton, New Zealand: University of Waikato, Department of Computer Science.en_NZ
dc.identifier.issn1170-487X
dc.identifier.urihttps://hdl.handle.net/10289/9960
dc.description.abstractLogical arithmetic is a logically correct technique for real arithmetic in Prolog which uses constraints over interval representations for its implementation. Four problems with the technique are considered: answers are conditional and uninformative; iterative computations may lead to unboundedly large constraint networks; it is difficult and ineffective to deal with negation; and computing extrema is often not effective. A solution to these problems is proposed in the form of "existential intervals" which record the existence of a solution to a set of constraints within an interval. It is shown how to operate on existential intervals and how they solve the four problems.en_NZ
dc.format.mimetypeapplication/pdf
dc.language.isoenen_NZ
dc.publisherUniversity of Waikato, Department of Computer Scienceen_NZ
dc.relation.ispartofseriesComputer Science Working Papersen_NZ
dc.rights© 1993 John G. Cleary.en_NZ
dc.subjectcomputer scienceen_NZ
dc.titleProving the existence of solutions in logical arithmeticen_NZ
dc.typeWorking Paperen_NZ
uow.relation.series93/5en_NZ


Files in this item

This item appears in the following Collection(s)

Show simple item record