ML Anthology

First-Order Modular Logic Programs and Their Conservative Extensions (Extended Abstract)

Amelia Harrison, Yuliya Lierler
IJCAI 2017 pp. 4859-4863
doi:10.24963/IJCAI.2017/682 /ijcai/2017/harrison2017ijcai-first/

Abstract

This paper introduces first-order modular logic programs, which provide a way of viewing answer set programs as consisting of many independent, meaningful modules. We also present conservative extensions of such programs. This concept helps to identify strong relationships between modular programs as well as between traditional programs. For example, we illustrate how the notion of a conservative extension can be used to justify the common projection rewriting. This is a short version of a paper was presented at the 32nd International Conference on Logic Programming (Harrison and Lierler, 2016).

PDF IJCAI Semantic Scholar

Cite

Text

Harrison and Lierler. "First-Order Modular Logic Programs and Their Conservative Extensions (Extended Abstract)." International Joint Conference on Artificial Intelligence, 2017. doi:10.24963/IJCAI.2017/682

Markdown

[Harrison and Lierler. "First-Order Modular Logic Programs and Their Conservative Extensions (Extended Abstract)." International Joint Conference on Artificial Intelligence, 2017.](https://mlanthology.org/ijcai/2017/harrison2017ijcai-first/) doi:10.24963/IJCAI.2017/682

BibTeX

@inproceedings{harrison2017ijcai-first,
  title     = {{First-Order Modular Logic Programs and Their Conservative Extensions (Extended Abstract)}},
  author    = {Harrison, Amelia and Lierler, Yuliya},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2017},
  pages     = {4859-4863},
  doi       = {10.24963/IJCAI.2017/682},
  url       = {https://mlanthology.org/ijcai/2017/harrison2017ijcai-first/}
}