SELP – a system for studying strong equivalence between logic programs

Authors:
Yin Chen;Fangzhen Lin;Lei Li
Affiliations:
Department of Computer Science, South China Normal University, China;Department of Computer Science, Hong Kong University of Science and Technology, Kowloon, Hong Kong;Software Institute, Sun Yat-sen University, China
Venue:
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
Year:
2005

Citing 2
Cited 7

Strongly equivalent logic programs

ACM Transactions on Computational Logic (TOCL) - Special issue devoted to Robert A. Kowalski
Discovering classes of strongly equivalent logic programs

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence

Strongly Equivalent Temporal Logic Programs

JELIA '08 Proceedings of the 11th European conference on Logics in Artificial Intelligence
Testing Relativised Uniform Equivalence under Answer-Set Projection in the System cc T

Applications of Declarative Programming and Knowledge Management
ccT on Stage: Generalised Uniform Equivalence Testing for Verifying Student Assignment Solutions

LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Facts do not cease to exist because they are ignored: relativised uniform equivalence with answer-set projection

AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Discovering classes of strongly equivalent logic programs

Journal of Artificial Intelligence Research
Characterising equilibrium logic and nested logic programs: Reductions and complexity1,2

Theory and Practice of Logic Programming
cc⊤: a correspondence-checking tool for logic programs under the answer-set semantics

JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes a system called SELP for studying strong equivalence in answer set logic programming. The basic function of the system is to check if two given ground disjunctive logic programs are equivalent, and if not, return a counter-example. We have used the system to discover some interesting theorems about strong equivalence [Lin and Chen, 2005]. Here we briefly describe how the system can be used to find out whether a given set of rules is strongly equivalent to another, perhaps simpler set of rules.