Depth-Bounded Boolean Logics (DBBL for short) are well-understood frameworks to model rational agents equipped with limited deductive capabilities. These Logics use a parameter k>=0 to limit the amount of virtual information, i.e., the information that the agent may temporarily assume throughout the deductive process. This restriction brings several advantageous properties over classical Propositional Logic, including polynomial decision procedures for deducibility and refutability. Inspired by DBBL, we propose a limited-depth version of the popular ASP system clingo, tentatively dubbed k-lingo after the bound k on virtual information. We illustrate the connection between DBBL and ASP through examples involving both proof-theoretical and implementative aspects. The paper concludes with some comments on future work, which include a computational complexity characterization of the system, applications to multi-agent systems and feasible approximations of probability functions.
Introducing k-lingo: a k-depth Bounded Version of ASP System Clingo / F.A. D'Asaro, P. Baldi, G. Primiero - In: KR2021 / [a cura di] M. Bienvenu, G. Lakemeyer, E. Erdem. - [s.l] : IJCAI Organization, 2021. - ISBN 978-1-956792-99-7. - pp. 661-665 (( Intervento presentato al 18. convegno International Conference on Principles of Knowledge Representation and Reasoning tenutosi a on line nel 2021 [10.24963/kr.2021/65].
Introducing k-lingo: a k-depth Bounded Version of ASP System Clingo
F.A. D'Asaro
;P. Baldi;G. Primiero
2021
Abstract
Depth-Bounded Boolean Logics (DBBL for short) are well-understood frameworks to model rational agents equipped with limited deductive capabilities. These Logics use a parameter k>=0 to limit the amount of virtual information, i.e., the information that the agent may temporarily assume throughout the deductive process. This restriction brings several advantageous properties over classical Propositional Logic, including polynomial decision procedures for deducibility and refutability. Inspired by DBBL, we propose a limited-depth version of the popular ASP system clingo, tentatively dubbed k-lingo after the bound k on virtual information. We illustrate the connection between DBBL and ASP through examples involving both proof-theoretical and implementative aspects. The paper concludes with some comments on future work, which include a computational complexity characterization of the system, applications to multi-agent systems and feasible approximations of probability functions.File | Dimensione | Formato | |
---|---|---|---|
Introducing k-lingo a k-depth Bounded Version of ASP System Clingo.pdf
accesso aperto
Tipologia:
Publisher's version/PDF
Dimensione
109.54 kB
Formato
Adobe PDF
|
109.54 kB | Adobe PDF | Visualizza/Apri |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.