Applying Visible Strong Equivalence in Answer-Set Program Transformations

DOI10.1145/3412854zbMath1502.68059OpenAlexW1539274708MaRDI QIDQ5034221

Tomi Janhunen, Jori Bomanson, Ilkka Niemelä

Publication date: 24 February 2022

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3412854

zbMATH Keywords

normalizationprogram transformationsstable modelsstrong equivalenceauxiliary atomshidden atoms

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Logic programming (68N17)

Related Items (1)

Efficient computation of answer sets via SAT modulo acyclicity and vertex elimination

This page was built for publication: Applying Visible Strong Equivalence in Answer-Set Program Transformations