skip to main content
10.1145/508791.508794acmconferencesArticle/Chapter ViewAbstractPublication PagessacConference Proceedingsconference-collections
Article

Executable declarative business rules and their use in electronic commerce

Published:11 March 2002Publication History

ABSTRACT

Business rules are statements which are used to run the activities of an organization. In the era of electronic commerce it is important for these rules to be represented explicitly, and to be automatically applicable. In this paper we argue that methods from the field of knowledge representation can be used for this purpose. In particular, we propose the use of defeasible reasoning, a simple but efficient reasoning method based on rules and priorities. We motivate the use of defeasible reasoning, give examples, describe two case studies, and outline current and future work in our research.

References

  1. G. Antoniou. Nonmonotonic Reasoning. MIT Press, 1997.Google ScholarGoogle Scholar
  2. G. Antoniou and M. Arief. Modelling business rules using defeasible logic. In Proceedings of Information Resources Management Association International Conference, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Australian Taxation Office. Guide to GST. 2000.Google ScholarGoogle Scholar
  4. Y. Lambrou, B. Grosof and H. Chan. A declarative approach to business rules in contracts: Courteous logic programs in xml. In Proc. 1st ACM Conference on Electronic Commerce, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. C. Baral and M. Gelfond. Logic programming and knowledge representation. Journal of Logic Programming, 19,20:73-148, 1994.Google ScholarGoogle ScholarCross RefCross Ref
  6. D. Billington, G. Antoniou and M. Maher. Normal forms for defeasible logic. In Proc. 1998 Joint International Conference and Symposium on Logic Programming, pages 160-174. MIT Press, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. D. Billington, G. Antoniou and M. Maher. On the analysis of regulations using defeasible rules. In Proc. 32nd Hawaii International Conference on Systems Sciences, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. B. Grosof. Prioritized conflict handling for logic programs. In Proc. International Logic Programming Symposium, pages 197-211. MIT Press, 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. D. Hay and K. Healy. GUIDE - Business Rules Project, Final Report rev. 1.2. 1997.Google ScholarGoogle Scholar
  10. V. Marek and M. Truszczynski. Nonmonotonic Reasoning. Springer, 1993.Google ScholarGoogle Scholar
  11. L. Morgenstern and M. Singh. An expert system using nonmonotonic techniques for benefits inquiry in the insurance industry. In Proc. IJCAI-97. Morgan Kaufmann, 1997.Google ScholarGoogle Scholar
  12. D. Nute. Defeasible reasoning. In Proc. 20th Hawaii International Conference on Systems Sciences, pages 470-477. IEEE Press, 1987.Google ScholarGoogle Scholar
  13. R. Ross. The Business Rule Book: Classifying, Defining and Modeling Rules, 2nd edition. Business Rule Solutions, Inc., 1997.Google ScholarGoogle Scholar
  14. M. J. Sergot, F. Sadri, R. A. Kowalski, F. Kriwaczek, P. Hammond and H. T. Cory. The british nationality act as a logic program. Communications of the ACM, 29(5):370-386. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. G. Simari and R. Loui. A Mathematical Treatment of Defeasible Reasoning and its Implementation. Artificial Intelligence, 53):125-157. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. F. Stolzenburg and B. Thomas. Analyzing Rule Sets for the Calculation of Banking Fees by a Theorem Prover with Constraints. In Automated Deduction --- A Basis for Applications. Volume III: Applications, pages 243-264. Kluwer Academic, 1998.Google ScholarGoogle Scholar

Index Terms

  1. Executable declarative business rules and their use in electronic commerce

            Recommendations

            Comments

            Login options

            Check if you have access through your login credentials or your institution to get full access on this article.

            Sign in
            • Published in

              cover image ACM Conferences
              SAC '02: Proceedings of the 2002 ACM symposium on Applied computing
              March 2002
              1200 pages
              ISBN:1581134452
              DOI:10.1145/508791

              Copyright © 2002 ACM

              Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

              Publisher

              Association for Computing Machinery

              New York, NY, United States

              Publication History

              • Published: 11 March 2002

              Permissions

              Request permissions about this article.

              Request Permissions

              Check for updates

              Qualifiers

              • Article

              Acceptance Rates

              Overall Acceptance Rate1,650of6,669submissions,25%

            PDF Format

            View or Download as a PDF file.

            PDF

            eReader

            View online with eReader.

            eReader