Enhancing a DLP System for Advanced Database Applications

  • Giorgio Terracina
  • Erika De Francesco
  • Claudio Panetta
  • Nicola Leone
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5341)

Abstract

Disjunctive logic programming under answer set semantics (DLP, ASP) is a powerful rule-based formalism for knowledge representation and reasoning. The language of DLP is very expressive, and allows to model also advanced knowledge-based tasks arising in modern application-areas like, e.g., information integration and knowledge management. The recent development of efficient systems supporting disjunctive logic programming, has encouraged the usage of DLP in real-world applications. However, despite the high expressiveness of their languages, the success of DLP systems is still dimmed when the applications of interest become data intensive (current DLP systems work only in main memory) or they need the execution of some inherently procedural sub-tasks. The main goal of this paper is precisely to improve efficiency and usability of DLP systems in these contexts, for a full exploitation of DLP in real-world applications.

We develop a DLP system which (i) carries out as much as possible of the reasoning tasks in mass memory without degrading performances, allowing to deal with data-intensive applications; (ii) extends the expressiveness of DLP language with external function calls, yet improving efficiency (at least for procedural sub-tasks) and knowledge-modeling power; (iii) incorporates an optimization strategy, based on an unfolding technique, for efficient query answering; (iv) supports primitives allowing to integrate data from different databases in a simple way.

We test the system on a real data-integration application, comparing its performance against the main DLP systems. Test results are very encouraging: the proposed system can handle significantly larger amounts of data than competitor systems, and it is also faster in response time.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Arenas, M., Bertossi, L.E., Chomicki, J.: Specifying and Querying Database Repairs using Logic Programs with Exceptions. In: Proc. of the Fourth International Conference on Flexible Query Answering Systems (FQAS 2000), pp. 27–41 (2000)Google Scholar
  2. 2.
    Beeri, C., Ramakrisnhan, R.: On the power of magic. Journal of Logic Programming 10(1-4), 255–259 (1991)MathSciNetCrossRefMATHGoogle Scholar
  3. 3.
    Bennardo, G.: Interrogazione dati basata su ontologie, Master Thesis in Computer Science (2008)Google Scholar
  4. 4.
    Calì, A., Lembo, D., Rosati, R.: Query rewriting and answering under constraints in data integration systems. In: Int. Joint Conference on Artificial Intelligence (IJCAI 2003), pp. 16–21 (2003)Google Scholar
  5. 5.
    Calimeri, F., Cozza, S., Ianni, G.: External sources of knowledge and value invention in logic programming. Annals of Mathematics and Artificial Intelligence 50, 333–361 (2007)MathSciNetCrossRefMATHGoogle Scholar
  6. 6.
    Dell’Armi, T., Faber, W., Ielpa, G., Leone, N., Pfeifer, G.: Aggregate Functions in Disjunctive Logic Programming: Semantics, Complexity, and Implementation in DLV. In: Proc. of the 18th Int. Joint Conference on Artificial Intelligence (IJCAI), Acapulco, Mexico, pp. 847–852 (2003)Google Scholar
  7. 7.
    Leone, N., et al.: The infomix system for advanced integration of incomplete and inconsistent data. In: Proc. of 24th ACM SIGMOD International Conference on Management of Data (SIGMOD 2005), Baltimore, Maryland, USA, 2005, pp. 915–917. ACM Press, New York (2005)CrossRefGoogle Scholar
  8. 8.
    Gebser, M., Kaufmann, B., Neumann, A., Schaub, T.: Clasp: A conflict-driven answer set solver. In: Baral, C., Brewka, G., Schlipf, J. (eds.) LPNMR 2007. LNCS (LNAI), vol. 4483, pp. 260–265. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  9. 9.
    Gebser, M., Schaub, T., Thiele, S.: GrinGo: A new grounder for answer set programming. In: Int. Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR), Tempe, AZ, USA, pp. 266–271 (2007)Google Scholar
  10. 10.
    Giunchiglia, E., Lierler, Y., Maratea, M.: Answer set programming based on propositional satisfiability. Jornal of Automated Reasoning 36(4), 345–377 (2006)MathSciNetCrossRefMATHGoogle Scholar
  11. 11.
    Ianni, G., Martello, A., Panetta, C., Terracina, G.: Efficiently querying RDF(S) ontologies with Answer Set Programming. Journal of Logic and Computation (special issue) (forthcoming)Google Scholar
  12. 12.
    Janhunen, T., Niemelä, I., Seipel, D., Simons, P., You, J.: Unfolding partiality and disjunctions in stable model semantics. TOCL 7(1), 1–37 (2006)MathSciNetCrossRefMATHGoogle Scholar
  13. 13.
    Lenzerini, M.: Data integration: A theoretical perspective. In: Proc. PODS 2002, pp. 233–246 (2002)Google Scholar
  14. 14.
    Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Perri, S., Scarcello, F.: The DLV System for Knowledge Representation and Reasoning. ACM Trans. Comput. Log. 7(3), 499–562 (2006)MathSciNetCrossRefMATHGoogle Scholar
  15. 15.
    Leone, N., Rullo, P., Scarcello, F.: Disjunctive Stable Models: Unfounded Sets, Fixpoint Semantics and Computation. Information and Computation 135(2), 69–112 (1997)MathSciNetCrossRefMATHGoogle Scholar
  16. 16.
    Mumick, I.S., Finkelstein, S.J., Pirahesh, H., Ramakrishnan, R.: Magic conditions. ACM Trans. Database Systems 21(1), 107–155 (1996)CrossRefGoogle Scholar
  17. 17.
    Niemelä, I., Simons, P., Syrjänen, T.: Smodels: A System for Answer Set Programming. In: Proc. of the 8th Int. Workshop on Non-Monotonic Reasoning (NMR 2000), Colorado, USA (April 2000)Google Scholar
  18. 18.
    Ricca, F., Leone, N.: Disjunctive Logic Programming with types and objects: The DLV +  System. Journal of Apllied Logic 5(3), 545–573 (2007)MathSciNetCrossRefMATHGoogle Scholar
  19. 19.
    Syrjänen, T.: Lparse 1.0 user’s manual (2002), http://www.tcs.hut.fi/Software/smodels/lparse.ps.gz
  20. 20.
    Terracina, G., Leone, N., Lio, V., Panetta, C.: Experimenting with recursive queries in database and logic programming systems. Theory and Practice of Logic Programming (TPLP) 8(2), 129–165 (2008)MathSciNetCrossRefMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Giorgio Terracina
    • 1
  • Erika De Francesco
    • 1
  • Claudio Panetta
    • 1
  • Nicola Leone
    • 1
  1. 1.Dipartimento di MatematicaUniversità della CalabriaRende (CS)Italy

Personalised recommendations