Sciweavers

662 search results - page 18 / 133
» Logic Programming with Ordered Disjunction
Sort
View
WLP
2004
Springer
14 years 25 days ago
Solving Alternating Boolean Equation Systems in Answer Set Programming
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...
Misa Keinänen, Ilkka Niemelä
IJCAI
2007
13 years 9 months ago
A New Perspective on Stable Models
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...
Paolo Ferraris, Joohyung Lee, Vladimir Lifschitz
AMAI
2006
Springer
13 years 7 months ago
Strong order equivalence
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...
Wolfgang Faber, Kathrin Konczak
ASIAN
1999
Springer
99views Algorithms» more  ASIAN 1999»
13 years 11 months ago
Beyond Tamaki-Sato Style Unfold/Fold Transformations for Normal Logic Programs
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...
IJCAI
2003
13 years 8 months ago
Minimal Change and Maximal Coherence for Epistemic Logic Program Updates
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 ...
Yan Zhang