Handbook of theoretical computer science (vol. B)
Reasoning about termination of pure Prolog programs
Information and Computation
On the occur-check-free PROLOG programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Approximations, stable operators, well-founded fixpoints and applications in nonmonotonic reasoning
Logic-based artificial intelligence
Certificate chain discovery in SPKI?SDSI
Journal of Computer Security
Ultimate Well-Founded and Stable Semantics for Logic Programs with Aggregates
Proceedings of the 17th International Conference on Logic Programming
The Magic of Duplicates and Aggregates
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
A Logic Language based on GAMMA-like Multiset Rewriting
ELP '96 Proceedings of the 5th International Workshop on Extensions of Logic Programming
Design of a Role-Based Trust-Management Framework
SP '02 Proceedings of the 2002 IEEE Symposium on Security and Privacy
Well-founded and stable semantics of logic programs with aggregates
Theory and Practice of Logic Programming
Core TuLiP logic programming for trust management
ICLP'07 Proceedings of the 23rd international conference on Logic programming
Decentralized trust management
SP'96 Proceedings of the 1996 IEEE conference on Security and privacy
| Hi-index | 0.00 |
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.