paper-with-me

홈 › Papers

Strong-AI Autoepistemic Robots Build on Intensional First Order Logic

2022-12-14 · Zoran Majkic

Neuro-symbolic AI attempts to integrate neural and symbolic architectures in a manner that addresses strengths and weaknesses of each, in a complementary fashion, in order to support robust strong AI capable of reasoning, learning, and cognitive modeling. In this paper we consider the intensional First Order Logic (IFOL) as a symbolic architecture of modern robots, able to use natural languages to communicate with humans and to reason about their own knowledge with self-reference and abstraction language property. We intend to obtain the grounding of robot's language by experience of how it uses its neuronal architectures and hence by associating this experience with the mining (sense) of non-defined language concepts (particulars/individuals and universals) in PRP (Properties/Relations/Propositions) theory of IFOL.\\ We consider the robot's four-levels knowledge structure: The syntax level of particular natural language (Italian, French, etc..), two universal language levels: its semantic logic structure (based on virtual predicates of FOL and logic connectives), and its corresponding conceptual PRP structure level which universally represents the composite mining of FOL formulae grounded on the last robot's neuro-system level. Finally, we provide the general method how to implement in IFOL (by using the abstracted terms) different kinds of modal logic operators and their deductive axioms: we present a particular example of robots autoepistemic deduction capabilities by introduction of the special temporal $Konow$ predicate and deductive axioms for it: reflexive, positive introspection and distributive axiom.

📄 PDF Abstract BibTeX arXiv:2212.07935

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Recursive Aggregates as Intensional Functions in Answer Set Programming: Semantics and Strong Equivalence

2024-12-14 · Jorge Fandinno, Zachary Hansen

This paper shows that the semantics of programs with aggregates implemented by the solvers clingo and dlv can be characterized as extended First-Order formulas with intensional functions in the logic of Here-and-There. F…

Implementing Default and Autoepistemic Logics via the Logic of GK

2014-05-05 · Jianmin Ji, Hannes Strass

The logic of knowledge and justified assumptions, also known as logic of grounded knowledge (GK), was proposed by Lin and Shoham as a general logic for nonmonotonic reasoning. To date, it has been used to embed in it def…

Translation

Monads for hyperintensionality? A situation semantics for hyperintensional side effects

2019-05-01 · WS 2019 5 · Luke Burke

We outline a hyperintensional situation semantics in which hyperintensionality is modelled as a {`}side effect{'}, as this term has been understood in natural language semantics and in functional programming. We use mona…

Pearce's Characterisation in an Epistemic Domain

2025-02-13 · Ezgi Iraz Su

Answer-set programming (ASP) is a successful problem-solving approach in logic-based AI. In ASP, problems are represented as declarative logic programs, and solutions are identified through their answer sets. Equilibrium…

Hyperintensional Reasoning based on Natural Language Knowledge Base

2019-06-18 · Marie Duží, Aleš Horák

The success of automated reasoning techniques over large natural-language texts heavily relies on a fine-grained analysis of natural language assumptions. While there is a common agreement that the analysis should be hyp…