60 search results - page 6 / 12 » Answer Set Programming with Constraints Using Lazy Grounding |
CORR
2011
Springer
12 years 11 months ago
2011
Springer
We present a unifying approach to the efļ¬cient evaluation of propositional answer-set programs. Our approach is based on backdoors which are small sets of atoms that represent ā...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
We propose a method for inferring parameterized regular types for logic programs as solutions for systems of constraints over sets of finite ground Herbrand terms (set constraint s...
AI
2011
Springer
13 years 3 months ago
2011
Springer
The concept of a stable model provided a declarative semantics for Prolog programs with negation as failure and became a starting point for the development of answer set programmi...
LPNMR
2009
Springer
14 years 16 days ago
2009
Springer
Abstract. In answer-set programming (ASP), the main focus usually is on computing answer sets which correspond to solutions to the problem represented by a logic program. Simple re...
IJCAI
2007
13 years 9 months ago
2007
The deļ¬nition 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...