We propose a new grouping operator for logic programs based on the bagof predicate. The novelty of our proposal lies in the use of modes, which allows us to prove properties regarding groundness of computed answer substitutions and termination. Moreover, modes allow us to define a somewhat declarative semantics for it and to relax some rather unpractical constraints on variable occurrences while retaining a straightforward semantics.
|Conference||19th International Symposium, LOPSTR, Revised Selected Papers|
|Period||9/09/09 → 11/09/09|
|Other||9-11 Sep 2009|
- Grouping in Logic Programs
- Moded Logic Programming
- Termination of Logic Programs
- Stratified Logic Programs