2026-07-22T06:37:45Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:3625 2024-03-06T10:34:26Z ddc:004 open_access

Reconciling Well-Founded Semantics of DL-Programs and Aggregate Programs You, Jia-Huai Morris, John Bi, Yi Well-founded semantics description logic programs aggregate logic programs three-valued logic. Logic programs with aggregates and description logic programs (dl-programs) are two recent extensions to logic programming. In this paper, we study the relationships between these two classes of logic programs, under the well-founded semantics. The main result is that, under a satisfaction-preserving mapping from dl-atoms to aggregates, the well-founded semantics of dl-programs by Eiter et al., coincides with the well-founded semantics of aggregate programs, defined by Pelov et al. as the least fixpoint of a 3-valued immediate consequence operator under the ultimate approximating aggregate. This result enables an alternative definition of the same well-founded semantics for aggregate programs, in terms of the first principle of unfounded sets. Furthermore, the result can be applied, in a uniform manner, to define the well-founded semantics for dl-programs with aggregates, which agrees with the existing semantics when either dl-atoms or aggregates are absent. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Jia-Huai You and John Morris and Yi Bi 2012 Is Part Of LIPIcs, Volume 17, Technical Communications of the 28th International Conference on Logic Programming (ICLP'12) (2012) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.ICLP.2012.235 urn:nbn:de:0030-drops-36258 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICLP.2012.235 eng https://creativecommons.org/licenses/by-nd/3.0/legalcode