Articolul precedent |
Articolul urmator |
686 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) |
||||||
|
DataCite XML Export
<?xml version='1.0' encoding='utf-8'?> <resource xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' xmlns='http://datacite.org/schema/kernel-3' xsi:schemaLocation='http://datacite.org/schema/kernel-3 http://schema.datacite.org/meta/kernel-3/metadata.xsd'> <creators> <creator> <creatorName>Rusu, A.G.</creatorName> <affiliation>Institutul de Dezvoltare a Societăţii Informaţionale, Î.S., Moldova, Republica</affiliation> </creator> </creators> <titles> <title xml:lang='en'>Infinitely many precomplete relative to parametric expressibility classes of formulas in a provability logic</title> </titles> <publisher>Instrumentul Bibliometric National</publisher> <publicationYear>2013</publicationYear> <relatedIdentifier relatedIdentifierType='ISBN' relationType='IsPartOf'></relatedIdentifier> <subjects> <subject>intelligent agents</subject> <subject>modal logic</subject> <subject>Provability logic</subject> <subject>parametric expressibility of formulas</subject> <subject>precomplete classes of formulas)</subject> </subjects> <dates> <date dateType='Issued'>2013</date> </dates> <resourceType resourceTypeGeneral='Text'>Conference Paper</resourceType> <descriptions> <description xml:lang='en' descriptionType='Abstract'><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></description> </descriptions> <formats> <format>application/pdf</format> </formats> </resource>