HOME

TheInfoList



OR:

F-logic (Frame logic) is a
knowledge representation Knowledge representation (KR) aims to model information in a structured manner to formally represent it as knowledge in knowledge-based systems whereas knowledge representation and reasoning (KRR, KR&R, or KR²) also aims to understand, reason, and ...
and
ontology language In computer science and artificial intelligence, ontology languages are formal languages used to construct ontologies. They allow the encoding of knowledge about specific domains and often include reasoning rules that support the processing of ...
. It combines the advantages of conceptual modeling with
object-oriented Object-oriented programming (OOP) is a programming paradigm based on the concept of '' objects''. Objects can contain data (called fields, attributes or properties) and have actions they can perform (called procedures or methods and impleme ...
,
frame A frame is often a structural system that supports other components of a physical construction and/or steel frame that limits the construction's extent. Frame and FRAME may also refer to: Physical objects In building construction *Framing (con ...
-based languages, and offers a declarative, compact and simple
syntax In linguistics, syntax ( ) is the study of how words and morphemes combine to form larger units such as phrases and sentences. Central concerns of syntax include word order, grammatical relations, hierarchical sentence structure (constituenc ...
, and the well-defined semantics of a
logic programming Logic programming is a programming, database and knowledge representation paradigm based on formal logic. A logic program is a set of sentences in logical form, representing knowledge about some problem domain. Computation is performed by applyin ...
language. Features include, among others, object identity, complex objects,
inheritance Inheritance is the practice of receiving private property, titles, debts, entitlements, privileges, rights, and obligations upon the death of an individual. The rules of inheritance differ among societies and have changed over time. Offi ...
, polymorphism, query methods, encapsulation. F-logic stands in the same relationship to
object-oriented programming Object-oriented programming (OOP) is a programming paradigm based on the concept of '' objects''. Objects can contain data (called fields, attributes or properties) and have actions they can perform (called procedures or methods and impl ...
as classical
relational calculus The relational calculus consists of two calculi, the tuple relational calculus and the domain relational calculus, that is part of the relational model for databases and provide a declarative way to specify database queries. The raison d'être ...
stands to
relational database A relational database (RDB) is a database based on the relational model of data, as proposed by E. F. Codd in 1970. A Relational Database Management System (RDBMS) is a type of database management system that stores data in a structured for ...
programming.


Overview

F-logic was developed by Michael Kifer at
Stony Brook University Stony Brook University (SBU), officially the State University of New York at Stony Brook, is a public university, public research university in Stony Brook, New York, United States, on Long Island. Along with the University at Buffalo, it is on ...
and Georg Lausen at the
University of Mannheim The University of Mannheim (German: ''Universität Mannheim''), abbreviated UMA, is a public university, public research university in Mannheim, Baden-Württemberg, Germany. Founded in 1967, the university has its origins in the ''Palatine Aca ...
. F-logic was originally developed for deductive databases, but is now used most often for semantic technologies, especially the
semantic web The Semantic Web, sometimes known as Web 3.0, is an extension of the World Wide Web through standards set by the World Wide Web Consortium (W3C). The goal of the Semantic Web is to make Internet data machine-readable. To enable the encoding o ...
. F-logic is considered as one of the formalisms for
ontologies In information science, an ontology encompasses a representation, formal naming, and definitions of the categories, properties, and relations between the concepts, data, or entities that pertain to one, many, or all domains of discourse. More ...
, but
description logic Description logics (DL) are a family of formal knowledge representation languages. Many DLs are more expressive than propositional logic but less expressive than first-order logic. In contrast to the latter, the core reasoning problems for DLs are ...
(DL) is more popular and accepted, as is the DL-based
Web Ontology Language The Web Ontology Language (OWL) is a family of Knowledge representation and reasoning, knowledge representation languages for authoring Ontology (information science), ontologies. Ontologies are a formal way to describe Taxonomy, taxonomies and ...
(OWL). A development environment for F-logic was developed in the NeOn project and is also used in a range of applications for information integration,
question answering Question answering (QA) is a computer science discipline within the fields of information retrieval and natural language processing (NLP) that is concerned with building systems that automatically answer questions that are posed by humans in a n ...
and
semantic search Semantic search denotes search with meaning, as distinguished from lexical search where the search engine looks for literal matches of the query words or variants of them, without understanding the overall meaning of the query. Semantic search seek ...
. Before version 4 of Protégé ontology editor, F-Logic is supported as one of the two kinds of ontology. The frame syntax of the
Rule Interchange Format The Rule Interchange Format (RIF) is a W3C Recommendation. RIF is part of the infrastructure for the semantic web, along with (principally) SPARQL, RDF and OWL. Although originally envisioned by many as a "rules layer" for the semantic web, in r ...
Basic Logic Dialect (RIF BLD) standardized by the
World Wide Web Consortium The World Wide Web Consortium (W3C) is the main international standards organization for the World Wide Web. Founded in 1994 by Tim Berners-Lee, the consortium is made up of member organizations that maintain full-time staff working together in ...
is based on F-logic; RIF BLD however omits non-monotonic reasoning features of F-logic. In contrast to
description logic Description logics (DL) are a family of formal knowledge representation languages. Many DLs are more expressive than propositional logic but less expressive than first-order logic. In contrast to the latter, the core reasoning problems for DLs are ...
based ontology formalism, the semantics of F-logic are normally that of a
closed world assumption The closed-world assumption (CWA), in a formal system of logic used for knowledge representation, is the presumption that a statement that is true is also known to be true. Therefore, conversely, what is not currently known to be true, is false. T ...
in contrast to DL's
open world assumption The closed-world assumption (CWA), in a formal system of logic used for knowledge representation, is the presumption that a statement that is true is also known to be true. Therefore, conversely, what is not currently known to be true, is false. T ...
. Also, F-logic is generally undecidable, whereas the SHOIN description logic that
Web Ontology Language The Web Ontology Language (OWL) is a family of Knowledge representation and reasoning, knowledge representation languages for authoring Ontology (information science), ontologies. Ontologies are a formal way to describe Taxonomy, taxonomies and ...
(OWL) DL is based on is decidable. However, it is possible to represent more expressive statements in F-logic than are possible with description logics. The most comprehensive description of F-logic was published in 1995. The preliminary paper from 1989 won the 1999 Test of Time Award from ACM
SIGMOD SIGMOD is the Association for Computing Machinery's Special Interest Group on Management of Data, which specializes in large-scale data management problems and databases. The annual ACM SIGMOD Conference, which began in 1975, is considered one of ...
. A follow-up paper from 1992 won the 2002 Test of Time Award from ACM SIGMOD.


F-logic syntax

Classes and individuals may be defined in F-logic as follows: man::person. woman::person. brad:man. angelina:woman. This states, that "men and women are persons" and that "Brad is a man", and "Angelina is a woman". Statements about classes and individuals may be made as follows: person asSon=>man brad asSon-> married(brad,angelina). This defines that "the son of a person is a man", "Maddox and Pax are the sons of Brad" and "Brad and Angelina are married". In addition it is possible to represent axioms in F-logic in the following manner: These mean "X is a man if X is a person but not a woman" and "if X is the son of Y then X is a person and Y is the father of X". (Note: the latter inference is not factual, because in addition to fathers, sons also have mothers. The gender of X is determined by the premise, but the gender of Y is not.) The
Flora-2 Flora-2 is an open source semantic rule-based system for knowledge representation and reasoning. The language of the system is derived from F-logic, HiLog, W. Chen, M. Kifer and D.S. Warren (1993)''HiLog: A Foundation for Higher-Order Logic Program ...
system introduced a number of changes to the syntax of F-logic, making it more suitable for a knowledge representation and reasoning system as opposed to just a theoretical logic. In particular, variables became prefixed with a ?-mark, the distinction between functional and multi-valued properties was dropped and replaced by cardinality constraints, plus other important changes. For instance, the above pair of sentences look like this in Flora-2: Here is default negation ("naf" stands for
Negation as failure Negation as failure (NAF, for short) is a non-monotonic inference rule in logic programming, used to derive \mathrm~p (i.e. that p is assumed not to hold) from failure to derive p. Note that \mathrm ~p can be different from the statement \neg p o ...
, based on the
well-founded semantics In computer science, the well-founded semantics is a three-valued semantics for logic programming, which gives a precise meaning to general logic programs. History The well-founded semantics was defined by Van Gelder, et al. in 1988. The Prolog ...
); Flora-2 also supports so-called explicit negation, which is closer to negation in classical logic.


F-logic based languages

*
Flora-2 Flora-2 is an open source semantic rule-based system for knowledge representation and reasoning. The language of the system is derived from F-logic, HiLog, W. Chen, M. Kifer and D.S. Warren (1993)''HiLog: A Foundation for Higher-Order Logic Program ...
is an extension of F-logic with
HiLog HiLog is a programming logic with higher-order syntax, which allows arbitrary terms to appear in predicate and function positions. However, the model theory of HiLog is first-order. Although syntactically HiLog strictly extends first order logic, Hi ...
,
transaction logic Transaction Logic is an extension of predicate logic that accounts in a clean and declarative way for the phenomenon of state changes in logic programs and databases. This extension adds connectives specifically designed for combining simple action ...
, and
defeasible reasoning In philosophy of logic, defeasible reasoning is a kind of provisional reasoning that is rationally compelling, though not deductively valid. It usually occurs when a rule is given, but there may be specific exceptions to the rule, or subclasse ...
.
Ergo
is a commercial system based on F-logic, which extends Flora-2.
PathLP
is a full logic programming language based on F-logic.

is a C++ — based implementation
Web Services Modeling Language (WSML)

Semantic Web Services Language (SWSL)
* ObjectLogic language is based on F-logic; OntoStudio is an ObjectLogic implementation by semafora systems GmbH (formerly Ontoprise GmbH). * OO-logic is a successor of F-logic; SemReasoner and Ontology Management System (OSM) are implementations of OO-logic by adesso SE.


References

{{Automated reasoning Knowledge representation Semantic Web Logic programming languages Declarative programming languages