Skip to main content
SpringerLink
Log in

Related Work

  • Chapter
  • First Online:
Verification of Business Rules Programs

  • 501 Accesses

Abstract

This chapter relates rule programs as handled by Business Rules Management Systems (BRMS) to other programming paradigms, whether rule-based or not. We concentrate on the similarities and differences that have an impact on our objective, which is to help understand the effects, and prove correctness properties on the executions of rule programs as handled by BRMS. We see that, from this viewpoint, these programs share features with databases, programs with pointers, and concurrent programs.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 54.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    All URLs were successfully accessed on January 22, 2013.

References

  1. Abiteboul, S., Vianu, V.: Procedural and declarative database updateFootnote

    All URLs were successfully accessed on January 22, 2013.

    languages. In: PODS, pp. 240–250. ACM, New York (1988)

    Google Scholar 

  2. Abiteboul, S., Vianu, V.: Datalog extensions for database queries and updates. J. Comp. Syst. Sci. 43(1), 62–124 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  3. Aït-Kaci, H.: Description logic vs. order-sorted feature logic. In: Calvanese, D., Franconi, E., Haarslev, V., Lembo, D., Motik, B., Turhan, A.Y., Tessaris, S. (eds.) Description Logics. CEUR Workshop Proceedings, vol. 250. CEUR-WS.org (2007). http://ceur-ws.org/Vol-250/paper_2.pdf

  4. Aït-Kaci, H., Podelski, A., Copen Goldstein, S.: Order sorted feature theory unification. J. Logic Program. 30(2), 99–124 (1997)

    Article  MATH  Google Scholar 

  5. Angele, J., Kifer, M., Lausen, G.: Ontologies in F-logic. In: Bernus, P., Blazewics, J., Schmidt, G., Shaw, M., Staab, S., Studer, R. (eds.) Handbook on Ontologies. International Handbooks on Information Systems, pp. 45–70. Springer, Berlin (2009)

    Google Scholar 

  6. Antoniou, G., Damsio, C.V., Grosof, B., Horrocks, I., Kifer, M., Maluszynski, J., Patel-Schneider, P.F.: Combining Rules and Ontologies: A Survey. Tech. Rep. IST506779/Linköping/I3-D3/D/PU/a1, Linköping University (2005). IST-2004-506779 REWERSE Deliverable 2005-I3-D3. http://rewerse.net/publications/rewerse-description/REWERSE-DEL-2005-I3-D3.html

  7. Apt, K.R.: Ten years of Hoare’s logic: A survey—part I. ACM Trans. Program. Lang. Syst. 3(4), 431–483 (1981)

    Article  MATH  Google Scholar 

  8. Apt, K.R.: Ten years of Hoare’s logic: A survey—part II: Nondeterminism. Theor. Comp. Sci. 28, 83–109 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  9. Apt, K.R., de Boer, F.S., Olderog, E.R.: Verification of Sequential and Concurrent Programs, 3rd edn. Texts in Computer Science. Springer, Berlin (2009)

    Book  MATH  Google Scholar 

  10. Ashcroft, E.A.: Proving assertions about parallel programs. J. Comp. Syst. Sci. 10(1), 110–135 (1975)

    Article  MATH  MathSciNet  Google Scholar 

  11. Baader, F., Calvanese, D., McGuinness, D.L., Nardi, D., Patel-Schneider, P.F. (eds.): The Description Logic Handbook: Theory, Implementation, and Applications. Cambridge University Press, London (2003)

    Google Scholar 

  12. de Bakker, J.W., de Bruin, A., Zucker, J.: Mathematical Theory of Program Correctness. Prentice-Hall International Series in Computer Science. Prentice Hall, Englewood Cliffs (1980)

    MATH  Google Scholar 

  13. Baral, C., Lobo, J.: Characterizing production systems using logic programming and situation calculus (2007). http://cs.utep.edu/chitta/papers/char-prod-systems.ps

  14. Baralis, E., Widom, J.: An algebraic approach to rule analysis in expert database systems. In: Bocca, J.B., Jarke, M., Zaniolo, C. (eds.) VLDB, pp. 475–486. Morgan Kaufmann, Los Altos (1994)

    Google Scholar 

  15. Behrends, E., Fritzen, O., May, W., Schenk, F., Schubert, D.: A framework and components for ECA rules in the web. In: Proceedings of Second International Conference on Rules and Rule Markup Languages for the Semantic Web, Athens, GA, USA (RuleML) (2006). http://rewerse.net/publications/rewerse-description/REWERSE-RP-2006-165.html

  16. Berners-Lee, T., Hendler, J.: The semantic web. Sci. Am. 284, 34–43 (2001)

    Article  Google Scholar 

  17. Berstel, B., Leconte, M.: Using constraints to verify properties of rule programs. In: Proceedings of the 2010 Third International Conference on Software Testing, Verification, and Validation Workshops, ICSTW’10, pp. 349–354. IEEE Computer Society, Silver Spring (2010)

    Google Scholar 

  18. Berstel, B., Bonnard, P., Bry, F., Eckert, M., Pătrnjan, P.L.: Reactive rules on the web. In: Antoniou, G., Aßmann, U., Baroglio, C., Decker, S., Henze, N., Pătrnjan, P.L., Tolksdorf, R. (eds.) Reasoning Web. Lecture Notes in Computer Science, vol. 4636, pp. 183–239. Springer, Berlin (2007)

    Google Scholar 

  19. Broy, M., Olderog, E.R.: Trace-oriented models of concurrency. In: Bergstra, J.A., Ponse, A., Smolka, S.A. (eds.) Handbook of Process Algebra, pp. 101–195. Elsevier Science, New York (2001)

    Chapter  Google Scholar 

  20. de Bruijn, J., Rezk, M.: A logic based approach to the static analysis of production systems. In: Polleres, A., Swift, T. (eds.) RR. Lecture Notes in Computer Science, vol. 5837, pp. 254–268. Springer, Berlin (2009)

    Google Scholar 

  21. Calvanese, D., Lausen, G. (eds.): Web Reasoning and Rule Systems. Proceedings of Second International Conference, RR 2008, Karlsruhe, Germany, 31 October–1 November 2008. Lecture Notes in Computer Science, vol. 5341. Springer, Berlin (2008)

    Google Scholar 

  22. Chniti, A., Dehors, S., Albert, P., Charlet, J.: Authoring business rules grounded in OWL ontologies. In: Dean, M., Hall, J., Rotolo, A., Tabet, S. (eds.) RuleML. Lecture Notes in Computer Science, vol. 6403, pp. 297–304. Springer, Berlin (2010)

    Google Scholar 

  23. Chniti, A., Albert, P., Charlet, J.: Gestion de la cohérence des règles métier éditées à partir d’ontologies OWL. In: Conférence Francophone d’Apprentissage 2011 (2011)

    Google Scholar 

  24. Cirstea, H., Kirchner, C., Moossen, M., Moreau, P.É.: Production systems and Rete algorithm formalisation. Research report, LORIA, Nancy (2004). http://hal.inria.fr/inria-00280938/PDF/rete.formalisation.pdf

  25. Demuth, B., Liebau, H.B.: An approach for bridging the gap between business rules and the semantic web. In: Proceedings of the 2007 International Conference on Advances in Rule Interchange and Applications, RuleML’07, pp. 119–133. Springer, Berlin (2007)

    Google Scholar 

  26. Fages, F., Lissajoux, R.: Sémantique opérationnelle et compilation des systèmes de production. Revue d’Intelligence Artificielle 6(4), 431–456 (1992)

    Google Scholar 

  27. Fair, Isaac, and Company: High-volume batch processing with Blaze Advisor. Computer World UK (2007). http://www.computerworlduk.com/white-paper/business-process/5092/high-volume-batch-processing-with-blaze-advisor/

  28. Floyd, R.W.: Assigning meaning to programs. In: Proceedings of the Symposium on Applied Math, vol. 19, pp. 19–32. American Mathematical Society, Providence (1967)

    Google Scholar 

  29. Forgy, C.: Rete: A fast algorithm for the many patterns/many objects match problem. Artif. Intell. 19(1), 17–37 (1982)

    Article  Google Scholar 

  30. Frohn, J., Himmeröder, R., Kandzia, P.T., Lausen, G., Schlepphorst, C.: FLORID: A prototype for F-logic. In: Gray, W.A., Larson, P.Å. (eds.) ICDE, p. 583. IEEE Computer Society, Silver Spring (1997)

    Google Scholar 

  31. Gallaire, H., Minker, J. (eds.): Symposium on Logic and Data Bases, Centre d’études et de recherches de Toulouse. Advances in Data Base Theory. Plenum Press, New York (1977)

    Google Scholar 

  32. Gerrits, R., Spreeuwenberg, S.: VALENS: A knowledge based tool to validate and verify an Aion knowledge base. In: Horn, W. (ed.) ECAI, pp. 731–738. IOS Press, Amsterdam (2000)

    Google Scholar 

  33. Ghallab, M., Nau, D.S., Traverso, P.: Automated Planning: Theory and Practice. Morgan Kaufmann, Los Altos (2004)

    Google Scholar 

  34. Hellerstein, J.M., Hsu, M.: Determinism in partially ordered production systems. Research report, IBM Almaden Research Center (1991)

    Google Scholar 

  35. Heymans, S., de Bruijn, J., Rezk, M., At-Kaci, H., Citeau, H., Korf, R., Phrer, J., Feier, C., Eiter, T.: Initial combinations of rules and ontologies. Public Deliverable 3.2, Ontorule Project (2009). http://ontorule-project.eu/outcomes?func=fileinfo&id=18

  36. Hoare, C.A.R.: An axiomatic basis for computer programming. Comm. ACM 12, 576–580 (1969)

    Article  MATH  Google Scholar 

  37. IBM: IBM Operational Decision Manager v8.0 User’s Manual (2012). http://publib.boulder.ibm.com/infocenter/dmanager/v8r0/

  38. Karadimce, A.P., Urban, S.D.: Conditional term rewriting as a formal basis for active database rules. In: RIDE-ADS, pp. 156–162. IEEE Computer Society (1994)

    Google Scholar 

  39. Kifer, M., Lausen, G.: F-logic: A higher-order language for reasoning about objects, inheritance, and scheme. In: Proceedings of the 1989 ACM SIGMOD International Conference on Management of Data, SIGMOD’89, pp. 134–146. ACM, New York (1989)

    Google Scholar 

  40. Knuth, D., Bendix, P.: Simple word problems in universal algebra. In: Computational Problems in Abstract Algebra, pp. 263–297. Pergamon Press, New York (1970)

    Google Scholar 

  41. Kowalski, R.A., Sadri, F., Soper, P.: Integrity checking in deductive databases. In: Proceedings of the 13th International Conference on Very Large Data Bases, VLDB’87, pp. 61–69. Morgan Kaufmann, Los Altos (1987)

    Google Scholar 

  42. Lakemeyer, G., Nebel, B. (eds.): Foundation of Knowledge Representation and Reasoning. Lecture Notes in Computer Science, vol. 810. Springer, Berlin (1994)

    Google Scholar 

  43. Lamport, L.: Proving the correctness of multiprocess programs. IEEE Trans. Software Eng. 3(2), 125–143 (1977)

    Article  MATH  MathSciNet  Google Scholar 

  44. Lamport, L.: Verification and specification of concurrent programs. In: de Bakker, J.W., de Roever, W.P., Rozenberg, G. (eds.) REX School/Symposium. Lecture Notes in Computer Science, vol. 803, pp. 347–374. Springer, Berlin (1993)

    Google Scholar 

  45. Lamport, L.: Specifying Systems, The TLA+ Language and Tools for Hardware and Software Engineers. Addison-Wesley, Reading (2002). http://research.microsoft.com/en-us/um/people/lamport/tla/book.html

  46. von Luck, K., Nebel, B., Peltason, C., Schmiedel, A.: BACK to consistency and incompleteness. In: Stoyan, H. (ed.) GWAI. Informatik-Fachberichte, vol. 118, pp. 245–256. Springer, Berlin (1985)

    Google Scholar 

  47. Ludäscher, B.: Integration of Active and Deductive Database Rules. DISDBIS, vol. 45. Infix Verlag, St. Augustin (1998)

    Google Scholar 

  48. Ludäscher, B., Lausen, G.: Handling termination in a logical language for active rules. Informatica (Lithuanian Academy of Sciences) 9(1), 65–84 (1998)

    Google Scholar 

  49. Menzies, T., Pecheur, C.: Verification and validation and artificial intelligence. Adv. Comp. 65, 154–203 (2005)

    Google Scholar 

  50. Minker, J.: Logic and databases: A 20 year retrospective. In: Pedreschi, D., Zaniolo, C. (eds.) Logic in Databases. Lecture Notes in Computer Science, vol. 1154, pp. 3–57. Springer, Berlin (1996)

    Google Scholar 

  51. Morris, J.M.: A general axiom of assignment. In: Bauer, F.L., Dijkstra, E.W., Hoare, C.A.R. (eds.) Theoretical Foundations of Programming Methodology: Lecture Notes of an International Summer School. Reidel, Dordrecht (1982)

    Google Scholar 

  52. Nakoulima, S.D.: Added value of LibRT VALENS for ILOG JRules. Rapport de stage, École des Mines de Nancy (2004). Available from Bruno Berstel-Da Silva

    Google Scholar 

  53. Newell, A., Simon, H.A.: Human Problem Solving. Prentice Hall, Englewood Cliffs (1972)

    Google Scholar 

  54. Olderog, E.R.: Hoare’s logic for programs with procedures—What has been achieved? In: Clarke, E.M., Kozen, D. (eds.) Logics of Programs. Lecture Notes in Computer Science, vol. 164, pp. 383–395. Springer, Berlin (1984)

    Google Scholar 

  55. Olderog, E.R.: Correctness of concurrent processes. Theor. Comp. Sci. 80, 263–288 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  56. Olderog, E.R.: Nets, Terms and Formulas: Three Views of Concurrent Processes and Their Relationship. Cambridge University Press, London (1991). Paperback Edition 2005

    Google Scholar 

  57. Olderog, E.R., Rössig, S.: A case study in transformational design of concurrent systems. In: Gaudel, M.C., Jouannaud, J.P. (eds.) Theory and Practice of Software Development (TAPSOFT’93). Lecture Notes in Computer Science, vol. 668, pp. 90–104. Springer, Berlin (1993)

    Google Scholar 

  58. Ontorule Project. http://ontorule-project.eu

  59. Owicki, S.S., Gries, D.: An axiomatic proof technique for parallel programs I. Acta Informatica 6, 319–340 (1976)

    Article  MATH  MathSciNet  Google Scholar 

  60. Piccinini, G.: Allen Newell. In: New Dictionary of Scientific Biography. Thomson Gale (2007). http://www.umsl.edu/~piccininig/Newell\%205.htm

  61. Prakash, G.R., Subrahmanian, E., Mahabala, H.N.: A methodology for systematic verification of OPS5-based AI applications. In: IJCAI, pp. 3–8. Morgan Kaufmann, Los Altos (1991)

    Google Scholar 

  62. Preece, A.D., Shinghal, R.: Foundation and application of knowledge base verification. Int. J. Intell. Syst. 9(8), 683–701 (1994)

    Article  Google Scholar 

  63. Pührer, J., Heymans, S., Eiter, T.: Dealing with inconsistency when combining ontologies and rules using DL-programs. In: Aroyo, L., Antoniou, G., Hyvönen, E., ten Teije, A., Stuckenschmidt, H., Cabral, L., Tudorache, T. (eds.) ESWC (1). Lecture Notes in Computer Science, vol. 6088, pp. 183–197. Springer, Berlin (2010)

    Google Scholar 

  64. Pührer, J., Ghali, A.E., Chniti, A., Korf, R., Schwichtenberg, A., Lévy, F., Heymans, S., Xiao, G., Eiter, T.: Consistency Maintenance. Public Deliverable 2.3, Ontorule Project (2011). http://ontorule-project.eu/outcomes?func=fileinfo&id=44

  65. Red Hat: JBoss Rules 5 Reference Guide (2012). https://access.redhat.com/knowledge/docs/en-US/JBoss_Enterprise_BRMS_Platform/5/html-single/JBoss_Rules_5_Reference_Guide/index.html#Sequential_Mode

  66. REWERSE Network of excellence. http://rewerse.net

  67. de Sainte Marie, C., Hallmark, G., Paschke, A.: Rule Interchange Format, Production Rule Dialect. Recommendation, W3C (2010). http://www.w3.org/TR/rif-prd/

  68. Schmedding, F., Sawas, N., Lausen, G.: Adapting the Rete-algorithm to evaluate F-logic rules. In: Paschke, A., Biletskiy, Y. (eds.) Advances in Rule Interchange and Applications. Lecture Notes in Computer Science, vol. 4824, pp. 166–173. Springer, Berlin (2007)

    Chapter  Google Scholar 

  69. Schmolze, J.G., Snyder, W.: Using confluence to control parallel production systems. In: Kanal, L.N. (ed.) Parallel Processing for Artificial Intelligence. Elsevier Science, New York (1994)

    Google Scholar 

  70. Schmolze, J.G., Snyder, W.: A tool for testing confluence of production rules. In: Ayel, M., Rousset, M.C. (eds.) EUROVAV, pp. 91–104. ADERIAS-LIA, Université de Savoie (1995)

    Google Scholar 

  71. Schmolze, J.G., Snyder, W.: Detecting redundant production rules. In: AAAI/IAAI, pp. 417–423 (1997)

    Google Scholar 

  72. Schmolze, J.G., Snyder, W.: Detecting redundancy among production rules using term rewrite semantics. Knowl. Base. Syst. 12(1–2), 3–11 (1999)

    Article  Google Scholar 

  73. Schneider, F.B., Andrews, G.R.: Concepts for concurrent programming. In: de Bakker, J.W., de Roever, W.P., Rozenberg, G. (eds.) Current Trends in Concurrency. Lecture Notes in Computer Science, vol. 224, pp. 669–716. Springer, Berlin (1986)

    Chapter  Google Scholar 

  74. Snyder, W., Schmolze, J.G.: Rewrite semantics for production rule systems: Theory and applications. In: McRobbie, M.A., Slaney, J.K. (eds.) CADE. Lecture Notes in Computer Science, vol. 1104, pp. 508–522. Springer, Berlin (1996)

    Google Scholar 

  75. Sowa, J.F.: Knowledge Representation: Logical, Philosophical, and Computational Foundations. Brooks/Cole, Belmont (1999)

    Google Scholar 

  76. Suwa, M., Scott, A.C., Shortliffe, E.H.: An approach to verifying completeness and consistency in a rule-based expert system. AI Mag. 3(4), 16–21 (1982)

    Google Scholar 

  77. The Object Management Group: Semantics of Business Vocabulary and Business Rules (SBVR 1.0) (2008). http://www.omg.org/spec/SBVR/1.0/

  78. Ullman, J.D.: Principles of Database and Knowledge-Base Systems, Volume I. Computer Science Press, Rockville (1988)

    Google Scholar 

  79. Vianu, V.: Rule-based languages. Ann. Math. Artif. Intell. 19(1–2), 215–259 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  80. Widom, J., Ceri, S.: Introduction to active database systems. In: Active Database Systems: Triggers and Rules For Advanced Database Processing, pp. 1–41. Morgan Kaufmann, Los Altos (1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Software Engineering group, University of Freiburg, Georges-Köhler-Allee 52, 79110, Freiburg, Germany

    Bruno Berstel-Da Silva

Authors
  1. Bruno Berstel-Da Silva
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Berstel-Da Silva, B. (2014). Related Work. In: Verification of Business Rules Programs. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40038-4_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-40038-4_2

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-40037-7

  • Online ISBN: 978-3-642-40038-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation