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...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Theory and practice of logic programming Ročník 22; číslo 3; s. 335 - 366
Hlavný autor: LIERLER, YULIYA
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Cambridge Cambridge University Press 01.05.2022
Predmet:
Combinatorial analysis
Declarative programming
Engineers
Equivalence
Knowledge representation
Language
Logic programming
Logic programs
Mathematical programming
Semantics
ISSN:1471-0684, 1475-3081
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1471-0684
1475-3081
DOI:10.1017/S1471068421000545