A coalgebraic approach to unification semantics of logic programming

Autor:	Roberto Bruni, Giorgio Mossa, Ugo Montanari
Jazyk:	angličtina
Rok vydání:	2019
Předmět:	Bisimulation TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES Unification Programming language Computer science TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS Coalgebra Predicate (mathematical logic) Logic program computer.software_genre computer Logic programming
Zdroj:	The Art of Modelling Computational Systems: A Journey from Logic and Concurrency to Security and Privacy ISBN: 9783030311742 The Art of Modelling Computational Systems
Popis:	In the version of logic programming (LP) based on interpretations where variables occur in atoms, a goal reduction via unification can be seen as a transition labelled by the most general unifier. Categorically, it is thus natural to model a logic program as a coalgebra. In the paper we represent: (i) goals as the substitutive monoid freely generated by the predicate symbols; (ii) the LTS as the structured coalgebra defined by the SOS rules implicit in the LP semantics; (iii) the bisimulation semantics of a logic program as its image on the final coalgebra.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c71738a97cc0ebd865a46bcebab9dfe1 http://hdl.handle.net/11568/1029374 Zobrazit plný text záznamu