Discovering Classes of Strongly Equivalent Logic Programs

Lin, Fangzhen; Chen, Yin

Discovering Classes of Strongly Equivalent Logic Programs

Download BibTeX Cite

Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence. Pages 516-520.

Abstract

We report on a successful experiment of computeraided theorem discovery in the area of logic programming with answer set semantics. Specifically, with the help of computers, we discovered exact conditions that capture the strong equivalence between a set of a rule and the empty set, a set of a rule and another set of a rule, a set S of two rules and a subset of S with one rule, a set of two rules and a set of another rule, and a set S of three rules and a subset of S with two rules. We prove some general theorems that can help us verify the correctness of these conditions, and discuss the usefulness of our results in program simplification.

Fangzhen Lin, and Yin Chen. 2005. Discovering Classes of Strongly Equivalent Logic Programs. In Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, IJCAI-05. IJCAI, 516–520. https://ijcai.org/proceedings/2005/51

@inproceedings{ijcai2005p51,
  title     = {Discovering Classes of Strongly Equivalent Logic Programs},
  author    = {Lin, Fangzhen and Chen, Yin},
  booktitle = {Proceedings of the Nineteenth International Joint Conference on
               Artificial Intelligence, {IJCAI-05}},
  publisher = {International Joint Conferences on Artificial Intelligence},
  pages     = {516--520},
  year      = {2005},
  url       = {https://ijcai.org/proceedings/2005/51},
}

TY  - CPAPER
TI  - Discovering Classes of Strongly Equivalent Logic Programs
AU  - Lin, Fangzhen
AU  - Chen, Yin
T2  - Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, IJCAI-05
PB  - International Joint Conferences on Artificial Intelligence
PY  - 2005
SP  - 516
EP  - 520
UR  - https://ijcai.org/proceedings/2005/51
ER  -