| Articolul precedent |
| Articolul urmator |
 |
 678 4 |
| Ultima descărcare din IBN: 2023-09-10 08:23 |
 SM ISO690:2012RUSU, 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 | ||||||
|
||||||
| Pag. 144-147 | ||||||
|
||||||
 Descarcă PDF |
||||||
| 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, modal logic, Provability logic, parametric expressibility of formulas, precomplete classes of formulas) |
||||||
|
|
|
|
