Show simple item record

Constraints

dc.date.accessioned2004-10-04T14:50:29Z
dc.date.accessioned2018-11-24T10:12:52Z
dc.date.available2004-10-04T14:50:29Z
dc.date.available2018-11-24T10:12:52Z
dc.date.issued1978-11-01en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/6311
dc.identifier.urihttp://repository.aust.edu.ng/xmlui/handle/1721.1/6311
dc.description.abstractWe present an interactive system organized around networks of constraints rather than the programs which manipulate them. We describe a language of hierarchical constraint networks. We describe one method of deriving useful consequences of a set of constraints which we call propagation. Dependency analysis is used to spot and track down inconsistent subsets of a constraint set. Propagation of constraints is most flexible and useful when coupled with the ability to perform symbolic manipulations on algebraic expressions. Such manipulations are in turn best expressed as alterations of augmentations of the constraint network. Numerous diagrams ornament the text.en_US
dc.format.extent10057219 bytes
dc.format.extent7518525 bytes
dc.language.isoen_US
dc.titleConstraintsen_US


Files in this item

FilesSizeFormatView
AIM-502.pdf7.518Mbapplication/pdfView/Open
AIM-502.ps10.05Mbapplication/postscriptView/Open

This item appears in the following Collection(s)

Show simple item record