Itemset frequency satisfiability: complexity and axiomatization
From MaRDI portal
Publication:2481978
DOI10.1016/j.tcs.2007.11.003zbMath1136.68021OpenAlexW2026797055MaRDI QIDQ2481978
Publication date: 15 April 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://repository.uantwerpen.be/docman/irua/69720c/5632.pdf
Analysis of algorithms and problem complexity (68Q25) Database theory (68P15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (2)
Computational complexity of queries based on itemsets ⋮ Maximum entropy models and subjective interestingness: an application to tiles in binary databases
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computational complexity of queries based on itemsets
- Probabilistic logic
- Probabilistic satisfiability
- Anytime deduction for probabilistic logic
- Local probabilistic deduction from taxonomic and probabilistic knowledge-bases over conjunctive events
- A logic for reasoning about probabilities
- Axiomatization of frequent itemsets
- Safe projections of binary data sets
- Probabilistic logic programming with conditional constraints
- The Uncertain Reasoner's Companion
- Database Support for Data Mining Applications
- Constraint-Based Mining and Inductive Databases
- Privacy preserving data mining
- Automatic derivation of probabilistic inference rules
This page was built for publication: Itemset frequency satisfiability: complexity and axiomatization