Michael Kifer
Skip Abstract Section
Abstract
We propose a novel formalism, called Frame Logic (abbr., F-logic), that accounts in a clean and declarative fashion for most of the structural aspects of object-oriented and frame-based languages. These features include object identity, complex objects, inheritance, polymorphic types, query methods, encapsulation, and others. In a sense, F-logic stands in the same relationship to the object-oriented paradigm as classical predicate calculus stands to relational programming. F-logic has a model-theoretic semantics and a sound and complete resolution-based proof theory. A small number of fundamental concepts that come from object-oriented programming have direct representation in F-logic; other, secondary aspects of this paradigm are easily modeled as well. The paper also discusses semantic issues pertaining to programming with a deductive object-oriented language based on a subset of F-logic.
- ~ABITEBOUL, S., AND BEEm, C. On the power of languages for manipulation of complex objects. ~I/LDB J., to appear. Google Scholar
- ~ABITEBOUL, S., AND GRUMBAC}I, S. 1987. COL: A logic-based language for complex objects. In ~Workshop oft Database Programming La~lgt~age,s, (Roscoff, France, Sept.). pp. 253-276.Google Scholar
- ~ABITEBOUL, S., .AND KA. NELLAKIS, P. C. 1989, Object identity as a que~ language pnmmve. In ~Proceedings of the 1989 ACM S1GMOD International Conference on Management of Data ~Portland, Ore., May 31 June 2). ACM, New York, pp. 159 173. Google Scholar
- ~ABITEBOUL, S., LAUSEN, G., UPHOFF, H., AND WALLER, E. 1993. Methods and rules. In Proceed- ~ings oj~ the 1993 ACM SIGMOD Internatio~lal Conferellce on Management of Data, (Washington, ~D.C., May 26-28). ACM, New York, pp. 32 41. Google Scholar
- ~ABiTEBOUL, S., AND ViANU, V. 1988. Procedural and declaratwe database update languages. In ~Proceedmgs of the 7th ACM SIGACT SIGMOD-SIGART Sympostu,z on Princtple~ of Database ~Syst~',zs (Austin, Tex., Mar. 21-23). ACM, New York, pp. 240-250. Google Scholar
- ~A'iT-KACL H. 1986. an algebraic semantics approach to the effective resolunon of type equa ~tions. Theoret. Cornpttt. Sol. 45, 293 351. Google Scholar
- ~A'iT-KAcI, H., AND NASR, R. 1986. LOGIN: h logic programming language with built-in ~inheritance. J. Logic Prog. 3, 185-215 Google Scholar
- ~AJiT-KAc1, H., AND PODELSK1, A. 1993. Towards a meaning of LIFE. J. Logzc Prog. i6 (Aug.), ~195-234.Google Scholar
- ~ANDERSON, R., AND BLEDSOE, W. W. 1970. A linear format resolution with merging and a new ~technique for establishing completeness. J. ACM 17, 3 (July), 525-534. Google Scholar
- ~ATKINSON, M., BANCILHON, F., DEWITT, D., DITTRICH, K., MA1ER, D., AND ZDONIK, S. 1989. The ~object-oriented database system manifeslLo. In International Conference on Deductice and ~Object-Oriented Databases (DOOD). North Holland, Amsterdam, The Netherlands, pp. 40-57.Google Scholar
- ~BALABAN, M. 1986. The generalized concept formalism--A frames and logic based representa- ~tion model. In Proceedings of the Canadial~ Artificial Intelligence Conference. pp. 215 219.Google Scholar
- ~BALABAN, M., AND STRACK, S. 1988. LOGSTER--A relational, object-oriented system for ~knowledge representation. In hltemationa/ Symposium on Methodologies for h~telhgent Systems ~(ISMIS). North Holland, Amsterdam, The Netherlands, pp. 210 219.Google Scholar
- ~BANC1LHON, F. 1988. Object-oriented database systems. In Proceedings of the 7th ACM ~SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (Austin, Tex., Mar. ~21 23). ACM, New York, pp. 152-162. Google Scholar
- ~BANCILHON, F., AND KHOSHAFIAN, S. N. 1989. A calculus of complex objects. J. Comput. Syst. ~Sci. 38, 2 (Apr.), 326-340.Google Scholar
- ~BANERJEE, J., riM, W., AND riM, K. C. 1988. Queries in object-oriented databases. In Proceed- ~rags of the 4th hztenzattonal Conference on Data Engineering, Los Angeles, Calif., (Feb.). IEEE, ~New York, pp. 31-39. Google Scholar
- ~BEEm, C. 1989. Formal models for object-oriented databases. In hztemational Conference on ~Deductwe and Object-Oriented Databases (DOOD). Elsevier Science Publishers, Amsterdam, ~The Netherlands, pp. 370 395.Google Scholar
- ~BEERI, C., NAQVI, S., SHMUELI, O., AND TSUR, S. 1987. Sets and negation in a logic database ~language (LDL). Tech. rep. MCC, Austin, Tex.Google Scholar
- ~BEEm, C., NASR, R., AND TSUR, S. 1988. Embedding C-terms in a horn-clause logic language. In ~Proceedings of the 3rd hltel?zationaI Conference on Data and Knowledge Bases: Improvh~g Usabthty ~and Responsweness, Morgan-Kaufmann, San Mateo, Calif., pp. 374-359.Google Scholar
- ~BEERI, C., AND RAMAKRISHNAN, R. 1991. ,On the power of magic. J. Loglc Prog. 10, (Apr.), ~255-300. Google Scholar
- ~BERSTEIN, P. A., DAYAL, U., DEWITT, D. J., GAWLICK, D., GRAY, J., JARKE, M., LINDSAY, B. G., ~LOCKEMANN, P. C., MAIER, D., NEUHOLD, E. J., REUTER, A., ROWE, L. A., SCHEK, H. J., ~SCHMIDT, J. W., SCHREFL, M., AND STONEBREAKER, M. 1989. Future directions in DBMS ~research (The Laguna Beach report). SIGMOD Record 18, 1 (Mar.), 17-26.Google Scholar
- ~BLAIR, H. A., AND SUBRAHMANIAN, V. S. 1989. Paraconsistent logic programming. Theoret. ~Comput. Sci. 68, 135-154. Google Scholar
- ~BONNER, A. J., AND KIFER, M. 1995. Transaction logic programming (or a logic of declarative ~and procedural knowledge). Tech. Rep. CSRI-323. Univ. Toronto, Toronto, Ont., Canada, Apr. ~1995. Available in csri-technieal-reports/323/report.ps by anonymous ftp to csri.toronto.edu.Google Scholar
- ~BONNER, A. J., AND KIFER, M. 1993. Transaction logic programming. In Proceedings of the ~hltemational Conference on Logic Programming (ICLP) (Budapest, Hungary). June. MIT Press, ~Cambridge, Mass., pp. 251-282. Google Scholar
- ~BONNER, m. J., AND KIFER, M. 1994. An ow',rview of transaction logic. Theoret. Comput. Sci. 133 ~(Oct.), 205-265. Google Scholar
- ~BRASS, S., AND LIPECK, U. W. 1991. Semantics of inheritance in logical object specifications. In ~Proceedings of the h~ternationaI Conference on Deductit'e and Object-Oriented Databases ( DOOD) ~(Dec.). Springer-Verlag, New York, pp. 411 430.Google Scholar
- ~BREWKA, G. 1987. The logic of inheritance in frame systems. In Proceedings of the International ~Joint Conference on Artificial Dztelligence (IJC,4I). Morgan-Kaufmann, San Mateo, Calif., pp. ~483-488.Google Scholar
- ~BUGLIESI, M., AND JAMIL, H. M. 1994. A logic for encapsulation in object-oriented languages. In ~Proceedings of the 6th h~temational Symposium on Programming Language Implementation and ~Logic Programming (Madrid, Spain, Sept.). Lecture Notes in Computer Science, Springer-Verlag, ~New York, pp. 215-229. Google Scholar
- ~BUNEMAN, P., AND FRANKEL, R. E. i979. FQL A functional query language. In Proceedings of ~the 1979 ACM SIGMOD b, ternational Conference on Management of Data (Boston, Mass., May ~30-June 1). ACM, New York, pp. 52-58. Google Scholar
- ~BUNEMAN, P., AND OHORI, h. 1991. Using powerdomains to generalize relational databases. ~Theoret. Comput. Sci., 91, 1, 23-55. Google Scholar
- ~CARDELLI, L. 1988. A semantics of multiple inheritance. Inf. Comput. 76, 2 (Feb.), 138 164. Google Scholar
- ~CARE:', M., DFWITT, D., AND VANDERBERG, S. 1988. A data model and query language for ~EXODUS. In Proceedings of the 1988 ACM S1GMOD International Conference on Management ~of Data (Chicago, II1., June 1-3). ACM, New York, pp. 413-423. Google Scholar
- ~CHANG, C. L., AND LEE, R. C. T. 1973. Symbolic Logic and Mechanical Theorem Proving. ~Academic Press, Orlando, Fla. Google Scholar
- ~CHEN, W. 1987. A theory of modules based on second-order logic. In Proceedings of the IEEE ~Symposium on Logic Programming (SLP) (Sept.) IEEE, New York, pp. 24-33.Google Scholar
- ~CHEN, W., AND KIFER, M. 1993. Polymorphic types m higher-order logic programming. Tech. ~Rep. 93/20. Dept. Computer Science, SUNY at Stony Brook, Stony Brook, N.Y., Dee.Google Scholar
- ~CHEN, W., KIFER, M., AND WARREN, D. S. 1993. HiLog: A foundation for higher-order logic ~programming. J. Logic Prog. 15, 3 (Feb.), 187-230. Google Scholar
- ~CHEN, W., AND WARREN, D. S. 1989. C-logic for complex objects. In Proceedings of the 8th ACM ~SIGACT-SIGMOD-S1GART Symposium on Principles of Database Systems (Philadelphia, Pa., ~Mar. 29 31). ACM, New York, pp. 369-378. Google Scholar
- ~CLOCKSIN, W. F., AND MELLISH, C. S. 1981. Programming m Prolog. Spnnger-Verlag, New York. Google Scholar
- ~COOK, W. R., HILL, W. L., AND CANNING, P. S. }900. Inheritance is not subtyping. In Proceedings ~of the 17th A CM Symposium on Print lples of Programming Languages (San Francisco, Calif., Jan. ~17-19). ACM, New York, pp. 125-136. Google Scholar
- ~DIETRICH, S. W. 1987. Extension tables: Memo relations m logic programming. In Procee&ngsof ~the IEEE Sytnpo,stum on Logic Programming (SLP) (Sept.). IEEE, New York, pp. 264-273.Google Scholar
- ~DOBmE, G., ANO TOPOR, R. 1905. On the declarative and procedural semantics of deductive ~object-oriented systems. J. Int. Inf. Syst. 4 (Feb.) 193-219. Google Scholar
- ~ENDERTON, H. U. 1972. A Mathematicalbztrodaetton to Logic. Academic Press, Orlando, FlaGoogle Scholar
- ~ETHERINGTON, D. W., AND RIETER, R. 1983. On inheritance hierarchies with exceptions. In ~Proceedings of the National Conference on ArtlJ~ezal Intelhgence (AAAI) (Washington, D.C.). ~AAAI Press, Menlo Park, Calif. pp. 104-108.Google Scholar
- ~FIKES, R., AND KEHLER, T. 1985. the role of frame-based representation in reasoning. Commun. ~ACM 28, 9 (Sept.), 904-920. Google Scholar
- ~FROHN, J. LAUSEN, G., AND UPHOFF, H. 1994. Access to objects by path expressions and rules. ~In Proceedings of the bztemational Conference on Very Large Data Bases (VLDB) (Santiago, ~Chile). Morgan-Kaufmann, San Mateo, Calif., pp. 273-284. Google Scholar
- ~GAREY, M. R., AND JOHNSON, D S. 1978. Computers and Dztractablhiy' A Guide to the TheoO, of ~NP-Completeness. Freeman and Company, San Francisco, Calif. Google Scholar
- ~GEFFNER, H., AND VERMA, r. 1989. Inheritance - chaining + defeat. In Proceedings of the ~International Symposltmt on Methodologies for bztelllgent Systems ( ISMIS ). pp. 411-418.Google Scholar
- ~OELFOND, M., AND LIFSCHITZ, V. 1988. The stable model semantics for logic programming. In ~Logic Programming: Proceedings of the 5th Conference and Symposium. pp. 1070 1080.Google Scholar
- ~HALL, R. P. 1989. Computational dpproaches to analogical reasoning: A comparative study. ~Anif. Int. 30, 39-120. Google Scholar
- ~HAYES, P. J. 1979. The logic for frames. In Frame Conception and Text Understanding. D. ~Metzmg, ed. Walter de Gruyter and Co., pp. 46 61.Google Scholar
- ~HILL. P., AND TOPOR, R. 1992. A semantics for typed logic programs. In Types in Logic ~Programming. F. Pfenning, ed. The MIT Press, Cambridge, Mass., pp. 1-62.Google Scholar
- ~HORTY, J. F., THOMASON, R. H., AND TOURETZKY, D. S. 1987. A skeptical theory, of inheritance ~in nonmonotomc semantic nets. In Proceedings of the National Conference on Artificial Intelli- ~gence (,4AA1). AAAI Press, Menlo Park, Calif., pp. 358-363.Google Scholar
- ~HULL, R, AND YOSHIKAWA, M. 1990. ILOG: Declarative creation and mampulatlon of object ~identifiers. In Procee&ngs of the bztematlonal Con)erence on Ve(y Large Data Bases (VLDB) ~(Brisbane, Australia). Morgan-Kaufmann, San Mateo, Cahf., pp 455-468. Google Scholar
- ~KESIM, F. N., AND SERGOT, M. 1992. On the evolution of objects in a logic programming ~framework. In Proceedings of the International Conference on 5th Generation Computer &,stems ~(Tokyo, Japan, June). North-Holland, Amsterdam, The Netherlands, pp. 1052-1060.Google Scholar
- ~KHOSHAFIAN, S. N., AND COPELAND, a. P. 1986. Object identity. In Proceedings o} the Interna- ~tional Conference on ObJect-Oriented Programming Systems and Languages ( OOPSLA ) (Portland, ~Ore., Sept. 29-Oct 2). ACM, New York, pp. 406-416. Google Scholar
- ~KIFER, M., KIM, W., AND SAGIV, Y. 1992. Querying object-oriented databases, in Proceedings of ~the ACM SIGMOD Conference on Management of Data (San Diego, Calif., June 2-5). ACM, ~New York, pp. 393 402. Google Scholar
- ~KIFER, M., AND LAUSEN, G. 1989. F-logic: A higher-order language for reasoning about objects, ~inheritance, and schema. In Proceedings of the } 989 A CM SIGMOD Internatlonal Conference on ~Management of Data (Portland, Ore., May 31 June 2) ACM, New York, pp. 134 146. Google Scholar
- ~KIFER, M., AND LOZINSKII, E. L. 1992. A logic for reasoning with inconsistency. J. Alttom. Reas. ~9, 2 (Nov.), 179-215. Google Scholar
- ~KIFER, M., AND SUBRAHMANIAN, V. S. 1992. Theory of generalized annotated logic programming ~and its applications. J. Logtc Prog. 12, 4 (Apr.), 335-368. Google Scholar
- ~KIFER, M., AND WU, J. 1989. A logic for object-oriented logic programming (Maier's O-logic: ~Revisited). In Proceedings of the 8th ACM S1GACT-SIGMOD-SIGART Sympostum on Principles ~of Database Systems (Philadelphia, Pa., Mar. 29-31). ACM, New York, pp. 379-393. Google Scholar
- ~KIFER, M., AND WU, J. 1990/1991. A first-order theory of types and polymorphism in logic ~programming. In Proceedings of the Symposium on Logic in Computer Science ( LICS) (Amster- ~dam, The Netherlands, July) pp. 310-321, July 1991. (Expanded version: TR 90/23 under the ~same title, Department of Computer Science, University at Stony Brook, Stony Brook, N.Y., ~July 1990.)Google Scholar
- ~K1FER, M., AND WU, J. 1993. A logic for programming with complex objects. J. Comput. Syst. Sci. ~47, 1 (Aug.), 77-120. Google Scholar
- ~KIM, W., BANERJEE, J., CHOU, H-T., GARZA, J. F., AND WOELK, D. 1987. Composite object ~support in an object-oriented database system. In Proceedings of the bzternational Conference on ~Object-Oriented Programming Systenzs and Languages (OOPSLA) (Orlando, Fla., Oct. 4 8), ~ACM. New York, pp. 118-125. Google Scholar
- ~KOLAITIS, P. G., AND PAPADtMITRIOU, C. H. 1988. Why not negation by fixpoint. In Proceedings ~of the 7th ACM S1GACT-SIGMOD-SIGART Symposium on Principles of Database Systems ~(Austin, Tex., Mar. 21-23). ACM, New York, pp. 231-239. Google Scholar
- ~KRISHNAMURTttY, R., AND NAQV1, S. 1988. Towards a real horn clause language. In Proceedings ~of tile International Conference on Very Lathe Data Bases (VLDB). Morgan-Kaufmann, San ~Marco, Calif., pp. 252-263. Google Scholar
- ~KRISHNAPRASAD, T., KIFER, M., AND WARREN, D. S. 1989a. On the circumscriptive semantics of ~inheritance networks. In Proceedings of the International Symposium on Methodologles for ~Intelligence Systems. North-Holland, Amsterdam, The Netherlands, pp. 448-457.Google Scholar
- ~KRISHNAPRASAD, T., KIFER, M., AND WARREN, D. S. 1989b. On the declarative semantics of ~nheritance networks. In Proceednzgs of the International Jotnt Conference on Artificial Intelligence ~(1JCAI). pp. 1099-1103.Google Scholar
- ~KUPER, G. M. 1987. An extension of LPS to arbitrary sets. Tech. rep. IBM, Yorktown Heights, ~New York.Google Scholar
- ~KUPER, G. M. 1990. Logic programming with sets. J. Comput. Syst. Sci. 41, 1 (Aug.), 44-64. Google Scholar
- ~KUPER, G., AND VARDI, M. Y. 1984. A new approach to database logic. In Proceedings of the 3rd ~ACM SIGACT-SIGMOD 3);rnposium on Principles of Database Systems (Waterloo, Ont., Canada, ~Apr. 2-4). ACM, New York, pp. 86-96. Google Scholar
- ~LAENENS, E., SACCA, D., AND VERMEm, D. 1990. Extending logic programming. In Proceedings of ~the 1990 ACM SIGMOD hlternational Col,!ference on Management of Data (Atlantic City, N.J., ~May 23-25). ACM, New York, pp. 184-193. Google Scholar
- ~LAENENS, E., AND VERMEIR, D. 1990. A fixpoint semantics for ordered logic. J. Logic Comput. 1, ~2, 159-185.Google Scholar
- ~LECLUSE, C., AND RICHARD, P. 1989. The c', database programming language. In Proceedings of ~the International Conference on Very Large Data Bases (Aug.). Morgan-Kaufmann, San Mateo, ~Calif., pp. 411-422. Google Scholar
- ~LLOYD, J. W. 1987. Foundations of Logic Programming (Second Edition). Springer-Vertag, New ~York. Google Scholar
- ~MAIER, D. 1986. A logic for objects. In 14/brkshop on Foundauons of Deductive Databases and ~Logzc Programmmg (Washington, D.C., Aug.) pp. 6-26.Google Scholar
- ~MAmR, D. 1987. Why database languages are a bad idea (position paper). In Proceedings of the ~Workshop on Database Programming Languages (Roscoff, France, Sept.).Google Scholar
- ~MAmR, D. 1989. Why isn't there an object-oriented data model? Tech. rep., Oregon Graduate ~Center, OGI, Beaverton, Ore., May.Google Scholar
- ~MCCABE, F. G. 1992. Logic and Objects. Prentice-Hall International, London, England. Google Scholar
- ~MCCARTHY, J. 1979. First-order theories of individual concepts and propositions. In Machine ~Intelligence, Vol. 9, J. E. Hayes and D. Michie, eds. Edinburgh University Press, Edinburgh, ~Scotland, pp. 129 147.Google Scholar
- ~MEYER, B. 1988. Object-Oriented So}bvare Constn~ction. Prentice-Hall, Englewood Cliffs, N.J. Google Scholar
- ~MmLER, D. 1989. A logical analysis of modules in logic programming. J. Logic Prog. 6, 79-108. Google Scholar
- ~MINSKY, M. 1981. A framework for representing knowledge. In Mind Design, J. Haugeland, ed. ~MIT Press, Cambridge, Mass., pp. 95 128.Google Scholar
- ~MISHRA, P. 1984. Towards a theory of types in Prolog. In Plvceedings of the IEEE Symposium on ~Logic Programming (SLP). 1EEE, New York, pp. 289-298.Google Scholar
- ~MITCHELL, J. C. 1990. Toward a typed foundation for method specialization and inheritance. In ~Proceedings of the 17th ACM Svnzpostum on Pnnctples of Programrnmg Languages (San Francisco, ~Calif. Jan. 17 19). ACM, New York, pp. 109-124. Google Scholar
- ~MORRIS, K., NAUGHTON, J., SARAIYA, Y., ULLMAN, J., AND VAN GELDER, A. 1989. YAWN! (Yet ~another window on NAIL!). IEEE Database Engineering 6, 221-226.Google Scholar
- ~MOTRO, A. 1986. BAROQUE: A browser for relational databases. ACM Trans. Office Inf. Syst. ~4, 2, 164 181. Google Scholar
- ~NAQVI, S., AND TSUR, S. 1989. A Logical Language for Data amt Knowledge Bases. Computer ~Science Press, Rockville, Md. Google Scholar
- ~PHiPPS, G., DERR, M. A., AND ROSS, K. A. 1991. Glue-Nail: A deductwe database system. In ~Proceedings of the 1991 ACM SIGMOD bltemational Conference on Management of Data ~(Denver, Colo., May 29-31). ACM, New York, pp. 308-317. Google Scholar
- ~PP, ZYMUSINSKA, H., AND GELFOND, M. 1989. Inheritance hierarchies and autoeplstemic logic. In ~Proceedings of the hlternational Symposium on Methodologies for Intelligent Systems. North-Hol- ~land, Amsterdam, The Netherlands, pp. 919-929.Google Scholar
- ~PRZYMUSINSK1, T. C. 1988. On the declarative semantics of deductive databases and logic ~programs. In Foundations of DeductiL,e Databases' and Logic Programming, J. Minker, ed. ~Morgan-Kaufmann, San Mateo, Calif., pp. 193-216. Google Scholar
- ~PRZYMUSlNSKI. T. C. 1980. Every logic program has a natural stratification and an iterated least ~fixed point model. In Proceedings of the 8th ACM SIGACT-SIGMOD-SIGART Symposium on ~Principles oi' Database Systems (Philadelphia, Pa., Mar. 29-31). ACM, New York, pp. 11-21. Google Scholar
- ~RAMAKRISHNAN, R. 1988. Magic Templates. A spellbinding approach to logic programs. In ~Proceedings of the IEEE Symposium on Logic Programming. IEEE, New York, pp. 140-159.Google Scholar
- ~ROSS, K. 1992. Relations with relation names as argument: Algebra and calculus. In Proceedings ~of the 11th ACM SIGACT-SIGMOD-SIGART Sympostum on Pnnclples of Database Systems (San ~Diego, Calif., June 2-4). ACM, New York, pp. 346-353. Google Scholar
- ~ROTH, M. A., KORTH, H. F., AND BATORY, D. S. 1987. SQL/NF: A query language for ~ 1NF ~relational databases. Inf. Syst. 12, 1, 99-114. Google Scholar
- ~SCHMIDT, J. W. 1977. Some high-level language constructs for data of type relation. ACM Trans. ~Datab. Svst. 2, 3 (Sept.), 247-261. Google Scholar
- ~SHIPMAN, m. W. 1981. The functional data model and the data language DAPLEX. ACM Trans. ~Datab. Syst. 140-173. Google Scholar
- ~STEFIK, M., AND BOBROW, D. a. 1986. Object-oriented programming: Themes and variations. AI ~Mag. (Jan.), 40-62. Google Scholar
- ~STROUSTRUP, B. 1986. The C ++ Programming Language. Addison-Wesley, Reading, Mass. Google Scholar
- ~TAMAKI, H., AND SATO, T. 1986. OLD resolution with tabulation. In Proceedings of the Interna-tional Conference on Logic Programming (ICLP). MIT Press, Cambridge, Mass., pp. 84-98. Google Scholar
- ~THIRUNARAYAN, K., AND KiFER, M. 1993. A theory of nonmonotonic inheritance based on ~annotated logic. Arttf. Int. 60, 1, (Mar.), 23 50. Google Scholar
- TOURETZK~, D. S. 1986. The Mathematics of Inheritance. Morgan-Kaufmann, San Mateo, Calif. Google Scholar
- TOURETZKY, D. S., HORTY, J. F., AND THOMASON, R. H. 1987. A clash of intuitions: The current ~state of nonmonotomc multiple inheritance systems. In Proceedmgs of the International Joint ~Conference on Artificial Intelligence (1JCAI ). pp. 476-482.Google Scholar
- ULLMAN, J. D. 1987. Database theory Past and future. In Proceedings of the 6th ACM ~S{GACT-S1GMOD-SIGART Symposium on Prtnciples of Database Systems (San Diego, Calif., ~Mar. 23-25). ACM, New York, pp. 1-10. Google Scholar
- ULLN{&N= J. F. 1988. Principles of Database and Knowledse Base Syster~zs, vol. 1. Computer ~Science Press, Rockville, Md. Google Scholar
- VAN GELDER, A. 1989. The alternating fixpoint of logic programs with negation. In Proceedings ~of the 8th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems ~(Philadelphia, Pa., Mar. 29-31). ACM, New York, pp. 1-10. Google Scholar
- VAN GELDER, A., ROSS, K. A., AND SCHLIPF, J. S. I991. The well-founded semantics for general ~logic programs. J. ACM 38, 3, 620-650. Google Scholar
- WARREN, D. S. 1992. Memoing for logic programming. Commun. ACM, 35, 3 (Mar.) 93-111. Google Scholar
- WEGNER, P. 1987. The obJect-oriented classification paradigm. In Research Directions in ObJect- ~Oriented Programming, B. Shnver and P. Wegner, eds. MIT Press, Cambridge, Mass, pp. ~479-560. Google Scholar
- Wu, J. 1992. A theory of types and polymorphism in logic programming. Ph.D. dissertation, ~SUNY at Stony Brook, Stony Brook, N.Y. Google Scholar
- Xu, J. 1989. A theory, of types and type inference in logic programming languages. Ph.D. ~dissertation, SUNY at Stony Brook, Stony Brook, N.Y. Google Scholar
- YARDENI, E., FRUEIfW1RTH, T., AND SHAPIRO, E. 1991. Polymorphically typed logic programs. In ~Proceedings of the International Conference on Logic Programming ( ICLP ) (Paris, France, June). ~MIT Press, Cambridge, Mass., pp. 379-398.Google Scholar
- YARDEN1, E., AND SHAPIRO, E. 1987. A type system for logic programs. In Concurrent Prolog, vol. ~2, E. Shapiro, ed. MIT Press, Cambridge, Mass. Google Scholar
- ZANIOLO, C. 1983. The database language GEM. In Proceedings of the 1983 ACM SIGMOD ~Cbnference on Management of Data, (San Jose, Calif., May 23-26), ACM, New York, pp. ~207-214. Google Scholar
- ZANIOLO, C., A'I{T-KAc1, m., BEECtt, D., CAMMARATA, S., KERSCHBERG, L., AND MAIER, D. 1985. ~Object-oriented database and knowledge systems. Tech. Rep. DB-038-85, MCC, Austin, Tex.Google Scholar
Index Terms
- Logical foundations of object-oriented and frame-based languages
Recommendations
Completeness and Cut-elimination in the Intuitionistic Theory of Types
In this paper we define a model theory and give a semantic proof of cut-elimination for ICTT, an intuitionistic formulation of Church's theory of types defined by Miller et al. and the basis for the λProlog programming language. Our approach, extending ...
Object logic integration: A multiparadigm design methodology and a programming language
In the past decade, there has been much research effort dedicated to combine the object-oriented programming paradigm and the logic programming paradigm. Most of this effort sheds light upon the philosophy of multiparadigm programming as a near ideal ...
Reviews
Claudio Delrieux
In recent years, “object-oriented programming” (OOP) has become a catch-phrase among researchers in programming languages and implementors of software development tools. OOP is loosely defined as a paradigm, and diverse elements, such as typing, algebraic specification, encapsulation, inheritance, message passing, polymorphism, and many others, are claimed to be the salient features of the paradigm. Some maintain, however, that this inclusiveness arises from a lack of clear semantics, which can be traced to an inherent lack of formal foundations. Others find it fruitful to combine OOP with other formalisms, like relational frameworks and deductive databases (see Chen et al. [1]) or typed lambda-calculus (see Cardelli and Wegner [2]). The authors address many of these issues, and propose a formalism called frame logic (F-logic) that they claim achieves the primary objectives of OOP, that is, the goals listed above. F-logic is also suitable for defining, querying, and manipulating database schemas . It has a model-theoretic semantics and a sound and complete proof theory. It is also well suited to frame-based language applications. The paper begins with a discussion of the relationship between OOP and relational programming. An informal example of F-logic is introduced to illustrate some of the main features before giving a formal account of them. Syntax and semantics of F-logic are then described, and various semantic properties of the logic are also discussed. Next, the authors develop a proof theory that is sound and complete with respect to the semantics of the logic. The expressive power of the logic is then demonstrated in a number of examples. This work provides a survey of relevant research results in OOP, query languages, and databases, and will interest programming language developers and database management designers.
Access critical reviews of Computing literature here
Become a reviewer for Computing Reviews.
Comments