A Set Theoretic Approach for Knowledge Representation: the Representation Part

03/11/2016
by   Yi Zhou, et al.
0

In this paper, we propose a set theoretic approach for knowledge representation. While the syntax of an application domain is captured by set theoretic constructs including individuals, concepts and operators, knowledge is formalized by equality assertions. We first present a primitive form that uses minimal assumed knowledge and constructs. Then, assuming naive set theory, we extend it by definitions, which are special kinds of knowledge. Interestingly, we show that the primitive form is expressive enough to define logic operators, not only propositional connectives but also quantifiers.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/12/2017

From First-Order Logic to Assertional Logic

First-Order Logic (FOL) is widely regarded as one of the most important ...
research
04/16/2020

On Reductions of Hintikka Sets for Higher-Order Logic

Steen's (2018) Hintikka set properties for Church's type theory based on...
research
05/12/2020

MathZero, The Classification Problem, and Set-Theoretic Type Theory

AlphaZero learns to play go, chess and shogi at a superhuman level throu...
research
08/28/1998

Set-Theoretic Completeness for Epistemic and Conditional Logic

The standard approach to logic in the literature in philosophy and mathe...
research
07/17/2019

Shallow Embedding of Type Theory is Morally Correct

There are multiple ways to formalise the metatheory of type theory. For ...
research
05/29/2019

An Algorithm for Computing Invariant Projectors in Representations of Wreath Products

We describe an algorithm for computing the complete set of primitive ort...
research
07/09/2019

Handling localisation in rely/guarantee concurrency: An algebraic approach

The rely/guarantee approach of Jones extends Hoare logic with rely and g...

Please sign up or login with your details

Forgot password? Click here to reset