{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:26:57Z","timestamp":1725514017884},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540721994"},{"type":"electronic","value":"9783540722007"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72200-7_20","type":"book-chapter","created":{"date-parts":[[2007,6,5]],"date-time":"2007-06-05T12:54:47Z","timestamp":1181048087000},"page":"228-240","source":"Crossref","is-referenced-by-count":2,"title":["Logic Programs with Abstract Constraints: Representaton, Disjunction and Complexities"],"prefix":"10.1007","author":[{"given":"Jia-Huai","family":"You","sequence":"first","affiliation":[]},{"given":"Li Yan","family":"Yuan","sequence":"additional","affiliation":[]},{"given":"Guohua","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Yi-Dong","family":"Shen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/BF01530761","volume":"14","author":"R. Ben-Eliyahu","year":"1994","unstructured":"Ben-Eliyahu, R., Dechter, R.: Propositional semantics for disjunctive logic programs. Annals of Math. and Artificial Intelligence\u00a014, 53\u201387 (1994)","journal-title":"Annals of Math. and Artificial Intelligence"},{"key":"20_CR2","unstructured":"Calimeri, F., et al.: Declarative and computational properties of logic programs with aggregates. In: Proc. IJCAI\u201905, pp. 406\u2013411 (2005)"},{"key":"20_CR3","unstructured":"Dell\u2019Armi, T., et al.: Aggregate functions in disjunctive logic programming: semantics, complexity, and implementation in DLV. In: Proc. IJCAI\u201903, pp. 847\u2013852 (2003)"},{"key":"20_CR4","series-title":"Lecture Notes in Computer Science","first-page":"212","volume-title":"Logic Programming","author":"M. Bruynooghe","year":"2001","unstructured":"Bruynooghe, M., Denecker, M., Pelov, N.: 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":"20_CR5","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. In: Alferes, J.J., Leite, J.A. (eds.) JELIA 2004. LNCS (LNAI), vol.\u00a03229, pp. 200\u2013212. Springer, Heidelberg (2004)"},{"key":"20_CR6","first-page":"51","volume":"1","author":"F. Fages","year":"1994","unstructured":"Fages, F.: Consistency of Clark\u2019s completion and existence of stable models. Journal of Methods of Logic in Computer Science\u00a01, 51\u201360 (1994)","journal-title":"Journal of Methods of Logic in Computer Science"},{"key":"20_CR7","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45632-5_16","volume-title":"Computational Logic: Logic Programming and Beyond","author":"M. Gelfond","year":"2002","unstructured":"Gelfond, M.: Representing Knowledge in A-Prolog. In: Kakas, A.C., Sadri, F. (eds.) Computational Logic: Logic Programming and Beyond. LNCS (LNAI), vol.\u00a02408, Springer, Heidelberg (2002)"},{"key":"20_CR8","first-page":"1070","volume-title":"Proc. 5th ICLP","author":"M. Gelfond","year":"1988","unstructured":"Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Proc. 5th ICLP, pp. 1070\u20131080. MIT Press, Cambridge (1988)"},{"key":"20_CR9","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF03037169","volume":"9","author":"M. Gelfond","year":"1991","unstructured":"Gelfond, M., Lifschitz, V.: Classic negation in logic programs and disjunctive databases. New Generation Computing\u00a09, 365\u2013385 (1991)","journal-title":"New Generation Computing"},{"key":"20_CR10","unstructured":"Liu, L., Truszczy\u0144ski, M.: Properties of programs with monotone and convex constraints. In: Proc. AAAI \u201905, pp. 701\u2013706 (2005)"},{"key":"20_CR11","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1613\/jair.2009","volume":"7","author":"L. Liu","year":"2006","unstructured":"Liu, L., Truszczy\u0144ski, M.: Properties and applications of programs with monotone and convex constraints. Journal of Artificial Intelligence Research\u00a07, 299\u2013334 (2006)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"20_CR12","unstructured":"Marek, V., Niemel\u00e4, I., Truszczy\u0144ski, M.: Logic programs with monotone abstract constraint atoms. Theory and Practice of Logic Programming, To appear."},{"key":"20_CR13","unstructured":"Marek, V., Truszczy\u0144ski, M.: Logic programs with abstract constraint atoms. In: Proc. AAAI \u201904, pp. 86\u201391 (2004)"},{"key":"20_CR14","unstructured":"Mittal, S., Falkenhainer, B.: Dynamic constraint satisfaction problems. In: Proc. AAAI\u201990, pp. 25\u201332 (1990)"},{"key":"20_CR15","unstructured":"Pelov, N.: Semantics of Logic Programs with Aggregates. PhD thesis, Ketholieke Universiteit Leuven (2004)"},{"key":"20_CR16","doi-asserted-by":"crossref","unstructured":"Pelov, N., Denecker, M., Bruynooghe, M.: Well-founded and stable semantics of logic programs with aggregates. Theory and Practice of Logic Programming, To appear.","DOI":"10.1017\/S1471068406002973"},{"key":"20_CR17","unstructured":"Pelov, N., Truszczy\u0144ski, M.: Semantics of disjunctive programs with monotone aggregates an operator-based approach. In: Proc. NMR \u201904, pp. 327\u2013334 (2004)"},{"key":"20_CR18","doi-asserted-by":"crossref","unstructured":"Simons, P., Niemel\u00e4, I., Soininen, T.: Extending and implementing the stable model semantics. Artificial Intelligence\u00a0138(1-2) (2002)","DOI":"10.1016\/S0004-3702(02)00187-X"},{"key":"20_CR19","doi-asserted-by":"crossref","unstructured":"Son, T.C., Pontelli, E.: A constructive semantic characterization of aggregates in answer set programming. Theory and Practice of Logic Programming, To appear.","DOI":"10.1017\/S1471068406002936"},{"key":"20_CR20","unstructured":"Son, T.C., Pontelli, E., Elkabani, I.: A translational semantics for aggregates in logic programs. Technical Report CS-2005-006, New Mexico State University (2005)"},{"key":"20_CR21","unstructured":"Son, T.C., Pontelli, E., Tu, P.: Answer sets for logic programs with arbitrary abstract constraint atoms. In: Proc. AAAI\u201906, pp. 129\u2013134 (2006)"}],"container-title":["Lecture Notes in Computer Science","Logic Programming and Nonmonotonic Reasoning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72200-7_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T00:29:33Z","timestamp":1605745773000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72200-7_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540721994","9783540722007"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72200-7_20","relation":{},"subject":[]}}