{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:16:20Z","timestamp":1725552980576},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642125911"},{"type":"electronic","value":"9783642125928"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12592-8_6","type":"book-chapter","created":{"date-parts":[[2010,4,28]],"date-time":"2010-04-28T02:28:59Z","timestamp":1272421739000},"page":"67-81","source":"Crossref","is-referenced-by-count":0,"title":["LP with Flexible Grouping and Aggregates Using Modes"],"prefix":"10.1007","author":[{"given":"Marcin","family":"Czenko","sequence":"first","affiliation":[]},{"given":"Sandro","family":"Etalle","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","series-title":"Formal Models and Semantics","first-page":"495","volume-title":"Handbook of Theoretical Computer Science","author":"K.R. Apt","year":"1990","unstructured":"Apt, K.R.: Introduction to Logic Programming. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science. Formal Models and Semantics, vol.\u00a0B, pp. 495\u2013574. Elsevier, Amsterdam and The MIT Press, Cambridge (1990)"},{"issue":"6A","key":"6_CR2","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1007\/BF01213601","volume":"6","author":"K.R. Apt","year":"1994","unstructured":"Apt, K.R., Marchiori, E.: Reasoning about Prolog programs: from Modes through Types to Assertions. Formal Aspects of Computing\u00a06(6A), 743\u2013765 (1994)","journal-title":"Formal Aspects of Computing"},{"issue":"1","key":"6_CR3","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1006\/inco.1993.1051","volume":"106","author":"K.R. Apt","year":"1993","unstructured":"Apt, K.R., Pedreschi, D.: Reasoning about termination of pure Prolog programs. Information and Computation\u00a0106(1), 109\u2013157 (1993)","journal-title":"Information and Computation"},{"issue":"3","key":"6_CR4","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1145\/177492.177673","volume":"16","author":"K.R. Apt","year":"1994","unstructured":"Apt, K.R., Pellegrini, A.: On the occur-check free Prolog programs. ACM Toplas\u00a016(3), 687\u2013726 (1994)","journal-title":"ACM Toplas"},{"key":"6_CR5","first-page":"164","volume-title":"Proc. 17th IEEE Symposium on Security and Privacy","author":"M. Blaze","year":"1996","unstructured":"Blaze, M., Feigenbaum, J., Lacy, J.: Decentralized Trust Management. In: Proc. 17th IEEE Symposium on Security and Privacy, May 1996, pp. 164\u2013173. IEEE Computer Society Press, Los Alamitos (1996)"},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/3-540-60983-0_6","volume-title":"Extensions of Logic Programming","author":"P. Ciancarini","year":"1996","unstructured":"Ciancarini, P., Fogli, D., Gaspari, M.: A Logic Language based on GAMMA-like Multiset Rewriting. In: Herre, H., Dyckhoff, R., Schroeder-Heister, P. (eds.) ELP 1996. LNCS, vol.\u00a01050, pp. 83\u2013101. Springer, Heidelberg (1996)"},{"issue":"4","key":"6_CR7","doi-asserted-by":"crossref","first-page":"285","DOI":"10.3233\/JCS-2001-9402","volume":"9","author":"D. Clarke","year":"2001","unstructured":"Clarke, D., Elien, J.E., Ellison, C., Fredette, M., Morcos, A., Rivest, R.L.: Certificate Chain Discovery in SPKI\/SDSI. Journal of Computer Security\u00a09(4), 285\u2013322 (2001)","journal-title":"Journal of Computer Security"},{"key":"6_CR8","unstructured":"Czenko, M.R.: TuLiP: Reshaping Trust Management. PhD thesis, University of Twente, Enschede (June 2009)"},{"key":"6_CR9","first-page":"1","volume-title":"Proceedings of IFIPTM 2008: Joint iTrust and PST Conferences on Privacy, Trust Management and Security, IFIP International Federation for Information Processing","author":"M.R. Czenko","year":"2008","unstructured":"Czenko, M.R., Doumen, J.M., Etalle, S.: Trust Management in P2P Systems Using Standard TuLiP. In: Proceedings of IFIPTM 2008: Joint iTrust and PST Conferences on Privacy, Trust Management and Security, IFIP International Federation for Information Processing, Trondheim, Norway, May 2008, vol.\u00a0263, pp. 1\u201316. Springer, Boston (2008)"},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1007\/978-3-540-74610-2_26","volume-title":"Logic Programming","author":"M.R. Czenko","year":"2007","unstructured":"Czenko, M.R., Etalle, S.: Core TuLiP - Logic Programming for Trust Management. In: Dahl, V., Niemel\u00e4, I. (eds.) ICLP 2007. LNCS, vol.\u00a04670, pp. 380\u2013394. Springer, Heidelberg (2007)"},{"key":"6_CR11","series-title":"The Springer International Series in Engineering and Computer Science","first-page":"127","volume-title":"Logic-Based Artificial Intelligence, ch. 6","author":"M. Denecker","year":"2001","unstructured":"Denecker, M., Marek, V., Truszczy\u0144ski, M.: Approximations, Stable Operators, Well-Founded Operators, Fixpoints and Applications in Nonmonotonic Reasoning. In: Minker, J. (ed.) Logic-Based Artificial Intelligence, ch. 6. The Springer International Series in Engineering and Computer Science, vol.\u00a0597, pp. 127\u2013144. Springer, Heidelberg (2001)"},{"key":"6_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/3-540-45635-X_22","volume-title":"Logic Programming","author":"M. Denecker","year":"2001","unstructured":"Denecker, M., Pelov, N., Bruynooghe, M.: Ultimate Well-Founded and Stable Semantics for Logic Programs with Aggregates. In: Codognet, P. (ed.) ICLP 2001. LNCS, vol.\u00a02237, pp. 212\u2013226. Springer, Heidelberg (2001)"},{"key":"6_CR13","first-page":"111","volume-title":"ICLP","author":"A. Dovier","year":"1991","unstructured":"Dovier, A., Omodeo, E.G., Pontelli, E., Rossi, G.: {log}: A logic programming language with finite sets. In: ICLP, pp. 111\u2013124. MIT Press, Cambridge (1991)"},{"key":"6_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1007\/978-3-540-24599-5_20","volume-title":"Logic Programming","author":"A. Dovier","year":"2003","unstructured":"Dovier, A., Pontelli, E., Rossi, G.: Intensional Sets in CLP. In: Palamidessi, C. (ed.) ICLP 2003. LNCS, vol.\u00a02916, pp. 284\u2013299. Springer, Heidelberg (2003)"},{"issue":"2","key":"6_CR15","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/S0743-1066(98)10025-0","volume":"38","author":"S. Etalle","year":"1999","unstructured":"Etalle, S., Bossi, A., Cocco, N.: Termination of well-moded programs. J. Log. Program\u00a038(2), 243\u2013257 (1999)","journal-title":"J. Log. Program"},{"key":"6_CR16","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1007\/978-3-540-30227-8_19","volume-title":"Logics in Artificial Intelligence","author":"W. Faber","year":"2004","unstructured":"Faber, W., Leone, N., Pfeifer, G.: Recursive Aggregates in Disjunctive Logic Programs: Semantics and Complexity. In: Alferes, J.J., Leite, J. (eds.) JELIA 2004. LNCS (LNAI), vol.\u00a03229, pp. 200\u2013212. Springer, Heidelberg (2004)"},{"key":"6_CR17","first-page":"387","volume-title":"ISLP","author":"D.B. Kemp","year":"1991","unstructured":"Kemp, D.B., Stuckey, P.J.: Semantics of logic programs with aggregates. In: ISLP, pp. 387\u2013401. MIT Press, Cambridge (1991)"},{"key":"6_CR18","first-page":"114","volume-title":"Proc. IEEE Symposium on Security and Privacy","author":"N. Li","year":"2002","unstructured":"Li, N., Mitchell, J., Winsborough, W.: Design of a Role-based Trust-management Framework. In: Proc. IEEE Symposium on Security and Privacy, pp. 114\u2013130. IEEE Computer Society Press, Los Alamitos (2002)"},{"key":"6_CR19","first-page":"264","volume-title":"Proc. 16th International Conference on Very Large Databases","author":"I.S. Mumick","year":"1990","unstructured":"Mumick, I.S., Pirahesh, H., Ramakrishnan, R.: The Magic of Duplicates and Aggregates. In: Proc. 16th International Conference on Very Large Databases, pp. 264\u2013277. Morgan Kaufmann Publishers Inc, San Francisco (1990)"},{"issue":"3","key":"6_CR20","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1017\/S1471068406002973","volume":"7","author":"N. Pelov","year":"2007","unstructured":"Pelov, N., Denecker, M., Bruynooghe, M.: Well-founded and stable semantics of logic programs with aggregates. Theory and Practice of Logic Programming (TPLP)\u00a07(3), 301\u2013353 (2007)","journal-title":"Theory and Practice of Logic Programming (TPLP)"},{"key":"6_CR21","unstructured":"Somogyi, Z., Henderson, F., Conway, T.: Mercury: an efficient purely declarative logic programming language. In: Australian Computer Science Conference (1995), \n                  \n                    http:\/\/www.cs.mu.oz.au\/mercury\/papers.html"}],"container-title":["Lecture Notes in Computer Science","Logic-Based Program Synthesis and Transformation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12592-8_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,13]],"date-time":"2019-03-13T16:12:18Z","timestamp":1552493538000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12592-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642125911","9783642125928"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12592-8_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}