Logic programming and its variations are widely used for formal reasoning in various areas of Computer Science, most notably Artificial Intelligence. In this paper we develop a systematic and unifying perspective for (ground) classical, probabilistic, weighted logic programs, based on categorical algebra. Our departure point is a formal distinction between the syntax and the semantics of programs, now regarded as separate categories. Then, we are able to characterise the various variants of logic program as different models for the same syntax category, i.e. structure-preserving functors in the spirit of Lawvere’s functorial semantics. As a first consequence of our approach, we showcase a series of semantic constructs for logic programming pictorially as certain string diagrams in the syntax category. Secondly, we describe the correspondence between probabilistic logic programs and Bayesian networks in terms of the associated models. Our analysis reveals that the correspondence can be phrased in purely syntactical terms, without resorting to the probabilistic domain of interpretation.

Functorial semantics as a unifying perspective on logic programming / Gu T.; Zanasi F.. - ELETTRONICO. - 211:(2021), pp. 17.1-17.22. (Intervento presentato al convegno 9th Conference on Algebra and Coalgebra in Computer Science, CALCO 2021 tenutosi a University of Salzburg, Austria nel August 31–September 3, 2021) [10.4230/LIPIcs.CALCO.2021.17].

Functorial semantics as a unifying perspective on logic programming

Zanasi F.
2021

Abstract

Logic programming and its variations are widely used for formal reasoning in various areas of Computer Science, most notably Artificial Intelligence. In this paper we develop a systematic and unifying perspective for (ground) classical, probabilistic, weighted logic programs, based on categorical algebra. Our departure point is a formal distinction between the syntax and the semantics of programs, now regarded as separate categories. Then, we are able to characterise the various variants of logic program as different models for the same syntax category, i.e. structure-preserving functors in the spirit of Lawvere’s functorial semantics. As a first consequence of our approach, we showcase a series of semantic constructs for logic programming pictorially as certain string diagrams in the syntax category. Secondly, we describe the correspondence between probabilistic logic programs and Bayesian networks in terms of the associated models. Our analysis reveals that the correspondence can be phrased in purely syntactical terms, without resorting to the probabilistic domain of interpretation.
2021
9th Conference on Algebra and Coalgebra in Computer Science (CALCO 2021)
1
22
Functorial semantics as a unifying perspective on logic programming / Gu T.; Zanasi F.. - ELETTRONICO. - 211:(2021), pp. 17.1-17.22. (Intervento presentato al convegno 9th Conference on Algebra and Coalgebra in Computer Science, CALCO 2021 tenutosi a University of Salzburg, Austria nel August 31–September 3, 2021) [10.4230/LIPIcs.CALCO.2021.17].
Gu T.; Zanasi F.
File in questo prodotto:
File Dimensione Formato  
LIPIcs-CALCO-2021-17.pdf

accesso aperto

Tipo: Versione (PDF) editoriale
Licenza: Licenza per Accesso Aperto. Creative Commons Attribuzione (CCBY)
Dimensione 970.12 kB
Formato Adobe PDF
970.12 kB Adobe PDF Visualizza/Apri

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: https://hdl.handle.net/11585/904574
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? ND
social impact