Discovering classes of strongly equivalent logic programs

Authors:
Fangzhen Lin;Yin Chen
Affiliations:
Department of Computer Science and Engineering, Hong Kong University of Science and Technology, Kowloon, Hong Kong;Department of Computer Science, South China Normal University, Guangzhou, P.R. China
Venue:
Journal of Artificial Intelligence Research
Year:
2007

Citing 9
Cited 11

Strongly equivalent logic programs

ACM Transactions on Computational Logic (TOCL) - Special issue devoted to Robert A. Kowalski
Logic programs with stable model semantics as a constraint programming paradigm

Annals of Mathematics and Artificial Intelligence
Equivalence in Answer Set Programming

LOPSTR '01 Selected papers from the 11th International Workshop on Logic Based Program Synthesis and Transformation
Reconstructing the Evolutionary History of Indo-European Languages Using Answer Set Programming

PADL '03 Proceedings of the 5th International Symposium on Practical Aspects of Declarative Languages
Strong equivalence made easy: nested expressions and weight constraints

Theory and Practice of Logic Programming
ASSAT: computing answer sets of a logic program by SAT solvers

Artificial Intelligence - Special issue on nonmonotonic reasoning
Comparisons and computation of well-founded semantics for disjunctive logic programs

ACM Transactions on Computational Logic (TOCL)
The DLV system for knowledge representation and reasoning

ACM Transactions on Computational Logic (TOCL)
SELP – a system for studying strong equivalence between logic programs

LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning

Equivalences in Answer-Set Programming by Countermodels in the Logic of Here-and-There

ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Hyperequivalence of logic programs with respect to supported models

Annals of Mathematics and Artificial Intelligence
Computing Loops with at Most One External Support Rule for Disjunctive Logic Programs

ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Sound and complete inference rules for SE-consequence

Journal of Artificial Intelligence Research
Discovering theorems in game theory: two-person games with unique pure nash equilibrium payoffs

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
dl2asp: implementing default logic via answer set programming

JELIA'10 Proceedings of the 12th European conference on Logics in artificial intelligence
A general framework for equivalences in answer-set programming by countermodels in the logic of here-and-there*

Theory and Practice of Logic Programming
Discovering theorems in game theory: Two-person games with unique pure Nash equilibrium payoffs

Artificial Intelligence
Equivalence between extended datalog programs -- a brief survey

Datalog'10 Proceedings of the First international conference on Datalog Reloaded
Approximation fixpoint theory and the semantics of logic and answers set programs

Correct Reasoning
Computing Loops with at Most One External Support Rule

Quantified Score

Hi-index	0.00

Visualization

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.