Articolul precedent |
Articolul urmator |
689 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) |
||||||
|
Crossref XML Export
<?xml version='1.0' encoding='utf-8'?> <doi_batch version='4.3.7' xmlns='http://www.crossref.org/schema/4.3.7' xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' xsi:schemaLocation='http://www.crossref.org/schema/4.3.7 http://www.crossref.org/schema/deposit/crossref4.3.7.xsd'> <head> <doi_batch_id>ibn-59154</doi_batch_id> <timestamp>1714193059</timestamp> <depositor> <depositor_name>Information Society Development Instiute, Republic of Moldova</depositor_name> <email_address>idsi@asm.md</email_address> </depositor> </head> <body> <collection> <collection_metadata> <full_title>International Conference on Intelligent Information Systems</full_title> </collection_metadata> <collection_issue> <publication_date media_type='print'> <year>2013</year> </publication_date> </collection_issue> <collection_article publication_type='full_text'><titles> <title>Infinitely many precomplete relative to parametric expressibility classes of formulas in a provability logic</title> </titles> <contributors> <person_name sequence='first' contributor_role='author'> <given_name>Andrei</given_name> <surname>Rusu</surname> </person_name> </contributors> <publication_date media_type='print'> <year>2013</year> </publication_date> <pages> <first_page>144</first_page> <last_page>147</last_page> </pages> </collection_article> </collection> </body> </doi_batch>