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.
KR and autonomous agents and multi-agent systems; Logic programming, answer set programming; Uncertainty, vagueness, many-valued and fuzzy logics
Settore M-FIL/02 - Logica e Filosofia della Scienza
Settore INF/01 - Informatica
Settore MAT/01 - Logica Matematica
Dipartimenti di Eccellenza 2018-2022 - Dipartimento di FILOSOFIA
https://proceedings.kr.org/2021/65/
Book Part (author)
File in questo prodotto:
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

Caricamento pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/2434/901310
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? ND
social impact