Pedro Cabalar, Jorge Fandinno, Luis Fariñas del Cerro, David Pearce
TL;DR本文提出了一种基于可计算函数的Answer Set Programming(ASP)变体,通过intensional sets的应用,扩展了集合对象的应用,提供了全逻辑处理聚合的能力,并且给出了含义明确、可组合的聚合语义。
Abstract
In this paper, we propose a variant of answer set programming (ASP) with evaluable functions that extends their application to sets of objects, something that allows a fully logical treatment of →