Abstract. In this paper we apply answer set programming to solve alternating Boolean equation systems. We develop a novel characterization of solutions for variables in disjunctive...
The definition of a stable model has provided a declarative semantics for Prolog programs with negation as failure and has led to the development of answer set programming. In th...
Abstract. Recently, notions of equivalence for Answer Set Programming have been studied intensively and were shown to be beneficial for modular programming and automated optimizati...
Unfold/fold transformation systems for logic programs have been extensively investigated. Existing unfold/fold transformation systems for normal logic programs allow only Tamaki-Sa...
Abhik Roychoudhury, K. Narayan Kumar, C. R. Ramakr...
We consider the problem of updating nonmonotonic knowledge bases represented by epistemic logic programs where disjunctive information and notions of knowledge and beliefs can be ...