A Syntactic Approach to Studying Strongly Equivalent Logic Programs

11/09/2020
by   Bin Wang, et al.
0

In the field of Answer Set Programming (ASP), two logic programs are strongly equivalent if they are ordinarily equivalent under any extensions. This property provides a theoretical foundation for studying many aspects of logic programs such as program simplification and transformation etc. Therefore, strong equivalence has been investigated extensively for ASP and its extensions such as LPMLN. In this paper, we present a syntactic approach to studying the strong equivalence of logic programs, which provides several interesting results and would help us understand the strong equivalence from a new perspective. Firstly, we present the notions of independent sets and five kinds of syntactic transformations (S-* transformations) for logic programs. And we investigate the strong equivalence (SE) and non-strong equivalence (NSE) preserving properties of the S-* transformations in the contexts of ASP and LPMLN. Secondly, based on the properties of the S-* transformations, we present a fully automatic algorithm to discover syntactic conditions that preserve strong equivalences (SE-conditions) of ASP and LPMLN programs. To discover the SE-conditions efficiently, we present four kinds of approaches to improve the algorithm. Thirdly, we present a preliminary method to simplify the discovered SE-conditions and report the simplified SE-conditions of several kinds of LPMLN programs. After that, we present a discussion on the discovered SE-conditions and some existing problems. Finally, we present a comparison between SE-conditions discovering approaches in this paper and in the related work.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/18/2019

On the Strong Equivalences of LPMLN Programs

By incorporating the methods of Answer Set Programming (ASP) and Markov ...
research
09/09/2019

On the Strong Equivalences for LPMLN Programs

LPMLN is a powerful knowledge representation and reasoning tool that com...
research
10/12/2011

Discovering Classes of Strongly Equivalent Logic Programs

In this paper we apply computer-aided theorem discovery technique to dis...
research
11/12/2018

Strong Equivalence for Epistemic Logic Programs Made Easy (Extended Version)

Epistemic Logic Programs (ELPs), that is, Answer Set Programming (ASP) e...
research
04/29/2014

An Approach to Forgetting in Disjunctive Logic Programs that Preserves Strong Equivalence

In this paper we investigate forgetting in disjunctive logic programs, w...
research
02/26/2011

Back and Forth Between Rules and SE-Models (Extended Version)

Rules in logic programming encode information about mutual interdependen...
research
07/25/2019

On Uniform Equivalence of Epistemic Logic Programs

Epistemic Logic Programs (ELPs) extend Answer Set Programming (ASP) with...

Please sign up or login with your details

Forgot password? Click here to reset