{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T08:10:21Z","timestamp":1726042221112},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030290061"},{"type":"electronic","value":"9783030290078"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-29007-8_4","type":"book-chapter","created":{"date-parts":[[2019,8,21]],"date-time":"2019-08-21T19:10:06Z","timestamp":1566414606000},"page":"57-73","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Language-Independent Framework for Reasoning About Preferences for Declarative Problem Solving"],"prefix":"10.1007","author":[{"given":"Alireza","family":"Ensan","sequence":"first","affiliation":[]},{"given":"Eugenia","family":"Ternovska","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,8,14]]},"reference":[{"key":"4_CR1","unstructured":"Amgoud, L., Vesic, S.: Repairing preference-based argumentation frameworks. In: IJCAI, pp. 665\u2013670. Citeseer (2009)"},{"issue":"4","key":"4_CR2","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1609\/aimag.v29i4.2204","volume":"29","author":"JA Baier","year":"2008","unstructured":"Baier, J.A., McIlraith, S.A.: Planning with preferences. AI Mag. 29(4), 25\u201337 (2008)","journal-title":"AI Mag."},{"key":"4_CR3","volume-title":"Handbook of Satisfiability","author":"A Biere","year":"2009","unstructured":"Biere, A., Heule, M., van Maaren, H.: Handbook of Satisfiability, vol. 185. IOS Press, Amsterdam (2009)"},{"issue":"5\u20136","key":"4_CR4","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1017\/S1471068416000387","volume":"16","author":"B Bogaerts","year":"2016","unstructured":"Bogaerts, B., Janhunen, T., Tasharrofi, S.: Stable-unstable semantics: beyond np with normal logic programs. Theory Pract. Log. Program. 16(5\u20136), 570\u2013586 (2016)","journal-title":"Theory Pract. Log. Program."},{"key":"4_CR5","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1613\/jair.1234","volume":"21","author":"C Boutilier","year":"2004","unstructured":"Boutilier, C., Brafman, R.I., Domshlak, C., Hoos, H.H., Poole, D.: CP-nets: a tool for representing and reasoning with conditional ceteris paribus preference statements. J. Artif. Intell. Res. (JAIR) 21, 135\u2013191 (2004)","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"issue":"2","key":"4_CR6","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1111\/j.0824-7935.2004.00234.x","volume":"20","author":"C Boutilier","year":"2004","unstructured":"Boutilier, C., Brafman, R.I., Domshlak, C., Hoos, H.H., Poole, D.: Preference-based constrained optimization with CP-nets. Comput. Intell. 20(2), 137\u2013157 (2004)","journal-title":"Comput. Intell."},{"key":"4_CR7","unstructured":"Brafman, R.I., Domshlak, C.: Introducing variable importance tradeoffs into CP-nets. In: Proceedings of the Eighteenth Conference on Uncertainty in Artificial Intelligence, pp. 69\u201376. Morgan Kaufmann Publishers Inc. (2002)"},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1613\/jair.1895","volume":"25","author":"RI Brafman","year":"2006","unstructured":"Brafman, R.I., Domshlak, C., Shimony, S.E.: On graphical modeling of preference and importance. J. Artif. Intell. Res. 25, 389\u2013424 (2006)","journal-title":"J. Artif. Intell. Res."},{"key":"4_CR9","unstructured":"Brewka, G.: Logic programming with ordered disjunction. In: AAAI\/IAAI, pp. 100\u2013105 (2002)"},{"issue":"1","key":"4_CR10","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/S0004-3702(99)00015-6","volume":"109","author":"G Brewka","year":"1999","unstructured":"Brewka, G., Eiter, T.: Preferred answer sets for extended logic programs. Artif. Intell. 109(1), 297\u2013356 (1999)","journal-title":"Artif. Intell."},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Brewka, G., Eiter, T.: Prioritizing default logic: abridged report. Festschrift on the occasion of Prof. Dr. W. Bibel 60th birthday. Kluwer, Dordrecht (1999)","DOI":"10.1007\/978-94-015-9383-0_3"},{"key":"4_CR12","first-page":"867","volume":"3","author":"G Brewka","year":"2003","unstructured":"Brewka, G., Niemel\u00e4, I., Truszczynski, M.: Answer set optimization. IJCAI 3, 867\u2013872 (2003)","journal-title":"IJCAI"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Brewka, G., Truszczynski, M., Woltran, S.: Representing preferences among sets. In: AAAI (2010)","DOI":"10.1609\/aaai.v24i1.7584"},{"issue":"1","key":"4_CR14","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF01442131","volume":"4","author":"Y Censor","year":"1977","unstructured":"Censor, Y.: Pareto optimality in multiobjective problems. Appl. Math. Optim. 4(1), 41\u201359 (1977)","journal-title":"Appl. Math. Optim."},{"issue":"4","key":"4_CR15","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1145\/958942.958946","volume":"28","author":"J Chomicki","year":"2003","unstructured":"Chomicki, J.: Preference formulas in relational queries. ACM Trans. Database Syst. (TODS) 28(4), 427\u2013466 (2003)","journal-title":"ACM Trans. Database Syst. (TODS)"},{"issue":"4","key":"4_CR16","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1145\/320107.320109","volume":"4","author":"EF Codd","year":"1979","unstructured":"Codd, E.F.: Extending the database relational model to capture more meaning. ACM Trans. Database Syst. (TODS) 4(4), 397\u2013434 (1979)","journal-title":"ACM Trans. Database Syst. (TODS)"},{"issue":"1","key":"4_CR17","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/S0004-3702(00)00049-7","volume":"123","author":"J Delgrande","year":"2000","unstructured":"Delgrande, J., Schaub, T.: Expressing preferences in default logic. Artif. Intell. 123(1), 41\u201387 (2000)","journal-title":"Artif. Intell."},{"key":"4_CR18","unstructured":"Delgrande, J., Schaub, T., Tompits, H.: Logic programs with compiled preferences. arXiv preprint cs\/0003028 (2000)"},{"issue":"2","key":"4_CR19","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1111\/j.0824-7935.2004.00240.x","volume":"20","author":"J Delgrande","year":"2004","unstructured":"Delgrande, J., Schaub, T., Tompits, H., Wang, K.: A classification and survey of preference handling approaches in nonmonotonic reasoning. Comput. Intell. 20(2), 308\u2013334 (2004)","journal-title":"Comput. Intell."},{"issue":"1\u20132","key":"4_CR20","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/S0304-3975(96)00179-X","volume":"189","author":"T Eiter","year":"1997","unstructured":"Eiter, T., Gottlob, G., Leone, N.: Abduction from logic programs: semantics and complexity. Theor. Comput. Sci. 189(1\u20132), 129\u2013177 (1997)","journal-title":"Theor. Comput. Sci."},{"key":"4_CR21","unstructured":"Ensan, A., Ternovska, E.: Modular systems with preferences. In: IJCAI, pp. 2940\u20132947 (2015)"},{"key":"4_CR22","unstructured":"Fagin, R.: Generalized first-order spectra and polynomial-time recognizable sets (1974)"},{"key":"4_CR23","series-title":"Graduate Texts in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0539-5","volume-title":"Descriptive Complexity","author":"N Immerman","year":"1999","unstructured":"Immerman, N.: Descriptive Complexity. Graduate Texts in Computer Science. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/978-1-4612-0539-5"},{"key":"4_CR24","doi-asserted-by":"crossref","unstructured":"Malizia, E., Lukasiewicz, T.: On the complexity of MCP-nets (2016)","DOI":"10.1609\/aaai.v30i1.10039"},{"key":"4_CR25","unstructured":"Mitchell, D.G., Ternovska, E.: A framework for representing and solving NP search problems. In: AAAI, pp. 430\u2013435 (2005)"},{"issue":"1","key":"4_CR26","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/S0004-3702(00)00054-0","volume":"123","author":"C Sakama","year":"2000","unstructured":"Sakama, C., Inoue, K.: Prioritized logic programming and its application to commonsense reasoning. Artif. Intell. 123(1), 185\u2013222 (2000)","journal-title":"Artif. Intell."},{"issue":"2\u20133","key":"4_CR27","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/s10472-012-9288-8","volume":"64","author":"S Staworko","year":"2012","unstructured":"Staworko, S., Chomicki, J., Marcinkowski, J.: Prioritized repairing and consistent query answering in relational databases. Ann. Math. Artif. Intell. 64(2\u20133), 209\u2013246 (2012)","journal-title":"Ann. Math. Artif. Intell."},{"issue":"1","key":"4_CR28","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/S0167-6377(02)00189-X","volume":"31","author":"M Voorneveld","year":"2003","unstructured":"Voorneveld, M.: Characterization of pareto dominance. Oper. Res. Lett. 31(1), 7\u201311 (2003)","journal-title":"Oper. Res. Lett."},{"key":"4_CR29","unstructured":"Wilson, N.: Preference inference based on lexicographic models. In: Proceedings of the Twenty-First European Conference on Artificial Intelligence, pp. 921\u2013926. IOS Press (2014)"}],"container-title":["Lecture Notes in Computer Science","Frontiers of Combining Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-29007-8_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,25]],"date-time":"2022-09-25T22:37:16Z","timestamp":1664145436000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-29007-8_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030290061","9783030290078"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-29007-8_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"14 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FroCoS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Frontiers of Combining Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"London","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"frocos2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.frocos2019.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"20","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"67% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.1","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}