Extending logic programming

ABSTRACT

An extension of logic programming, called “ordered logic programming”, which includes some abstractions of the object-oriented paradigm, is presented. An ordered program consists of a number of modules (objects), where each module is composed by a number of rules possibly with negated head predicates. A sort of “isa” hierarchy can be defined among the modules in order to allow for rule inheritance. Therefore, every module sees its own rules as local rules and the rules of the other modules to which it is connected by the “isa” hierarchy as global rules. In this way, as local rules may hide global rules, it is possible to deal with default properties and exceptions. This new approach represents a novel attempt to combine the logic paradigm with the object-oriented one in knowledge base systems. Moreover, this approach provides a new ground for explaining some recent proposals of semantics for classical logic programs with negation in the rule bodies and gives an interesting semantics to logic programs with negated rule heads.

REFERENCES

• ABW: K. R. Apt , H. A. Blair , A. Walker, Towards a theory of declarative knowledge, Foundations of deductive databases and logic programming, Morgan Kaufmann Publishers Inc., San Francisco, CA, 1988
• AK: Serge Abiteboul , Paris C. Kanellakis, Object identity as a query language primitive, ACM SIGMOD Record, v.18 n.2, p.159-173, June 1989
• CH: Chandra, A, Hard, D, "Horn Clauses and Generahzatlon", Journal of Logtc Progranmung 2, 1, 1985, pp 320-340
• Cl: Clark, K L, "Negation as Fadure", m Logic and Data Base, (Gallalre and Mmker, eds), Plenum Press, New York, 1978, pp 293-322
• FB: Fltung, M, Ben-Jacob, M, "Stratafied and Threevalued Logic Programming Semantacs", Proc 5th ira Conf and Symp on Logtc Progranmung, MIT Press, Cambndge, Ma, 1988, pp 1054-1068
• GL1: Gelfond, M, Llfsch~tz, V, 'Tne Stable Model Semanucs for Logic Programming", Proc 5th Int Conf and Symp on Logic Progranmung, MIT Press, Cambridge, Ma, 1988, pp 1070-1080
• GL1: Gelfond, M, Llfschltz, V, "Logic Programs with Clasmcal Negalaon", unpubhshed manuscript, September 1989
• K: KIWIs Team, "The speclfieauons of BQM", ESPR1T Techmcal Report, February 1990
• KL: Michael Kifer , Georg Lausen, F-logic: a higher-order language for reasoning about objects, inheritance, and scheme, Proceedings of the 1989 ACM SIGMOD international conference on Management of data, p.134-146, June 1989, Portland, Oregon, United States
• KS: Kowalska, R A, Sadn, F, "Loglc Programs with Exceptmns", unpubhshed manuscnpt, November 1989
• L: J. W. Lloyd, Foundations of logic programming; (2nd extended ed.), Springer-Verlag New York, Inc., New York, NY, 1987
• LV: Laenens, E, Vermelr, D, "A Flxpomt Semanucs for Ordered Logic", Journal of Logic and Computataon, to appear
• N: Naqvl, S A, "A Logic for Negauon m Database Systems," m Foundattons of Deducttve Databases and Logtc Progranunmg, (Mmker, J ed ), Morgan Kaufman, Los Altos, 1987
• P1: Przymusmskl, T C, "On the Semanucs of Straufied Deducuve Databases and Logic Programs", Journal of Automated Reasomng, to appear
• P2: T. C. Przymusinski, On the declarative semantics of deductive databases and logic programs, Foundations of deductive databases and logic programming, Morgan Kaufmann Publishers Inc., San Francisco, CA, 1988
• P3: Przymusmskl, T C, "Well-founded models are mtersecuons of three-valued stable models", unpubhshed manuscript, 1989
• R: Relter, R, "On Closed World Databases", m Logtc and Data Base, (Gallatre and Mmker, eds), Plenum Press, New York, 1978, pp 55-76
• SZ: Domenico Sacca , Carlo Zaniolo, Stable models and non-determinism in logic programs with negation, Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.205-217, April 02-04, 1990, Nashville, Tennessee, United States [doi>10.1145/298514.298572]
• T: Tarskl, A "A Lattace Theoretacal Flxpomt Theorem and its Apphcatlon," Pacific Journal of Mathematics 5, 1955, pp 285-309
• U: Jeffrey D. Ullman, Principles of database and knowledge-base systems, Vol. I, Computer Science Press, Inc., New York, NY, 1988
• VG: Van Gelder, A, "Negation as Fatlure Using Tight Derivations for Logic Programs," Proc 3rd IEEE Syrup on Logic Programming, Sprmger-Verlag, 1986, pp 127-138
• VRS: Allen Van Gelder , Kenneth Ross , John S. Schlipf, Unfounded sets and well-founded semantics for general logic programs, Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.221-230, March 1988, Austin, Texas, United States [doi>10.1145/308386.308444]

INDEX TERMS

Primary Classification:
  F. Theory of Computation
  F.4 MATHEMATICAL LOGIC AND FORMAL LANGUAGES
      F.4.1 Mathematical Logic
          Subjects: Logic and constraint programming

Additional Classification:
  D. Software
  D.1 PROGRAMMING TECHNIQUES
  D.2 SOFTWARE ENGINEERING
      D.2.2 Design Tools and Techniques
          Subjects: Modules and interfaces

  H. Information Systems
  H.2 DATABASE MANAGEMENT

  I. Computing Methodologies
  I.2 ARTIFICIAL INTELLIGENCE
      I.2.4 Knowledge Representation Formalisms and Methods
          Subjects: Representations (procedural and rule-based)

General Terms:
Design, Languages, Verification