Ordered Completion for Logic Programs with Aggregates

Authors

  • Vernon Asuncion University of Western Sydney
  • Yan Zhang University of Western Sydney
  • Yi Zhou University of Western Sydney

DOI:

https://doi.org/10.1609/aaai.v26i1.8216

Keywords:

Logic Programming, Aggregates, First-Order Logic, Answer Set Programming

Abstract

In this paper, we show that first-order logic programs with monotone aggregates under the stable model semantics can be captured in classical first-order logic. More precisely, we extend the notion of ordered completion for logic programs with a large variety of aggregates so that every stable model of a program with aggregates corresponds to a classical model of its enhanced ordered completion, and vice versa.

Downloads

Published

2021-09-20

How to Cite

Asuncion, V., Zhang, Y., & Zhou, Y. (2021). Ordered Completion for Logic Programs with Aggregates. Proceedings of the AAAI Conference on Artificial Intelligence, 26(1), 691-697. https://doi.org/10.1609/aaai.v26i1.8216

Issue

Vol. 26 No. 1 (2012): Twenty-Sixth AAAI Conference on Artificial Intelligence

Section

AAAI Technical Track: Knowledge Representation and Reasoning