Articolul precedent |
Articolul urmator |
739 4 |
Ultima descărcare din IBN: 2023-09-10 08:23 |
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 | ||||||
|
||||||
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) |
||||||
|
Cerif XML Export
<?xml version='1.0' encoding='utf-8'?> <CERIF xmlns='urn:xmlns:org:eurocris:cerif-1.5-1' xsi:schemaLocation='urn:xmlns:org:eurocris:cerif-1.5-1 http://www.eurocris.org/Uploads/Web%20pages/CERIF-1.5/CERIF_1.5_1.xsd' xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' release='1.5' date='2012-10-07' sourceDatabase='Output Profile'> <cfResPubl> <cfResPublId>ibn-ResPubl-59154</cfResPublId> <cfResPublDate>2013</cfResPublDate> <cfStartPage>144</cfStartPage> <cfISBN></cfISBN> <cfURI>https://ibn.idsi.md/ro/vizualizare_articol/59154</cfURI> <cfTitle cfLangCode='EN' cfTrans='o'>Infinitely many precomplete relative to parametric expressibility classes of formulas in a provability logic</cfTitle> <cfKeyw cfLangCode='EN' cfTrans='o'>intelligent agents; modal logic; Provability logic; parametric expressibility of formulas; precomplete classes of formulas)</cfKeyw> <cfAbstr cfLangCode='EN' cfTrans='o'><p>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.</p></cfAbstr> <cfResPubl_Class> <cfClassId>eda2d9e9-34c5-11e1-b86c-0800200c9a66</cfClassId> <cfClassSchemeId>759af938-34ae-11e1-b86c-0800200c9a66</cfClassSchemeId> <cfStartDate>2013T24:00:00</cfStartDate> </cfResPubl_Class> <cfResPubl_Class> <cfClassId>e601872f-4b7e-4d88-929f-7df027b226c9</cfClassId> <cfClassSchemeId>40e90e2f-446d-460a-98e5-5dce57550c48</cfClassSchemeId> <cfStartDate>2013T24:00:00</cfStartDate> </cfResPubl_Class> <cfPers_ResPubl> <cfPersId>ibn-person-32760</cfPersId> <cfClassId>49815870-1cfe-11e1-8bc2-0800200c9a66</cfClassId> <cfClassSchemeId>b7135ad0-1d00-11e1-8bc2-0800200c9a66</cfClassSchemeId> <cfStartDate>2013T24:00:00</cfStartDate> </cfPers_ResPubl> </cfResPubl> <cfPers> <cfPersId>ibn-Pers-32760</cfPersId> <cfPersName_Pers> <cfPersNameId>ibn-PersName-32760-3</cfPersNameId> <cfClassId>55f90543-d631-42eb-8d47-d8d9266cbb26</cfClassId> <cfClassSchemeId>7375609d-cfa6-45ce-a803-75de69abe21f</cfClassSchemeId> <cfStartDate>2013T24:00:00</cfStartDate> <cfFamilyNames>Rusu</cfFamilyNames> <cfFirstNames>Andrei</cfFirstNames> </cfPersName_Pers> </cfPers> </CERIF>