Predicate Answer Set Programming with Coinduction
Coinductive SLDNF and its applcation to Predicate Answer Set Programming
978-3-8433-6582-6
3843365822
180
2010-12-20
68.00 €
eng
https://images.our-assets.com/cover/230x230/9783843365826.jpg
https://images.our-assets.com/fullcover/230x230/9783843365826.jpg
https://images.our-assets.com/cover/2000x/9783843365826.jpg
https://images.our-assets.com/fullcover/2000x/9783843365826.jpg
We introduce negation into coinductive logic programming (co-LP) via what we term Coinductive SLDNF (co-SLDNF) resolution. We present declarative and operational semantics of co-SLDNF resolution and present their equivalence under the restriction of rationality and its applications to Answer Set Programming (ASP). ASP is a powerful programming paradigm for performing non-monotonic reasoning within logic programming. The current state of ASP solvers has been restricted to "grounded range- restricted function-free normal programs", with a "bottom-up" evaluation strategy (that is, not goal- driven) until now. The introduction of co-LP with co-SLDNF resolution has enabled the development of top-down goal evaluation strategies for ASP. We present a novel and innovative approach to solving ASP programs with co-LP. Our method eliminates the need for grounding, allows functions, and effectively handles a large class of predicate ASP programs including possibly infinite ASP programs. Moreover, it is goal-directed and top-down execution method that provides an innovative and attractive alternative to current ASP solver technology.
https://www.morebooks.de/books/pt/published_by/lap-lambert-academic-publishing/47/products
Linguagem de programação
https://www.morebooks.de/store/pt/book/predicate-answer-set-programming-with-coinduction/isbn/978-3-8433-6582-6