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

Answer set programming is a prominent declarative programming paradigm used in formulating combinatorial search problems and implementing different knowledge representation formalisms. Frequently, several related and yet substantially different answer set programs exist for a given problem. Sometime...

Full description

Saved in:
Bibliographic Details
Published in:Theory and practice of logic programming Vol. 22; no. 3; pp. 335 - 366
Main Author: LIERLER, YULIYA
Format: Journal Article
Language:English
Published: Cambridge Cambridge University Press 01.05.2022
Subjects:
Combinatorial analysis
Declarative programming
Engineers
Equivalence
Knowledge representation
Language
Logic programming
Logic programs
Mathematical programming
Semantics
ISSN:1471-0684, 1475-3081
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Answer set programming is a prominent declarative programming paradigm used in formulating combinatorial search problems and implementing different knowledge representation formalisms. Frequently, 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 presents formal results carefully relating a number of interesting program rewritings. It also provides the proof of correctness of system projector concerned with automatic program rewritings for the sake of efficiency.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1471-0684
1475-3081
DOI:10.1017/S1471068421000545