Search Experiment of Business-Rule by Dynamic Constraint Algebra

Although e-commerce is becoming popular, product rules, which describe various conditions such as prices, applicability, and discount conditions are still expressed in natural languages. These rules are difficult to deal with in relational databases because logics are separated from data. There is no system to search on multiple rules, so buyers have to check business rules one by one. In this paper, we take the case of airline tickets, hotel bookings and others as an example, and describe them in dynamic constraint conditions. We also show several queries written in Dynamic Constraint Algebra (DCA), and the result of the Dynamic Constraint Algebra Query Processing Engine can be utilized to present buyers available options, and to check how variables affect prices.

[1]  Mizuho Iwaihara Matching and Deriving Dynamic Constraints for E-Commerce Negotiations , 2000, TES.

[2]  Stéphane Grumbach,et al.  Constraint Databases , 1999, JFPLC.

[3]  Mizuho Iwaihara Supporting dynamic constraints for commerce negotiations , 2000, Proceedings Second International Workshop on Advanced Issues of E-Commerce and Web-Based Information Systems. WECWIS 2000.

[4]  Gabriel M. Kuper,et al.  Constraint Query Languages , 1995, J. Comput. Syst. Sci..

[5]  Mizuho Iwaihara,et al.  Extracting Business Rules from Web Product Descriptions , 2004, WISE.