The DOI matches its Crossref record; 46 of the 46 references it cites were found in a registry or an index.
Logical foundations of object-oriented and frame-based languages
Open accessAbstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
(1979) · Cited by 43,841
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
A FRAMEWORK FOR REPRESENTING KNOWLEDGE
Minsky, M. (1988) · Readings in Cognitive Science · doi:10.1016/b978-1-4832-1446-7.50018-2 · Cited by 4,536
(1988) · Cited by 3,452
A Mathematical Introduction to Logic
(2001) · Elsevier eBooks · doi:10.1016/c2009-0-22107-6 · Cited by 2,387
Clocksin, W. F., & Mellish, C. (1984) · Springer eBooks · doi:10.1007/978-3-642-55481-0 · Cited by 2,047
The well-founded semantics for general logic programs
Van Gelder, A., Ross, K. A., & Schlipf, J. S. (1991) · Journal of the ACM · doi:10.1145/116825.116838 · Cited by 1,652
Foundations of logic programming; (2nd extended ed.)
Lloyd, J. W. (1987) · Springer eBooks · Cited by 1,501
Symbolic Logic and Mechanical Theorem Proving
(1973) · Elsevier eBooks · doi:10.1016/c2009-0-22103-9 · Cited by 1,468
(1988) · Computer Science Press, Inc. eBooks · Cited by 1,435
The functional data model and the data languages DAPLEX
Shipman, D. W. (1981) · ACM Transactions on Database Systems · doi:10.1145/319540.319561 · Cited by 913
The role of frame-based representation in reasoning
Fikes, R., & Kehler, T. (1985) · Communications of the ACM · doi:10.1145/4284.4285 · Cited by 823
Object-oriented programming: Themes and variations
Stefik, M., & Bobrow, D. G. (1986) · doi:10.1609/aimag.v6i4.508 · Cited by 744
A semantics of multiple inheritance
Cardelli, L. (1988) · Information and Computation · doi:10.1016/0890-5401(88)90007-7 · Cited by 624
The mathematics of inheritance systems
Touretzky, D. S. (1984) · CERN Document Server (European Organization for Nuclear Research) · Cited by 590
Khoshafian, S. N., & Copeland, G. P. (1986) · ACM SIGPLAN Notices · doi:10.1145/960112.28739 · Cited by 472
OLD resolution with tabulation
Tamaki, H., & Sato, T. (1986) · Lecture Notes in Computer Science · doi:10.1007/3-540-16492-8_66 · Cited by 374
The alternating fixpoint of logic programs with negation
Van Gelder, A. (1989) · Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems · doi:10.1145/73721.73722 · Cited by 369
Object identity as a query language primitive
Abiteboul, S., & Kanellakis, P. C. (1989) · ACM SIGMOD Record · doi:10.1145/66926.66941 · Cited by 362
F-logic: a higher-order language for reasoning about objects, inheritance, and scheme
Kifer, M., & Lausen, G. (1989) · ACM SIGMOD Record · doi:10.1145/66926.66939 · Cited by 356
Self-citationA logical language for data and knowledge bases
(1989) · Choice Reviews Online · doi:10.5860/choice.27-0349 · Cited by 351
Some high level language constructs for data of type relation
Schmidt, J. W. (1977) · ACM Transactions on Database Systems · doi:10.1145/320557.320568 · Cited by 338
HiLog: A foundation for higher-order logic programming
Chen, W., Kifer, M., & Warren, D. S. (1993) · The Journal of Logic Programming · doi:10.1016/0743-1066(93)90039-j · Cited by 332
Self-citationA clash of intuitions: the current state of nonmonotonic multiple inheritance systems
Touretzky, D. S., Horty, J. F., & Thomason, R. H. (1987) · Cited by 270
A skeptical theory of inheritance in nonmonotonic semantic networks
Horty, J. F., Thomason, R. H., & Touretzky, D. S. (1990) · Artificial Intelligence · doi:10.1016/0004-3702(90)90057-7 · Cited by 243
A logical analysis of modules in logic programming
Miller, D. (1989) · The Journal of Logic Programming · doi:10.1016/0743-1066(89)90031-9 · Cited by 233
Warren, D. S. (1992) · Communications of the ACM · doi:10.1145/131295.131299 · Cited by 229
Computational approaches to analogical reasoning
Hall, R. P. (1989) · Artificial Intelligence · doi:10.1016/0004-3702(89)90003-9 · Cited by 223
Every logic program has a natural stratification and an iterated least fixed point model
Przymusinski, T. C. (1989) · Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems · doi:10.1145/73721.73723 · Cited by 201
On inheritance hierarchies with exceptions
Etherington, D. W., & Reiter, R. (1983) · Cited by 183
First Order Theories of Individual Concepts and Propositions.Preprint
McCarthy, J. (1979) · CogPrints (University of Southampton) · Cited by 181
ILOG : Declarative creation and manipulation of object identifiers (extended abstract)
Hull, R. B., & Yoshikawa, M. (1990) · Cited by 156
An overview of transaction logic
Bonner, A. J., & Kifer, M. (1994) · Theoretical Computer Science · doi:10.1016/0304-3975(94)90190-2 · Cited by 148
Self-citationTowards a Theory of Types in Prolog.
Mishra, P. (1984) · SLP · Cited by 115
A Linear Format for Resolution With Merging and a New Technique for Establishing Completeness
Anderson, R. B., & Bledsoe, W. W. (1970) · Journal of the ACM · doi:10.1145/321592.321603 · Cited by 97
Kolaitis, P. G., & Papadimitriou, C. H. (1988) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/308386.308446 · Cited by 94
The power of languages for the manipulation of complex values
Abiteboul, S., & Beeri, C. (1995) · The VLDB Journal · doi:10.1007/bf01354881 · Cited by 94
Database theory—past and future
Ullman, J. D. (1987) · Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems · doi:10.1145/28659.28660 · Cited by 89
Abiteboul, S., Lausen, G., Uphoff, H., & Waller, E. (1993) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/170035.170044 · Cited by 78
Self-citationBAROQUE: a browser for relational databases
Motro, A. (1986) · ACM Transactions on Information Systems · doi:10.1145/6168.6172 · Cited by 63
Foundations of Logic Programming
Caferra, R. (2011) · doi:10.1002/9781118604182.ch6 · Cited by 62
A logic for programming with complex objects
Kifer, M., & Wu, J. C. (1993) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(93)90021-n · Cited by 51
Self-citation(2018) · doi:10.1109/emceurope.2018.8485141 · Cited by 29
A type system for logic programs
Yardeni, E., & Shapiro, E. Y. (1988) · Cited by 28
A theory of nonmonotonic inheritance based on annotated logic
Thirunarayan, K., & Kifer, M. (1993) · Artificial Intelligence · doi:10.1016/0004-3702(93)90033-8 · Cited by 27
Self-citationA first-order theory of types and polymorphism in logic programming
Kifer, M., & Wu, J. C. (2002) · ACM/IEEE Symposium on Logic in Computer Science (LICS) · doi:10.1109/lics.1991.151655 · Cited by 16
Self-citation
Cited by
Knowledge engineering: Principles and methods
Studer, R., Benjamins, V. R., & Fensel, D. (1998) · Data & Knowledge Engineering · doi:10.1016/s0169-023x(97)00056-6 · Cited by 3,686
EXPERT SYSTEMS WITH APPLICATIONS
(2005) · Expert Systems with Applications · doi:10.1016/j.eswa.2004.10.010 · Cited by 1,656
Fensel, D., Facca, F. M., Simperl, E., & Toma, I. (2011) · Semantic Web Services · doi:10.1007/978-3-642-19193-0_7 · Cited by 1,095
Complexity and expressive power of logic programming
Dantsin, E., Eiter, T., Gottlob, G., & Voronkov, A. (2001) · ACM Computing Surveys · doi:10.1145/502807.502810 · Cited by 739
Methodologies, tools and languages for building ontologies. Where is their meeting point?
Corcho, O., Fernández-López, M., & Gómez-Pérez, A. (2003) · Data & Knowledge Engineering · doi:10.1016/s0169-023x(02)00195-7 · Cited by 713
Metadata
- Authors
- Kifer, M., Lausen, G., & Wu, J.
- Venue
- Journal of the ACM
- Published
- 1995-07
- Volume
- 42
- Issue
- 4
- Pages
- 741-843
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W2084130127
- Cited by
- 1,450
- References
- 46
- FWCI
- 67.50
- Type
- journal article
- Language
- en
- Open access
- hybrid
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.