In this paper, we address the problem of checking whether two disjunctive logic programs possess exactly the same stable models.
Solving a problem in answer set programming (ASP) typically results in several versions of the logic program formalizing the problem.
Verifying the Equivalence of Logic Programs in the Disjunctive Case
link.springer.com › content › pdf
Abstract. In this paper, we address the problem of checking whether two disjunctive logic programs possess exactly the same stable models.
In this paper, we address the problem of checking whether two disjunctive logic programs possess exactly the same stable models.
This paper addresses the problem of checking whether two disjunctive logic programs possess exactly the same stable models, and reports on the preliminary ...
Springer-Verlag. Abstract: In this paper, we address the problem of checking whether two disjunctive logic programs possess exactly the same stable models. An ...
ABSTRACT: To solve a problem in answer set programming (ASP), one constructs a logic program so that its answer sets correspond to the solutions.
ABSTRACT: To solve a problem in answer set programming (ASP), one constructs a logic program so that its answer sets correspond to the solutions.
Aug 3, 2024 · The equivalence of logic programs P and Q can naturally be verified using an explicit cross-check of all the answer sets of both programs. Our ...
Testing the Equivalence of Disjunctive Logic Programs. 2003. Verifying the Equivalence of Logic Programs in the Disjunctive Case. Peer-reviewed.