Discovering Classes of Strongly Equivalent Logic Programs
Abstract
In this paper we apply computer-aided theorem discovery technique to discover theorems about strongly equivalent logic programs under the answer set semantics. Our discovered theorems capture new classes of strongly equivalent logic programs that can lead to new program simplification rules that preserve strong equivalence. Specifically, with the help of computers, we discovered exact conditions that capture the strong equivalence between a rule and the empty set, between two rules, between two rules and one of the two rules, between two rules and another rule, and between three rules and two of the three rules.
Cite
Text
Lin and Chen. "Discovering Classes of Strongly Equivalent Logic Programs." International Joint Conference on Artificial Intelligence, 2005. doi:10.1613/jair.2131Markdown
[Lin and Chen. "Discovering Classes of Strongly Equivalent Logic Programs." International Joint Conference on Artificial Intelligence, 2005.](https://mlanthology.org/ijcai/2005/lin2005ijcai-discovering/) doi:10.1613/jair.2131BibTeX
@inproceedings{lin2005ijcai-discovering,
title = {{Discovering Classes of Strongly Equivalent Logic Programs}},
author = {Lin, Fangzhen and Chen, Yin},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2005},
pages = {516-521},
doi = {10.1613/jair.2131},
url = {https://mlanthology.org/ijcai/2005/lin2005ijcai-discovering/}
}