Please use this identifier to cite or link to this item:
Title: Using constraints to model disjunctions in rule-based reasoning
Authors: Liu, Bing 
Jaffar, Joxan 
Issue Date: 1996
Citation: Liu, Bing,Jaffar, Joxan (1996). Using constraints to model disjunctions in rule-based reasoning. Proceedings of the National Conference on Artificial Intelligence 2 : 1248-1255. ScholarBank@NUS Repository.
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 (called CFR) based on this idea has been implemented.
Source Title: Proceedings of the National Conference on Artificial Intelligence
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

checked on Oct 26, 2018

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.