By Vasant Dhar, Nicky Ranganathan
Communications of the ACM,
March 1990,
Vol. 33 No. 3, Pages 323-336
10.1145/77481.77485
Comments
Expert system and integer programming formulations of an NP-complete constraint satisfaction problem are contrasted in terms of performance, ability to encode complex preferences, control of reasoning, and supporting incremental modification of solutions in response to changing input data.
The full text of this article is premium content
No entries found
Log in to Read the Full Article
Need Access?
Please select one of the options below for access to premium content and features.
Create a Web Account
If you are already an ACM member, Communications subscriber, or Digital Library subscriber, please set up a web account to access premium content on this site.
Join the ACM
Become a member to take full advantage of ACM's outstanding computing information resources, networking opportunities, and other benefits.
Subscribe to Communications of the ACM Magazine
Get full access to 50+ years of CACM content and receive the print version of the magazine monthly.
Purchase the Article
Non-members can purchase this article or a copy of the magazine in which it appears.