Add to ORKGIn 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. 1
Abstract. Recently, notions of equivalence for Answer Set Programming have been stud-ied intensively...
We study the notion of strong equivalence between two Answer Set programs and we show how some parti...
Abstract. Recently, notions of equivalence for Answer Set Programming have been studied intensively ...
In this paper we apply computer-aided theorem discovery technique to discover theorems about strongl...
In this paper we apply computer-aided theorem discovery technique to discover theorems about strongl...
In this paper we apply computer-aided theorem discovery technique to discover theo-rems about strong...
This paper describes a system called SELP for studying strong equivalence in answer set logic progra...
Answer set programming is a prominent declarative programming paradigm used in formulating combinato...
We consider the simplification of logic programs under the stablemodel semantics, with respect to t...
Strong equivalence is one of the basic notions of equivalence that have been proposed for logic prog...
Abstract. We study the notion of strong equivalence between two An-swer Set programs and we show how...
Abstract. Logic programming under the answer-set semantics nowadays deals with numerous different no...
Epistemic Logic Programs (ELPs), that is, Answer Set Programming (ASP) extended with epistemic opera...
Abstract. Logic programs with abstract constraint atoms provide a unifying framework for studying lo...
Recent research in nonmonotonic logic programming under the answer-set semantics studies different n...
Abstract. Recently, notions of equivalence for Answer Set Programming have been stud-ied intensively...
We study the notion of strong equivalence between two Answer Set programs and we show how some parti...
Abstract. Recently, notions of equivalence for Answer Set Programming have been studied intensively ...
In this paper we apply computer-aided theorem discovery technique to discover theorems about strongl...
In this paper we apply computer-aided theorem discovery technique to discover theorems about strongl...
In this paper we apply computer-aided theorem discovery technique to discover theo-rems about strong...
This paper describes a system called SELP for studying strong equivalence in answer set logic progra...
Answer set programming is a prominent declarative programming paradigm used in formulating combinato...
We consider the simplification of logic programs under the stablemodel semantics, with respect to t...
Strong equivalence is one of the basic notions of equivalence that have been proposed for logic prog...
Abstract. We study the notion of strong equivalence between two An-swer Set programs and we show how...
Abstract. Logic programming under the answer-set semantics nowadays deals with numerous different no...
Epistemic Logic Programs (ELPs), that is, Answer Set Programming (ASP) extended with epistemic opera...
Abstract. Logic programs with abstract constraint atoms provide a unifying framework for studying lo...
Recent research in nonmonotonic logic programming under the answer-set semantics studies different n...
Abstract. Recently, notions of equivalence for Answer Set Programming have been stud-ied intensively...
We study the notion of strong equivalence between two Answer Set programs and we show how some parti...
Abstract. Recently, notions of equivalence for Answer Set Programming have been studied intensively ...