Logic Programming Languages for Databases and the Web

  • Sergio Greco
  • Francesca A. Lisi
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6125)

Abstract

This chapter contains a reference selection of Italian contributions in the intersection of Logic Programming (LP) with databases and the (Semantic) Web. More precisely, we will survey the main contributions on deductive databases such as the coupling of Prolog systems and database systems, evaluation and optimization techniques, Datalog extensions for expressing nondeterministic and aggregate queries, and active rules and their relation to deductive rules. Also we will illustrate solutions employing LP for querying the Web, manipulating Web pages, representing knowledge in the Semantic Web and learning Semantic Web ontologies and rules.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Abiteboul, S.: Querying semi-structured data. In: Afrati, F.N., Kolaitis, P.G. (eds.) ICDT 1997. LNCS, vol. 1186, pp. 1–18. Springer, Heidelberg (1996)Google Scholar
  2. 2.
    Abiteboul, S., Buneman, P., Suciu, D.: Data on the Web: From Relations to Semistructured Data and XML. Morgan Kaufmann, San Francisco (2000)Google Scholar
  3. 3.
    Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Reading (1995)MATHGoogle Scholar
  4. 4.
    Abiteboul, S., Simon, E.: Fundamental Properties of Deterministic and Nondeterministic Extensions of Datalog. Theoretical Compututer Science 78(1), 137–158 (1991)MATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Abiteboul, S., Vianu, V.: Non-Determinism in Logic-Based Languages. Annals of Mathematics and Artificial Intelligence 3(2-4), 151–186 (1991)MATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Angles, R., Gutierrez, C.: The Expressive Power of SPARQL. In: Sheth, A.P., Staab, S., Dean, M., Paolucci, M., Maynard, D., Finin, T., Thirunarayan, K. (eds.) ISWC 2008. LNCS, vol. 5318, pp. 114–129. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  7. 7.
    Baader, F., Calvanese, D., McGuinness, D., Nardi, D., Patel-Schneider, P.F. (eds.): The Description Logic Handbook: Theory, Implementation and Applications, 2nd edn. Cambridge University Press, Cambridge (2007)MATHGoogle Scholar
  8. 8.
    Badea, L., Nienhuys-Cheng, S.-W.: A Refinement Operator for Description Logics. In: Cussens, J., Frisch, A.M. (eds.) ILP 2000. LNCS (LNAI), vol. 1866, pp. 40–59. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  9. 9.
    Beeri, C., Ramakrishnan, R.: On the Power of Magic. Journal of Logic Programming 10(1-4), 255–299 (1991)MATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Berners-Lee, T., Hendler, J., Lassila, O.: The Semantic Web. Scientific American (May 2001)Google Scholar
  11. 11.
    Bidoit, N., Maabout, S.: A Model Theoretic Approach to Update Rule Programs. In: Afrati, F.N., Kolaitis, P.G. (eds.) ICDT 1997. LNCS, vol. 1186, pp. 173–187. Springer, Heidelberg (1996)Google Scholar
  12. 12.
    Bonatti, P., Calimeri, F., Leone, N., Ricca, F.: Answer Set Programming. In: Dovier, Pontelli [25], ch. 8, vol. 6125, pp. 159–178 (2010)Google Scholar
  13. 13.
    Borgida, A.: On the Relative Expressiveness of Description Logics and Predicate Logics. Artificial Intelligence 82(1-2), 353–367 (1996)CrossRefMathSciNetGoogle Scholar
  14. 14.
    Buntine, W.: Generalized Subsumption and Its Applications to Induction and Redundancy. Artificial Intelligence 36(2), 149–176 (1988)MATHCrossRefMathSciNetGoogle Scholar
  15. 15.
    Calì, A., Gottlob, G., Lukasiewicz, T.: Tractable Query Answering over Ontologies with Datalog+/-. In: Description Logics (2009)Google Scholar
  16. 16.
    Calimeri, F., Faber, W., Leone, N., Perri, S.: Declarative and Computational Properties of Logic Programs with Aggregates. In: IJCAI, pp. 406–411 (2005)Google Scholar
  17. 17.
    Caroprese, L., Greco, S., Sirangelo, C., Zumpano, E.: Declarative Semantics of Production Rules for Integrity Maintenance. In: Etalle, S., Truszczyński, M. (eds.) ICLP 2006. LNCS, vol. 4079, pp. 26–40. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  18. 18.
    Caroprese, L., Greco, S., Zumpano, E.: Active Integrity Constraints for Database Consistency Maintenance. IEEE Transactions on Knowledge and Data Engineering 21(7), 1042–1058 (2009)CrossRefGoogle Scholar
  19. 19.
    Caroprese, L., Truszczyński, M.: Declarative Semantics for Active Integrity Constraints. In: Garcia de la Banda, M., Pontelli, E. (eds.) ICLP 2008. LNCS, vol. 5366, pp. 269–283. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  20. 20.
    Caroprese, L., Truszczyński, M.: Declarative Semantics for Revision Programming and Connections to Active Integrity Constraints. In: Hölldobler, S., Lutz, C., Wansing, H. (eds.) JELIA 2008. LNCS (LNAI), vol. 5293, pp. 100–112. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  21. 21.
    Ceri, S., Fraternali, P., Paraboschi, S., Tanca, L.: Automatic Generation of Production Rules for Integrity Maintenance. ACM Transactions on Database Systems 19(3), 367–422 (1994)CrossRefGoogle Scholar
  22. 22.
    Ceri, S., Gottlob, G., Tanca, L.: Logic Programming and Databases. Springer, Heidelberg (1990)Google Scholar
  23. 23.
    Ceri, S., Gottlob, G., Wiederhold, G.: Efficient Database Access from Prolog. IEEE Transaction on Software Engineering 15(2), 153–164 (1989)CrossRefMathSciNetGoogle Scholar
  24. 24.
    Donini, F.M., Lenzerini, M., Nardi, D., Schaerf, A.: \(\mathcal{AL}\)-log: Integrating Datalog and Description Logics. J. of Intelligent Information Systems 10(3), 227–252 (1998)CrossRefGoogle Scholar
  25. 25.
    Dovier, A., Pontelli, E. (eds.): 25 Years of Logic Programming in Italy. LNCS, vol. 6125. Springer, Heidelberg (2010)Google Scholar
  26. 26.
    Drabent, W., Eiter, T., Ianni, G.B., Krennwallner, T., Lukasiewicz, T., Maluszynski, J.: Hybrid Reasoning with Rules and Ontologies. In: REWERSE, pp. 1–49 (2009)Google Scholar
  27. 27.
    Eiter, T., Gottlob, G., Mannila, H.: Disjunctive Datalog. ACM Transactions on Database Systems 22(3), 364–418 (1997)CrossRefGoogle Scholar
  28. 28.
    Eiter, T., Ianni, G., Lukasiewicz, T., Schindlauer, R., Tompits, H.: Combining answer set programming with description logics for the Semantic Web. Artificial Intelligence 172(12-13), 1495–1539 (2008)MATHCrossRefMathSciNetGoogle Scholar
  29. 29.
    Eiter, T., Ianni, G.B., Schindlauer, R., Tompits, H.: A Uniform Integration of Higher-Order Reasoning and External Evaluations in Answer-Set Programming. In: IJCAI, pp. 90–96 (2005)Google Scholar
  30. 30.
    Esposito, F., Fanizzi, N., Iannone, L., Palmisano, I., Semeraro, G.: Knowledge-Intensive Induction of Terminologies from Metadata. In: McIlraith, S.A., Plexousakis, D., van Harmelen, F. (eds.) ISWC 2004. LNCS, vol. 3298, pp. 441–455. Springer, Heidelberg (2004)Google Scholar
  31. 31.
    Fanizzi, N., d’Amato, C., Esposito, F.: DL-FOIL Concept Learning in Description Logics. In: Železný, F., Lavrač, N. (eds.) ILP 2008. LNCS (LNAI), vol. 5194, pp. 107–121. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  32. 32.
    Fanizzi, N., Iannone, L., Palmisano, I., Semeraro, G.: Concept Formation in Expressive Description Logics. In: Boulicaut, J.-F., Esposito, F., Giannotti, F., Pedreschi, D. (eds.) ECML 2004. LNCS (LNAI), vol. 3201, pp. 99–110. Springer, Heidelberg (2004)Google Scholar
  33. 33.
    Flesca, S., Greco, S.: Declarative semantics for active rules. Theory and Practice of Logic Programming 1(1), 43–69 (2001)MATHCrossRefMathSciNetGoogle Scholar
  34. 34.
    Frisch, A.M., Cohn, A.G.: Thoughts and Afterthoughts on the 1988 Workshop on Principles of Hybrid Reasoning. AI Magazine 11(5), 84–87 (1991)Google Scholar
  35. 35.
    Furfaro, F., Greco, G., Greco, S.: Minimal founded semantics for disjunctive logic programs and deductive databases. Theory and Practice of Logic Programming 4(1-2), 75–93 (2004)MATHCrossRefMathSciNetGoogle Scholar
  36. 36.
    Furfaro, F., Greco, S., Ganguly, S., Zaniolo, C.: Pushing extrema aggregates to optimize logic queries. Information Systems 27(5), 321–343 (2002)MATHCrossRefGoogle Scholar
  37. 37.
    Gallaire, H., Minker, J. (eds.): Logic and Data Bases. Plenum Press, New York (1978)MATHGoogle Scholar
  38. 38.
    Gallaire, H., Minker, J., Nicolas, J.M.: Logic and databases: A deductive approach. ACM Computing Surveys 16(2), 153–185 (1984)MATHCrossRefMathSciNetGoogle Scholar
  39. 39.
    Gallaire, H., Nicolas, J.M., Minker, J. (eds.): Advances in Data Base Theory, vol. 2. Plenum Press, New York (1984)Google Scholar
  40. 40.
    Ganguly, S., Greco, S., Zaniolo, C.: Extrema Predicates in Deductive Databases. Journal of Computer and Systems Science 51(2), 244–259 (1995)MATHCrossRefMathSciNetGoogle Scholar
  41. 41.
    Van Gelder, A., Ross, K.A., Schlipf, J.S.: The Well-Founded Semantics for General Logic Programs. J. ACM 38(3), 620–650 (1991)MATHGoogle Scholar
  42. 42.
    Gelfond, M., Lifschitz, V.: The Stable Model Semantics for Logic Programming. In: ICLP/SLP, pp. 1070–1080 (1988)Google Scholar
  43. 43.
    Giannotti, F., Greco, S., Saccà, D., Zaniolo, C.: Programming with Non-Determinism in Deductive Databases. Annals of Mathematics and Artificial Intelligence 19(1-2), 97–125 (1997)MATHCrossRefMathSciNetGoogle Scholar
  44. 44.
    Giannotti, F., Pedreschi, D., Saccà, D., Zaniolo, C.: Non-Determinism in Deductive Databases. In: Delobel, C., Masunaga, Y., Kifer, M. (eds.) DOOD 1991. LNCS, vol. 566, pp. 129–146. Springer, Heidelberg (1991)Google Scholar
  45. 45.
    Giannotti, F., Pedreschi, D., Zaniolo, C.: Semantics and Expressive Power of Nondeterministic Constructs in Deductive Databases. Journal of Computer and Systems Science 62(1), 15–42 (2001)CrossRefMathSciNetGoogle Scholar
  46. 46.
    Giordano, L., Toni, F.: Knowledge representation and non-monotonic reasoning. In: Dovier, Pontelli [25], ch. 5, vol. 6125, pp. 86–110 (2010)Google Scholar
  47. 47.
    Gozzi, F., Lugli, M., Ceri, S.: An overview of PRIMO: a portable interface between PROLOG and relational databases. Information Systems 15(5), 543–553 (1990)CrossRefGoogle Scholar
  48. 48.
    Greco, S.: Dynamic Programming in Datalog with Aggregates. IEEE Transactions on Knowledge and Data Engineering 11(2), 265–283 (1999)CrossRefGoogle Scholar
  49. 49.
    Greco, S., Saccà, D.: Complexity and Expressive Power of Deterministic Semantics for Datalog. Information and Computation 153(1), 81–98 (1999)MATHCrossRefMathSciNetGoogle Scholar
  50. 50.
    Greco, S., Saccà, D., Zaniolo, C.: Datalog Queries with Stratified Negation and Choice: from p to d\(^{\mbox{p}}\). In: Y. Vardi, M., Gottlob, G. (eds.) ICDT 1995. LNCS, vol. 893, pp. 82–96. Springer, Heidelberg (1995)Google Scholar
  51. 51.
    Greco, S., Saccà, D., Zaniolo, C.: The PushDown Method to Optimize Chain Logic Programs. In: Fülöp, Z., Gecseg, F. (eds.) ICALP 1995. LNCS, vol. 944, pp. 523–534. Springer, Heidelberg (1995)Google Scholar
  52. 52.
    Greco, S., Saccà, D., Zaniolo, C.: Grammars and Automata to Optimize Chain Logic Queries. Int. Journal Foundations of Computer Science 10(3), 349 (1999)CrossRefGoogle Scholar
  53. 53.
    Greco, S., Zaniolo, C.: Optimization of Linear Logic Programs Using Counting Methods. In: Pirotte, A., Delobel, C., Gottlob, G. (eds.) EDBT 1992. LNCS, vol. 580, pp. 72–87. Springer, Heidelberg (1992)CrossRefGoogle Scholar
  54. 54.
    Greco, S., Zaniolo, C.: Greedy algorithms in Datalog. Theory and Practice of Logic Programming 1(4), 381–407 (2001)MATHCrossRefMathSciNetGoogle Scholar
  55. 55.
    Grosof, B.N., Horrocks, I., Volz, R., Decker, S.: Description logic programs: combining logic programs with description logic. In: WWW, pp. 48–57 (2003)Google Scholar
  56. 56.
    Horrocks, I., Patel-Schneider, P.F., van Harmelen, F.: From \(\mathcal{SHIQ}\) and RDF to OWL: The Making of a Web Ontology Language. Journal of Web Semantics 1(1), 7–26 (2003)Google Scholar
  57. 57.
    Hustadt, U., Motik, B., Sattler, U.: Deciding expressive description logics in the framework of resolution. Information and Computation 206(5), 579–601 (2008)MATHCrossRefMathSciNetGoogle Scholar
  58. 58.
    Ianni, G.B., Krennwallner, T., Martello, A., Polleres, A.: A Rule System for Querying Persistent RDFS Data. In: Aroyo, L., Traverso, P., Ciravegna, F., Cimiano, P., Heath, T., Hyvönen, E., Mizoguchi, R., Oren, E., Sabou, M., Simperl, E. (eds.) ESWC 2009. LNCS, vol. 5554, pp. 857–862. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  59. 59.
    Kietz, J.-U.: Learnability of Description Logic Programs. In: Matwin, S., Sammut, C. (eds.) ILP 2002. LNCS (LNAI), vol. 2583, pp. 117–132. Springer, Heidelberg (2003)Google Scholar
  60. 60.
    Krishnamurthy, R., Naqvi, S.A.: Non-Deterministic Choice in Datalog. In: JCDKB, pp. 416–424 (1988)Google Scholar
  61. 61.
    Lausen, G., Ludäscher, B., May, W.: On Logical Foundations of Active Databases. In: Logics for Databases and Information Systems, pp. 389–422 (1998)Google Scholar
  62. 62.
    Lehmann, J., Hitzler, P.: Foundations of Refinement Operators for Description Logics. In: Blockeel, H., Ramon, J., Shavlik, J., Tadepalli, P. (eds.) ILP 2007. LNCS (LNAI), vol. 4894, pp. 161–174. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  63. 63.
    Levy, A.Y., Rousset, M.-C.: Combining Horn rules and description logics in CARIN. Artificial Intelligence 104, 165–209 (1998)MATHCrossRefMathSciNetGoogle Scholar
  64. 64.
    Lisi, F.A.: Building Rules on Top of Ontologies for the Semantic Web with Inductive Logic Programming. Theory and Practice of Logic Programming 8(03), 271–300 (2008)MATHCrossRefMathSciNetGoogle Scholar
  65. 65.
    Lisi, F.A., Esposito, F.: Foundations of Onto-Relational Learning. In: Železný, F., Lavrač, N. (eds.) ILP 2008. LNCS (LNAI), vol. 5194, pp. 158–175. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  66. 66.
    Lisi, F.A., Esposito, F.: On Ontologies as Prior Conceptual Knowledge in Inductive Logic Programming. In: Knowledge Discovery Enhanced with Semantic and Social Information, pp. 3–18. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  67. 67.
    Lisi, F.A., Malerba, D.: Inducing Multi-Level Association Rules from Multiple Relations. Machine Learning 55, 175–210 (2004)MATHCrossRefGoogle Scholar
  68. 68.
    Lloyd, J.W.: Foundations of Logic Programming, 2nd edn. Springer, Heidelberg (1987)MATHGoogle Scholar
  69. 69.
    Loke, S.W., Davison, A.: LogicWeb: Enhancing the Web with Logic Programming. Journal of Logic Programming 36(3), 195–240 (1998)MATHCrossRefGoogle Scholar
  70. 70.
    Lukácsy, G., Szeredi, P.: Efficient Description Logic Reasoning in Prolog: The DLog system. Theory and Practice of Logic Programming 9(3), 343–414 (2009)MATHCrossRefMathSciNetGoogle Scholar
  71. 71.
    Marchiori, M.: Towards a people’s web: Metalog. In: Web Intelligence, pp. 320–326. IEEE Computer Society Press, Los Alamitos (2004)Google Scholar
  72. 72.
    Marchiori, M.: Introduction to the Special Issue on Logic Programming and the Web. Theory and Practice of Logic Programming 8(3), 247–248 (2008)CrossRefMathSciNetGoogle Scholar
  73. 73.
    Marchiori, M., Saarela, J.: Query + Metadata + Logic = Metalog. In: W3C Workshop on Query Languages (1998)Google Scholar
  74. 74.
    Mitchell, T.M.: Generalization as Search. Artificial Intelligence 18, 203–226 (1982)CrossRefMathSciNetGoogle Scholar
  75. 75.
    Motakis, I., Zaniolo, C.: Temporal Aggregation in Active Database Rules. In: SIGMOD Conference, pp. 440–451 (1997)Google Scholar
  76. 76.
    Motik, B., Rosati, R.: A Faithful Integration of Description Logics with Logic Programming. In: IJCAI, pp. 477–482 (2007)Google Scholar
  77. 77.
    Mumick, I.S., Shmueli, O.: How Expressive is Statified Aggregation? Annals of Mathematics and Artificial Intelligence 15(3-4), 407–434 (1995)MATHCrossRefMathSciNetGoogle Scholar
  78. 78.
    Nienhuys-Cheng, S.-H., de Wolf, R.: Foundations of Inductive Logic Programming. Springer, Heidelberg (1997)Google Scholar
  79. 79.
    Palopoli, L., Torlone, R.: Generalized Production Rules as a Basis for Integrating Active and Deductive Databases. IEEE Transactions on Knowledge and Data Engineering 9(6), 848–862 (1997)CrossRefGoogle Scholar
  80. 80.
    Pelov, N., Denecker, M., Bruynooghe, M.: Well-founded and stable semantics of logic programs with aggregates. Theory and Practice of Logic Programming 7(3), 301–353 (2007)MATHCrossRefMathSciNetGoogle Scholar
  81. 81.
    Picouet, P., Vianu, V.: Semantics and Expressiveness Issues in Active Databases. Journal of Computer and Systems Science 57(3), 325–355 (1998)MATHCrossRefMathSciNetGoogle Scholar
  82. 82.
    Pontelli, E.: Concurrent Web-Programming in CLP(WEB). In: HICSS (2000)Google Scholar
  83. 83.
    Pontelli, E., Gupta, G.: W-ACE: A Logic Language for Intelligent Internet Programming. In: IEEE ICTAI, pp. 2–10 (1997)Google Scholar
  84. 84.
    Przymusinski, T.C.: Semantics of Disjunctive Logic Programs and Deductive Databases. In: Delobel, C., Masunaga, Y., Kifer, M. (eds.) DOOD 1991. LNCS, vol. 566, pp. 85–107. Springer, Heidelberg (1991)Google Scholar
  85. 85.
    Rosati, R.: On the decidability and complexity of integrating ontologies and rules. Journal of Web Semantics 3(1), 61–73 (2005)Google Scholar
  86. 86.
    Rosati, R.: Semantic and Computational Advantages of the Safe Integration of Ontologies and Rules. In: Fages, F., Soliman, S. (eds.) PPSWR 2005. LNCS, vol. 3703, pp. 50–64. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  87. 87.
    Rosati, R.: \(\mathcal{DL}\)+log: Tight Integration of Description Logics and Disjunctive Datalog. In: KR, pp. 68–78 (2006)Google Scholar
  88. 88.
    Rosati, R.: On Combining Description Logic Ontologies and Nonrecursive Datalog Rules. In: Calvanese, D., Lausen, G. (eds.) RR 2008. LNCS, vol. 5341, pp. 13–27. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  89. 89.
    Rouveirol, C., Ventos, V.: Towards Learning in CARIN-\(\mathcal{ALN}\). In: Cussens, J., Frisch, A.M. (eds.) ILP 2000. LNCS (LNAI), vol. 1866, pp. 191–208. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  90. 90.
    Saccà, D.: The Expressive Powers of Stable Models for Bound and Unbound DATALOG Queries. Journal of Computer System Sciences 54(3), 441–464 (1997)MATHCrossRefGoogle Scholar
  91. 91.
    Saccà, D., Zaniolo, C.: The Generalized Counting Method for Recursive Logic Queries. Theoretical Computer Science 62(1-2), 187–220 (1988)MATHCrossRefMathSciNetGoogle Scholar
  92. 92.
    Saccà, D., Zaniolo, C.: Stable Models and Non-Determinism in Logic Programs with Negation. In: PODS, pp. 205–217 (1990)Google Scholar
  93. 93.
    Saccà, D., Zaniolo, C.: Deterministic and Non-Deterministic Stable Models. Journal of Logic and Computation 7(5), 555–579 (1997)MATHCrossRefMathSciNetGoogle Scholar
  94. 94.
    Schmidt-Schauss, M., Smolka, G.: Attributive Concept Descriptions with Complements. Artificial Intelligence 48(1), 1–26 (1991)MATHCrossRefMathSciNetGoogle Scholar
  95. 95.
    Son, T.C., Pontelli, E., Elkabani, I.: An unfolding-based semantics for logic programming with aggregates. CoRR, abs/cs/0605038 (2006)Google Scholar
  96. 96.
    Tsur, S.: Deductive Databases in Action. In: PODS, pp. 142–153 (1991)Google Scholar
  97. 97.
    Ullman, J.D.: Principles of Database and Knowledge-Base Systems, vol. II. Computer Science Press (1989)Google Scholar
  98. 98.
    Ullman, J.D.: Principles of Database and Knowledge-Base Systems, vol. I. Computer Science Press (1988)Google Scholar
  99. 99.
    Widom, J.: Deductive and Active Databases: Two Paradigms or Ends of a Spectrum? In: Rules in Database Systems, pp. 306–315 (1993)Google Scholar
  100. 100.
    Widom, J., Ceri, S. (eds.): Active Database Systems: Triggers and Rules For Advanced Database Processing. Morgan Kaufmann, San Francisco (1996)Google Scholar
  101. 101.
    Zaniolo, C.: The Nonmonotonic Semantics of Active Rules in Deductive Databases. In: Bry, F., Ramamohanarao, K. (eds.) DOOD 1997. LNCS, vol. 1341, pp. 265–282. Springer, Heidelberg (1997)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Sergio Greco
    • 1
  • Francesca A. Lisi
    • 2
  1. 1.Dipartimento di Elettronica, Informatica e SistemisticaUniversità della CalabriaArcavacata di Rende (CS)Italy
  2. 2.Dipartimento di InformaticaUniversità degli Studi di Bari “Aldo Moro”BariItaly

Personalised recommendations