Mauricio Minuto Espil
ABSTRACT
In this paper, we study the relationship that exists among the problems of finite concept satisfiability for TBoxes expressed in DL-Lite^{N}_{horn} and DL-Lite^{N}_{bool} description logics and the existence of a non-empty database that satisfies a set of given itemset frequency constraints, for the case where concepts are regarded as items. We show that, given a target concept defined through a DL-Lite^{N}_{bool} TBox, there exists a set of frequency constraints on boolean combinations of the concepts occurring in the TBox such that the target concept has a non-empty finite extension if and only if there exists a non-empty database which satisfies the constraints. As a consequence, the concept finite satisfiability problem is NP-complete for both logics. Furthermore, augmenting DL-Lite^{N}_{horn} and DL-Lite^{N}_{bool} TBoxes with frequency constraints on concept occurrence does not increase the complexity of the problems.
- A. Artale, D. Calvanese, R. Kontchakov, and M. Zakharyaschev. DL-Lite in the Light of First-Order Logic. In 22nd AAAI Conference on Artificial Intelligence AAAI Proceedings, pages 361--366, 2007. Google Scholar
Digital Library
- A. Artale, D. Calvanese, R. Kontchakov, and M. Zakharyaschev. The DL-Lite Family and Relations. Journal of Artificial Intelligence Research, 36:1--69, 2009. Google ScholarDigital Library
- F. Baader, D. Calvanese, D. McGuinness, D. Nardi, and P. Patel-Schneider, editors. The Description Logic Handbook: Theory, Implementation and Applications. Cambridge University Press, 2003. Google ScholarDigital Library
- F. Baader and F. Distel. A Finite Basis for the Set of εL-Implications Holding in a Finite Model. In ICFCA 2008, International Conference on Formal Concept Analysis, pages 46--61, 2008. Google ScholarDigital Library
- F. Baader and F. Distel. Exploring Finite Models in the Description Logic εL. In ICFCA 2009, International Conference on Formal Concept Analysis, pages 146--161, 2009. Google ScholarDigital Library
- M. Balaban and A. Maraee. A UML-Based Method for Deciding Finite Satisfiability in Description Logics. In International Workshop on Description Logics, 2008.Google Scholar
- L. T. C. Lutz, U. Sattler. The complexity of finite model reasoning in description logics. Information and Computation, 199(1-2):132--171, 2005. Google ScholarDigital Library
- M. Cadoli, D. Calvanese, and G. D. Giacomo. Towards implementing finite model reasoning in description logics. In International Workshop on Description Logics, 2004.Google Scholar
- M. Cadoli, D. Calvanese, G. D. Giacomo, and T. Mancini. Finite Model Reasoning on UML Class Diagrams Via Constraint Programming. In AI*IA 2007, pages 36--47, 2007. Google ScholarDigital Library
- T. Calders. Axiomatization and Deduction Rules for the Frequency of Itemsets. PhD thesis, University of Antwerp, Dept. Mathematics and Computer Science, 2003.Google Scholar
- T. Calders. The complexity of satisfying constraints on databases of transactions. Acta Informatica, 44(7-8):591--624, 2007. Google ScholarDigital Library
- T. Calders. Itemset frequency satisfiability: Complexity and axiomatization. Theoretical Computer Science, 394(1-2):84--111, 2008. Google ScholarDigital Library
- T. Calders and B. Goethals. Non-derivable itemset mining. Data Mining and Knowledge Discovery, 14(1):171--206, 2007. Google ScholarDigital Library
- D. Calvanese. Finite model reasoning in description logics. In International Workshop on Description Logics, pages 25--36, 1996.Google Scholar
- D. Calvanese, G. D. Giacomo, D. Lembo, M. Lenzerini, and R. Rosati. Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family. Journal of Automated Reasoning, 39(3):385--429, 2007. Google ScholarDigital Library
- Y. Ibañez-García. Finite Model Reasoning in DL-Lite with Cardinality Constraints. In International Workshop on Description Logics, 2012.Google Scholar
- J. L. Balcázar. Deduction schemes for association rules. In Eleven International Conference on Discovery Science, volume LNCS 5255, pages 124--135. Springer, 2008. Google ScholarDigital Library
- R. Kontchakov, F. Wolter, and F. Zakharyaschev. Logic-based ontology comparison and module extraction, with an application to DL-Lite. Artificial Intelligence, 174(15):1093--1141, 2010. Google ScholarDigital Library
- M. Lenzerini and P. Nobili. On the satisfiability of dependency constraints in entity-relationship schemata. Information Systems, 15(4):453--461, 1990. Google ScholarDigital Library
- A. Maraee and M. Balaban. Efficient Reasoning About Finite Satisfiability of UML Class Diagrams with Constrained Generalization Sets. In Model Driven Architecture-Foundations and Applications Third European ECMDA-FA Conference Procedings, volume LNCS 4530, pages 17--31. Springer, 2007. Google ScholarDigital Library
- M. Minuto Espil. Tractable reasoning problems with fully-characterized association rules. In Advances in Databases and Information Systems, ADBIS 2012, volume LNCS 7503, pages 282--295. Springer, 2012. Google ScholarDigital Library
- N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal. Efficient mining of association rules using closed itemset lattices. Information Systems, 24(1):25--46, 1999. Google ScholarDigital Library
- N. Pasquier, R. Taouil, Y. Bastide, G. Stumme, and L. Lakhal. Generating a condensed representation for association rules. Journal on Intelligent Information Systems, 24(1):29--60, 2005. Google ScholarDigital Library
- A. Queralt, A. Artale, D. Calvanese, and E. Teniente. OCL-Lite: Finite reasoning on UML/OCL conceptual schemas. Data and Knowledge Engineering, 73:1--22, 2012. Google ScholarDigital Library
- R. Rosati. Finite Model Reasoning in DL-Lite. In 5th European Semantic Web Conference, ESWC Proceedings, volume LNCS 5021, pages 215--229. Springer, 2008. Google ScholarDigital Library
- K. Schild. A correspondence theory for terminological logics: Preliminary report. In IJCAI'91, Proceedings of the International Joint Conference on Artificial Intelligence, pages 466--471. Morgan Kaufmann, 1991. Google ScholarDigital Library
- B. Thalheim. Fundamentals of cardinality constraints. In 11th International Conference on the Entity-Relationship Approach, volume LNCS 645, pages 7--23. Springer, 1992. Google ScholarDigital Library
Index Terms
- Enhancing DL-Lite^{N}_{horn|bool} Finite Models with Frequency Constraints
Recommendations
Finite model reasoning in DL-lite
ESWC'08: Proceedings of the 5th European semantic web conference on The semantic web: research and applicationsThe semantics of OWL-DL and its subclasses are based on the classical semantics of first-order logic, in which the interpretation domain may be an infinite set. This constitutes a serious expressive limitation for such ontology languages, since, in many ...
Tractable disjunctive constraints
CP'97: Proceedings of the 3rd International Conference on Principles and Practice of Constraint ProgrammingMany combinatorial search problems can be expressed as 'constraint satisfaction problems', and this class of problems is known to be NP-complete in general. In this paper we investigate 'disjunctive constraints', that is, constraints which have the form ...
On Some Aspects of Mixed Horn Formulas
SAT '09: Proceedings of the 12th International Conference on Theory and Applications of Satisfiability TestingWe consider various aspects of the Mixed Horn formula class (MHF). A formula <em>F</em> *** MHF consists of a 2-CNF part <em>P</em> and a Horn part <em>H</em> . We propose that MHF has a central relevance in CNF, because many prominent NP-complete ...
Comments