Work

First-Order Modular Logic Programs and their Conservative Extensions

Year: 2016

Type: preprint

Abstract: Modular logic programs provide a way of viewing logic programs as consisting of many independent, meaningful modules. This paper introduces first-order modular logic programs, which can capture the meaning of many answer set programs. We also introduce conservative extensions of such programs. This concept helps to identify strong relationships between modular programs as well as between traditional programs. We show how the notion of a conservative extension can be used to justify the common projection rewriting. This note is under consideration for publication in Theory and Practice of Logic Programming.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.1608.02681

Authors: Harrison, Amelia, Lierler, Yuliya

Institutions: The University of Texas at Austin, University of Nebraska at Omaha

Language: English

Topic: Logic, Reasoning, and Knowledge

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funder: National Science Foundation

Award: RI: Small: Mathematical Analysis of an Answer Set Programming Language

OpenAlex ID: W2953065078

Cites: 11

Cited by:

Related to: 20