Abstract
Observational calculi are special logical calculi in which statements concerning observed data can be formulated. Their special case is predicate observational calculus. It can be obtainedby modifications of classical predicate calculus - only finite models are allowed and generalisedquantifiers are added. Association rules can be understood as special formulas of predicate observational calculi. Such association rules correspond to general relations of two Boolean attributes. A problem of the possibility to express association rule by the means of classical predicate calculus is investigated. A reasonable criterion of classical definability of association rules is presented.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Rights and permissions
About this chapter
Cite this chapter
Rauch, J. Definability of Association Rules in Predicate Calculus. In: Young Lin, T., Ohsuga, S., Liau, CJ., Hu, X. (eds) Foundations and Novel Approaches in Data Mining. Studies in Computational Intelligence, vol 9. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11539827_2
Download citation
DOI: https://doi.org/10.1007/11539827_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28315-7
Online ISBN: 978-3-540-31229-1
eBook Packages: EngineeringEngineering (R0)