Infinitely many precomplete relative to parametric expressibility classes of formulas in a provability logic
Închide
Articolul precedent
Articolul urmator
380 3
Ultima descărcare din IBN:
2018-09-07 17:36
SM ISO690:2012
RUSU, Andrei. Infinitely many precomplete relative to parametric expressibility classes of formulas in a provability logic. In: International Conference on Intelligent Information Systems. 22-23 august 2013, Chișinău. Chișinău: "VALINEX" SRL, 2013, pp. 144-147.
EXPORT metadate:
Google Scholar
Crossref
CERIF

DataCite
Dublin Core
International Conference on Intelligent Information Systems 2013
Conferința "International Conference on Intelligent Information Systems"
Chișinău, Moldova, 22-23 august 2013

Infinitely many precomplete relative to parametric expressibility classes of formulas in a provability logic


Pag. 144-147

Rusu Andrei
 
Information Society Development Institute, S.E.
 
Disponibil în IBN: 12 februarie 2018


Rezumat

Artificial Intelligence (AI) systems simulating human behavior are often called intelligent agents. By definition, these intelligent agents exhibit some form of human-like intelligence. Intelligent agents typically represent human cognitive states using underlying beliefs and knowledge modeled in a knowledge representation language, specifically in the context of decision making. In the present paper we investigate some functional properties of the underlying knowledge representation language based on the provability logic.

Cuvinte-cheie
intelligent agents, Provability logic,

modal logic, parametric expressibility of formulas, precomplete classes of formulas)