Computer Science – Artificial Intelligence
Scientific paper
2010-07-21
Theory and Practice of Logic Programming (2010), 10:481-496 Cambridge University Press
Computer Science
Artificial Intelligence
Scientific paper
Answer set programming - the most popular problem solving paradigm based on logic programs - has been recently extended to support uninterpreted function symbols. All of these approaches have some limitation. In this paper we propose a class of programs called FP2 that enjoys a different trade-off between expressiveness and complexity. FP2 programs enjoy the following unique combination of properties: (i) the ability of expressing predicates with infinite extensions; (ii) full support for predicates with arbitrary arity; (iii) decidability of FP2 membership checking; (iv) decidability of skeptical and credulous stable model reasoning for call-safe queries. Odd cycles are supported by composing FP2 programs with argument restricted programs.
Baselice Sabrina
Bonatti Piero A.
No associations
LandOfFree
A decidable subclass of finitary programs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A decidable subclass of finitary programs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A decidable subclass of finitary programs will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-184038