Using Constraints to Model Disjuctions in Rule-Based Reasoning
| dc.contributor.author | Bing Liu | en_US |
| dc.contributor.author | Joxan JAFFER | en_US |
| dc.date.accessioned | 2004-10-21T14:28:52Z | en_US |
| dc.date.accessioned | 2017-01-23T07:00:17Z | |
| dc.date.available | 2004-10-21T14:28:52Z | en_US |
| dc.date.available | 2017-01-23T07:00:17Z | |
| dc.date.issued | 1996-04-01T00:00:00Z | en_US |
| dc.description.abstract | Rule-based systems have long been widely used for building expert systems to perform practical knowledge intensive tasks. One important issue that has not been addressed satisfactorily is the disjunction, and this significantly limits their problem solving power. In this paper, we show that some important types of disjunction can be modeled with Constraint Satisfaction Problem (CSP) techniques, employing their simple representation schemes and efficient algorithms. A key idea is that disjunctions are represented as constraint variables, relations among disjunctions are represented as constraints, and rule chaining is integrated with constraint solving. In this integration, a constraint variable or a constraint is regarded as a special fact, and rules can be written with constraints and information about constraints. Chaining of rules may trigger constraint propagation, and constraint propagation may cause firing of rules. A prototype system based on this idea has been implemented. | en_US |
| dc.format.extent | 79417 bytes | en_US |
| dc.format.extent | 585591 bytes | en_US |
| dc.format.mimetype | application/pdf | en_US |
| dc.format.mimetype | application/postscript | en_US |
| dc.identifier.uri | https://dl.comp.nus.edu.sg/xmlui/handle/1900.100/1341 | en_US |
| dc.language.iso | en | en_US |
| dc.relation.ispartofseries | TRB4/96 | en_US |
| dc.title | Using Constraints to Model Disjuctions in Rule-Based Reasoning | en_US |
| dc.type | Technical Report | en_US |
Files
License bundle
1 - 1 of 1