Strong Equivalence and Program's Structure in Arguing Essential Equivalence between Logic Programs

01/26/2019
by   Yuliya Lierler, et al.
0

Answer set programming is a prominent declarative programming paradigm used in formulating combinatorial search problems and implementing distinct knowledge representation formalisms. It is common that several related and yet substantially different answer set programs exist for a given problem. Sometimes these encodings may display significantly different performance. Uncovering precise formal links between these programs is often important and yet far from trivial. This paper claims the correctness of a number of interesting program rewritings.

READ FULL TEXT
research
03/29/2023

System Predictor: Grounding Size Estimator for Logic Programs under Answer Set Semantics

Answer set programming is a declarative logic programming paradigm geare...
research
09/18/2019

Strong Equivalence for LPMLN Programs

LPMLN is a probabilistic extension of answer set programs with the weigh...
research
09/21/2018

onlineSPARC: a Programming Environment for Answer Set Programming

Recent progress in logic programming (e.g., the development of the Answe...
research
10/06/2015

Disjunctive Answer Set Solvers via Templates

Answer set programming is a declarative programming paradigm oriented to...
research
05/16/2022

Strong Equivalence of Logic Programs with Counting

In answer set programming, two groups of rules are considered strongly e...
research
08/17/2022

On Establishing Robust Consistency in Answer Set Programs

Answer set programs used in real-world applications often require that t...
research
09/05/2020

Computer Program Decomposition and Dynamic/Behavioral Modeling

Decomposition, statically dividing a program into multiple units, is a c...

Please sign up or login with your details

Forgot password? Click here to reset