{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:10:12Z","timestamp":1750291812289,"version":"3.41.0"},"reference-count":21,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2014,4,1]],"date-time":"2014-04-01T00:00:00Z","timestamp":1396310400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100007458","name":"Qatar Foundation","doi-asserted-by":"publisher","award":["(NPRP 09-079-1-013)"],"award-info":[{"award-number":["(NPRP 09-079-1-013)"]}],"id":[{"id":"10.13039\/100007458","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Comput. Logic"],"published-print":{"date-parts":[[2014,4]]},"abstract":"<jats:p>In this article, we consider the issue of how first-order answer set programs can be extended for handling preference reasoning. To this end, we propose a progression-based preference semantics for first-order answer set programs while explicit preference relations are presented. We study essential properties of the proposed preferred answer set semantics. To understand the expressiveness of preferred first-order answer set programming, we further specify a second-order logic representation which precisely characterizes the progression-based preference semantics.<\/jats:p>","DOI":"10.1145\/2579817","type":"journal-article","created":{"date-parts":[[2014,5,7]],"date-time":"2014-05-07T12:48:53Z","timestamp":1399466933000},"page":"1-42","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Preferred First-Order Answer Set Programs"],"prefix":"10.1145","volume":"15","author":[{"given":"Vernon","family":"Asuncion","sequence":"first","affiliation":[{"name":"University of Western Sydney, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yan","family":"Zhang","sequence":"additional","affiliation":[{"name":"University of Western Sydney, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yi","family":"Zhou","sequence":"additional","affiliation":[{"name":"University of Western Sydney, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,5,2]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2011.11.001"},{"volume-title":"Proceedings of the National Conference on Artificial Intelligence (AAAI'12)","author":"Asuncion V.","key":"e_1_2_1_2_1","unstructured":"V. Asuncion , F. Lin , Y. Zhang , and Y. Zhou . 2012b. Ordered completion for logic programs with aggregates . In Proceedings of the National Conference on Artificial Intelligence (AAAI'12) . 691--697. V. Asuncion, F. Lin, Y. Zhang, and Y. Zhou. 2012b. Ordered completion for logic programs with aggregates. In Proceedings of the National Conference on Artificial Intelligence (AAAI'12). 691--697."},{"volume-title":"Reasoning and Declarative Problem Solving","author":"Baral C.","key":"e_1_2_1_3_1","unstructured":"C. Baral . 2003. Knowledge Representation , Reasoning and Declarative Problem Solving . MIT Press . 39 C. Baral. 2003. Knowledge Representation, Reasoning and Declarative Problem Solving. MIT Press. 39"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/11881216_1"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(99)00015-6"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2010.12.001"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068402001539"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.0824-7935.2004.00240.x"},{"volume-title":"Elements of Set Theory","author":"Enderton H.","key":"e_1_2_1_9_1","unstructured":"H. Enderton . 1977. Elements of Set Theory . Academic Press . H. Enderton. 1977. Elements of Set Theory. Academic Press."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2010.04.011"},{"volume-title":"Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI'07)","author":"Gebser M.","key":"e_1_2_1_11_1","unstructured":"M. Gebser , B. Kaufmann , A. Neumann , and T. Schaub . 2007. Conflict-driven answer set solving . In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI'07) . 386--391. M. Gebser, B. Kaufmann, A. Neumann, and T. Schaub. 2007. Conflict-driven answer set solving. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI'07). 386--391."},{"volume-title":"Proceedings of the International Conference for Logic Programming. 1070--1080","author":"Gelfond M.","key":"e_1_2_1_12_1","unstructured":"M. Gelfond and V. Lifschitz . 1988. A stable model semantics for logig programming . In Proceedings of the International Conference for Logic Programming. 1070--1080 . M. Gelfond and V. Lifschitz. 1988. A stable model semantics for logig programming. In Proceedings of the International Conference for Logic Programming. 1070--1080."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04238-6_17"},{"volume-title":"Proceedings of the 24th National Conference on Artificial Intelligence (AAAI'10)","author":"Lee J.","key":"e_1_2_1_14_1","unstructured":"J. Lee and R. Palla . 2010. Situation calculus as answer set programming . In Proceedings of the 24th National Conference on Artificial Intelligence (AAAI'10) . 309--314. J. Lee and R. Palla. 2010. Situation calculus as answer set programming. In Proceedings of the 24th National Conference on Artificial Intelligence (AAAI'10). 309--314."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(85)90055-4"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2010.04.001"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(86)90032-9"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068403001844"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1149114.1149115"},{"volume-title":"Proceedings of the 12th International Conference on the Principles of Knowledge Representation and Reasoning. 518--527","author":"Zhang Y.","key":"e_1_2_1_20_1","unstructured":"Y. Zhang and Y. Zhou . 2010. On the progression semantics and boundedness of answer set programs . In Proceedings of the 12th International Conference on the Principles of Knowledge Representation and Reasoning. 518--527 . Y. Zhang and Y. Zhou. 2010. On the progression semantics and boundedness of answer set programs. In Proceedings of the 12th International Conference on the Principles of Knowledge Representation and Reasoning. 518--527."},{"volume-title":"Proceedings of the 24th National Conference on Artificial Intelligence (AAAI'11)","author":"Zhou Y.","key":"e_1_2_1_21_1","unstructured":"Y. Zhou and Y. Zhang . 2011. Progression semantics for disjunctive logic programs . In Proceedings of the 24th National Conference on Artificial Intelligence (AAAI'11) . 286--291. Y. Zhou and Y. Zhang. 2011. Progression semantics for disjunctive logic programs. In Proceedings of the 24th National Conference on Artificial Intelligence (AAAI'11). 286--291."}],"container-title":["ACM Transactions on Computational Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2579817","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2579817","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T23:43:50Z","timestamp":1750290230000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2579817"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,4]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,4]]}},"alternative-id":["10.1145\/2579817"],"URL":"https:\/\/doi.org\/10.1145\/2579817","relation":{},"ISSN":["1529-3785","1557-945X"],"issn-type":[{"type":"print","value":"1529-3785"},{"type":"electronic","value":"1557-945X"}],"subject":[],"published":{"date-parts":[[2014,4]]},"assertion":[{"value":"2011-07-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2013-09-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2014-05-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}