Skip to main content

ARM: Automatic Rule Miner

  • Conference paper
Logic-Based Program Synthesis and Transformation (LOPSTR 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4407))

  • 307 Accesses

Abstract

Rule-based formalisms are ubiquitous in computer science. However, a difficulty that arises frequently when specifying or programming the rules is to determine which effects should be propagated by these rules. In this paper, we present a tool called ARM (Automatic Rule Miner) that generates rules for relations over finite domains.

ARM offers a rich functionality to provide the user with the possibility of specifying the admissible syntactic forms of the rules.

Furthermore, we show that our approach performs well on various examples, e.g. generation of firewall rules or generation of rule-based constraint solvers. Thus, it is suitable for users from different fields.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Abdennadher, S., Rigotti, C.: Automatic generation of propagation rules for finite domains. In: Dechter, R. (ed.) CP 2000. LNCS, vol. 1894, Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  2. Abdennadher, S., Rigotti, C.: Automatic generation of rule-based constraint solvers over finite domains. ACM Transactions on Computational Logic 5(2) (2004)

    Google Scholar 

  3. Abdennadher, S., Rigotti, C.: Automatic generation of CHR constraint solvers. Journal of Theory and Practice of Logic Programming (TPLP) 5(2) (2005)

    Google Scholar 

  4. Dehaspe, L., Toivonen, H.: Discovery of frequent DATALOG patterns. Data Mining and Knowledge Discovery 3(1), 7–36 (1999)

    Article  Google Scholar 

  5. Frühwirth, T.: Theory and practice of constraint handling rules, special issue on constraint logic programming. Journal of Logic Programming 37(1-3) (1998)

    Google Scholar 

  6. Frühwirth, T., Abdennadher, S.: Essentials of Constraint Programming. Springer, Heidelberg (2003)

    Google Scholar 

  7. Liu, X.A., Gouda, M.G.: Firewall design: Consistency, completeness, and compactness. In: 24th IEEE International Conference on Distributed Computing Systems, IEEE Computer Society Press, Los Alamitos (2004)

    Google Scholar 

  8. Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Efficient mining of association rules using closed itemset lattices. Information Systems 24(1), 25–46 (1999)

    Article  Google Scholar 

  9. Plotkin, G.: A note on inductive generalization. In: Machine Intelligence, vol. 5, pp. 153–163. Edinburgh University Press, Edinburgh (1970)

    Google Scholar 

  10. Smyth, P., Fayyad, U., Piatestsky, G.: From data mining to knowledge discovery in databases. American Association for Artificial Intelligence (1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Germán Puebla

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer Berlin Heidelberg

About this paper

Cite this paper

Abdennadher, S., Olama, A., Salem, N., Thabet, A. (2007). ARM: Automatic Rule Miner. In: Puebla, G. (eds) Logic-Based Program Synthesis and Transformation. LOPSTR 2006. Lecture Notes in Computer Science, vol 4407. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71410-1_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-71410-1_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-71409-5

  • Online ISBN: 978-3-540-71410-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics