Translating SUMO-K to Higher-Order Set Theory

05/13/2023
by   Chad Brown, et al.
0

We describe a translation from a fragment of SUMO (SUMO-K) into higher-order set theory. The translation provides a formal semantics for portions of SUMO which are beyond first-order and which have previously only had an informal interpretation. It also for the first time embeds a large common-sense ontology into a very secure interactive theorem proving system. We further extend our previous work in finding contradictions in SUMO from first order constructs to include a portion of SUMO's higher order constructs. Finally, using the translation, we can create problems that can be proven using higher-order interactive and automated theorem provers. This is tested in several systems and can be used to form a corpus of higher-order common-sense reasoning problems.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/18/2019

A Tale of Two Set Theories

We describe the relationship between two versions of Tarski-Grothendieck...
research
03/02/2023

Converting the Suggested Upper Merged Ontology to Typed First-order Form

We describe the translation of the Suggested Upper Merged Ontology (SUMO...
research
05/24/2022

ACL2s Systems Programming

ACL2 provides a systems programming capability that allows one to write ...
research
08/02/2023

Percolation in higher order networks via mapping to chygraphs

Percolation theory investigates systems of interconnected units, their r...
research
03/26/2018

A Common Framework for Natural Gradient and Taylor based Optimisation using Manifold Theory

This technical report constructs a theoretical framework to relate stand...
research
08/15/2018

An infinitary rewriting interpretation of coinductive types

We introduce an infinitary rewriting semantics for strictly positive nes...
research
07/27/2022

Cubic Goldreich-Levin

In this paper, we give a cubic Goldreich-Levin algorithm which makes pol...

Please sign up or login with your details

Forgot password? Click here to reset