A general framework for preferences in answer set programming
We introduce a general, flexible, and extensible framework for quantitative and qualitative preferences among the stable models of logic programs. Since it is straightforward to capture propositional theories and constraint satisfaction problems with logic programs, our approach is also relevant to...
Uloženo v:
| Vydáno v: | Artificial intelligence Ročník 325; s. 104023 |
|---|---|
| Hlavní autoři: | , , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Elsevier B.V
01.12.2023
|
| Témata: | |
| ISSN: | 0004-3702, 1872-7921 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | We introduce a general, flexible, and extensible framework for quantitative and qualitative preferences among the stable models of logic programs. Since it is straightforward to capture propositional theories and constraint satisfaction problems with logic programs, our approach is also relevant to optimization in satisfiability testing and constraint processing. We show how complex preference relations can be specified through user-defined preference types and their arguments. We describe how preference specifications are handled internally by so-called preference programs, which are used for dominance testing. We also provide algorithms for computing one, or all, preferred stable models of a logic program, and study the complexity of these problems. We implemented our approach in the asprin system by means of multi-shot answer set solving technology. We demonstrate the generality and flexibility of our methodology by showing how easily existing preference languages can be implemented in asprin. Finally, we empirically evaluate our contributions and contrast them with dedicated implementations. |
|---|---|
| AbstractList | We introduce a general, flexible, and extensible framework for quantitative and qualitative preferences among the stable models of logic programs. Since it is straightforward to capture propositional theories and constraint satisfaction problems with logic programs, our approach is also relevant to optimization in satisfiability testing and constraint processing. We show how complex preference relations can be specified through user-defined preference types and their arguments. We describe how preference specifications are handled internally by so-called preference programs, which are used for dominance testing. We also provide algorithms for computing one, or all, preferred stable models of a logic program, and study the complexity of these problems. We implemented our approach in the asprin system by means of multi-shot answer set solving technology. We demonstrate the generality and flexibility of our methodology by showing how easily existing preference languages can be implemented in asprin. Finally, we empirically evaluate our contributions and contrast them with dedicated implementations. |
| ArticleNumber | 104023 |
| Author | Brewka, Gerhard Romero, Javier Delgrande, James Schaub, Torsten |
| Author_xml | – sequence: 1 givenname: Gerhard surname: Brewka fullname: Brewka, Gerhard email: brewka@informatik.uni-leipzig.de organization: University of Leipzig , Germany – sequence: 2 givenname: James surname: Delgrande fullname: Delgrande, James email: jim@cs.sfu.ca organization: Simon Fraser University, Canada – sequence: 3 givenname: Javier orcidid: 0000-0001-5546-9939 surname: Romero fullname: Romero, Javier email: javier@cs.uni-potsdam.de organization: University of Potsdam, Germany – sequence: 4 givenname: Torsten orcidid: 0000-0002-7456-041X surname: Schaub fullname: Schaub, Torsten email: torsten@cs.uni-potsdam.de organization: University of Potsdam, Germany |
| BookMark | eNqFkE1LAzEQhoNUsK3-Aw_7B3ZNsmmTCAql-AUFL3oO02S2pLbZkgSL_96U9eRBmcMwH-_LzDMho9AHJOSa0YZRNr_ZNhCzD7nhlLelJUo6I2OmJK-l5mxExpRSUbeS8gsySWlbylZrNiZ3i2qDASPsqi7CHo99_Ki6PlaHiB1GDBZT5UMFIR0xVglzmfSbsrr3YXNJzjvYJbz6yVPy_vjwtnyuV69PL8vFqrYtnedaOqkECDdbKxCdYAxnrbZK644xWDullJg5qUFaZwVYDY473qpOyjnQEu2UiMHXxj6lcpk5RL-H-GUYNScEZmsGBOaEwAwIiuz2l8z6DNn3IUfwu__E94MYy2OfHqNJ1p94OB_RZuN6_7fBNxjufJc |
| CitedBy_id | crossref_primary_10_1007_s13218_024_00855_8 |
| Cites_doi | 10.1017/S1471068413000495 10.1017/S1471068421000284 10.1017/S1471068421000508 10.1017/S1471068416000399 10.1007/978-3-319-23264-5_31 10.1007/s10472-005-7034-1 10.1016/S0004-3702(02)00187-X 10.1017/S1471068406002717 10.1007/BF03037169 10.1017/S1471068418000054 10.1017/S1471068416000326 10.1007/BF01536399 10.1016/S0304-3975(96)00179-X 10.1016/j.artint.2023.103931 10.1017/S1471068420000393 10.1609/aaai.v27i1.8585 10.1111/j.0824-7935.2004.00241.x 10.1023/A:1018930122475 10.1007/978-3-319-23264-5_10 10.1613/jair.1234 10.1109/69.877512 10.1016/j.artint.2011.03.004 10.1017/S1471068419000450 10.1007/978-3-642-40564-8_55 10.1017/S1471068422000163 10.1016/0004-3702(86)90032-9 10.1017/S1471068411000548 10.1111/j.0824-7935.2004.00240.x 10.1613/jair.2627 10.1007/978-3-319-23264-5_15 10.3233/AIC-130575 10.1145/1149114.1149117 10.1609/aaai.v27i1.8593 10.1017/S1471068411000329 10.1007/978-3-642-40564-8_35 10.1093/logcom/exv061 10.1007/s10601-010-9095-y 10.1017/S1471068420000381 10.1017/S1471068421000235 10.1613/jair.1.12479 |
| ContentType | Journal Article |
| Copyright | 2023 Elsevier B.V. |
| Copyright_xml | – notice: 2023 Elsevier B.V. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.artint.2023.104023 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1872-7921 |
| ExternalDocumentID | 10_1016_j_artint_2023_104023 S0004370223001698 |
| GroupedDBID | --K --M --Z -~X .DC .~1 0R~ 1B1 1~. 1~5 23N 4.4 457 4G. 5GY 5VS 6I. 6J9 6TJ 7-5 71M 77K 8P~ 9JN AACTN AAEDT AAEDW AAFTH AAIAV AAIKJ AAKOC AAKPC AALRI AAOAW AAQFI AAQXK AAXUO AAYFN ABBOA ABFNM ABFRF ABJNI ABMAC ABVKL ABXDB ABYKQ ACDAQ ACGFO ACGFS ACNCT ACNNM ACRLP ACWUS ACZNC ADBBV ADEZE ADMUD AEBSH AECPX AEFWE AEKER AENEX AETEA AEXQZ AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHJVU AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ASPBG AVWKF AXJTR AZFZN BJAXD BKOJK BLXMC CS3 E3Z EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F0J F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-2 G-Q G8K GBLVA GBOLZ HLZ HVGLF HZ~ IHE IXB J1W JJJVA KOM KQ8 LG9 LY7 M41 MO0 MVM N9A NCXOZ O-L O9- OAUVE OK1 OZT P-8 P-9 P2P PC. PQQKQ Q38 R2- RIG RNS ROL RPZ SBC SDF SDG SDP SES SET SEW SPC SPCBC SST SSV SSZ T5K TAE TN5 TR2 TWZ UPT UQL VQA WH7 WUQ XFK XJE XJT XPP XSW ZMT ~02 ~G- 77I 9DU AATTM AAXKI AAYWO AAYXX ABDPE ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO ADVLN AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD |
| ID | FETCH-LOGICAL-c306t-7d784a4d5b8a4f411e539c899f11abd88845d79a7cdc4ac9ad2d238f776a0a0a3 |
| ISICitedReferencesCount | 3 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001088302000001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0004-3702 |
| IngestDate | Tue Nov 18 22:20:08 EST 2025 Sat Nov 29 07:33:28 EST 2025 Fri Feb 23 02:35:18 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Preferences Answer set programming Optimization |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c306t-7d784a4d5b8a4f411e539c899f11abd88845d79a7cdc4ac9ad2d238f776a0a0a3 |
| ORCID | 0000-0001-5546-9939 0000-0002-7456-041X |
| ParticipantIDs | crossref_primary_10_1016_j_artint_2023_104023 crossref_citationtrail_10_1016_j_artint_2023_104023 elsevier_sciencedirect_doi_10_1016_j_artint_2023_104023 |
| PublicationCentury | 2000 |
| PublicationDate | December 2023 2023-12-00 |
| PublicationDateYYYYMMDD | 2023-12-01 |
| PublicationDate_xml | – month: 12 year: 2023 text: December 2023 |
| PublicationDecade | 2020 |
| PublicationTitle | Artificial intelligence |
| PublicationYear | 2023 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Baral (br0010) 2003 Schaub, Thiele (br0410) 2009; vol. 5649 Eiter, Erdem, Erdogan, Fink (br0530) 2013; 13 G. Brewka, J. Delgrande, J. Romero, T. Schaub, Implementing preferences with asprin, in: Calimeri et al. Di Rosa, Giunchiglia, Maratea (br0080) 2010; 15 pp. 2–11. Bigot, Zanuttini, Fargier, Mengin (br0690) 2013 pp. 112–126. Järvisalo, Junttila, Niemelä (br0350) 2005; 44 McCarthy (br0210) 1986; 28 Alviano, Dodaro, Marques-Silva, Ricca (br0470) 2020; 30 pp. 368–383. Delgrande, Schaub, Tompits, Wang (br0510) 2004; 20 J. Lee, Z. Yang, Computing logic programs with ordered disjunction using asprin, in: Thielscher et al. Balduccini, Gelfond (br0630) 2003 M. Gebser, R. Kaminski, B. Kaufmann, M. Ostrowski, T. Schaub, P. Wanko, Theory solving made easy with clingo 5, in: Carro and King Calimeri, Faber, Gebser, Ianni, Kaminski, Krennwallner, Leone, Maratea, Ricca, Schaub (br0170) 2020; 20 . Eiter, Kiesel (br0770) 2020; 20 Domshlak, Hüllermeier, Kaci, Prade (br0490) 2011; 175 Bozzato, Eiter, Kiesel (br0760) 2021; 21 (br0840) 2015; vol. 9345 Alviano, Dodaro, Fiorentino, Previti, Ricca (br0480) 2023; 320 Eiter, Gottlob (br0230) 1995; 15 M. Gebser, B. Kaufmann, R. Otero, J. Romero, T. Schaub, P. Wanko, Domain-specific heuristics in answer set programming, in: desJardins and Littman J. Romero, T. Schaub, P. Wanko, Computing diverse optimal stable models, in: Carro and King Apt, Blair, Walker (br0140) 1987 Brewka, Delgrande, Romero, Schaub (br0120) 2015 Fraser (br0650) 1993 Liu, Truszczynski (br0660) 2015; vol. 9346 Charalambidis, Rondogiannis, Troumpoukis (br0600) 2021; 21 Leone, Pfeifer, Faber, Eiter, Gottlob, Perri, Scarcello (br0030) 2006; 7 Di Rosa, Giunchiglia, Maratea (br0460) 2008 Brewka, Niemelä, Syrjänen (br0060) 2004; 20 Papadimitriou (br0290) 1994 pp. 3:1–3:14. W. Faber, M. Truszczynski, S. Woltran, Abstract preference frameworks — a unifying perspective on separability and strong equivalence, in: desJardins and Littman Gebser, Kaminski, Kaufmann, Schaub (br0340) 2012 pp. 297–303. Brewka, Niemelä, Truszczyński (br0040) 2003 Son, Pontelli (br0070) 2006; 6 Ferraris (br0160) 2005; vol. 3662 Giordano, Dupré (br0740) 2021; vol. 345 Banbara, Soh, Tamura, Inoue, Schaub (br0430) 2013; 13 Lierler (br0540) 2022 Gebser, Kaufmann, Neumann, Schaub (br0280) 2007; vol. 4483 Brafman, Domshlak (br0500) 2009; 30 Brewka (br0050) 2004 Lehtonen, Wallner, Järvisalo (br0820) 2020 Gebser, Guyet, Quiniou, Romero, Schaub (br0800) 2016 (br0870) 2013 Janhunen, Oikarinen (br0260) 2004; vol. 3229 M. Banbara, M. Gebser, K. Inoue, M. Ostrowski, A. Peano, T. Schaub, T. Soh, N. Tamura, M. Weise, aspartame: Solving constraint satisfaction problems with answer set programming, in: Calimeri et al. pp. 348–360. Gebser, Kaminski, Kaufmann, Schaub (br0180) 2014; 14 G. Koçak, Ö. Akgün, T. Guns, I. Miguel, Exploiting incomparability in solution dominance: Improving general purpose constraint-based mining, in: De Giacomo et al. Gebser, Kaminski, Kaufmann, Schaub (br0090) 2019; 19 Buccafurri, Leone, Rullo (br0920) 2000; 12 Brewka, Truszczyński, Woltran (br0560) 2010 Giunchiglia, Maratea (br0220) 2012; vol. 7265 Eiter, Gottlob, Leone (br0320) 1997; 189 Gao, Fodor, Kifer (br0790) 2016; 16 Gebser, Kaminski, Kaufmann, Lindauer, Ostrowski, Romero, Schaub, Thiele, Wanko (br0330) 2019 Giordano, Dupré (br0730) 2020; 20 Alviano, Romero, Schaub (br0310) 2019 pp. 497–507. pp. 350–356. Di Rosa, Giunchiglia (br0370) 2013; 26 pp. 331–338. (br0860) 2016; vol. 52 (br0900) 2020 M. Gebser, H. Jost, R. Kaminski, P. Obermeier, O. Sabuncu, T. Schaub, M. Schneider, Ricochet robots: A transverse ASP benchmark, in: Cabalar and Son pp. 203–212. T. Eiter, R. Kiesel, Weighted LARS for quantitative stream reasoning, in: De Giacomo et al. Pareto (br0200) 1964 M. Bienvenu, J. Lang, N. Wilson, From preference logics to preference languages, and back, in: Lin and Sattler Giordano, Dupré (br0720) 2016; 16 M. Gebser, R. Kaminski, B. Kaufmann, J. Romero, T. Schaub, Progress in clasp series 3, in: Calimeri et al. M. Gebser, C. Guziolowski, M. Ivanchev, T. Schaub, A. Siegel, S. Thiele, P. Veber, Repair and prediction (under inconsistency) in large biological networks with answer set programming, in: Lin and Sattler Lifschitz, Turner (br0910) 1994 Huelsman, Truszczynski (br0590) 2022 Brewka, Niemelä, Truszczyński (br0520) 2008; 29 Y. Zhu, M. Truszczyński, On optimal solutions of answer set optimization problems, in: Cabalar and Son S. Coste-Marquis, J. Lang, P. Liberatore, P. Marquis, Expressive power and succinctness of propositional languages for preference representation, in: Lin and Sattler Bernreiter, Maly, Woltran (br0610) 2021 Ensan, Ternovska (br0550) 2019; vol. 11715 pp. 556–568. Giordano, Dupré (br0750) 2022; 22 Gelfond, Lifschitz (br0150) 1991; 9 Siddiqi (br0400) 2011 Kaminski, Romero, Schaub, Wanko (br0250) 2023; 23 M. Alviano, J. Romero, T. Schaub, Preference relations by approximation, in: Thielscher et al. Gebser, Kaminski, Schaub (br0240) 2011; 11 Niemelä (br0100) 1999; 25 pp. 729–736. pp. 2:1–2:15. (br0850) 2010 pp. 57–61. (br0880) 2013; vol. 8148 Lehtonen, Wallner, Järvisalo (br0810) 2021; 71 Booth, Chevaleyre, Lang, Mengin, Sombattheera (br0670) 2010 Guns, Stuckey, Tack (br0700) Rudolph, Schweizer, Tirtarasa (br0780) 2018; vol. 11092 Boutilier, Brafman, Domshlak, Hoos, Poole (br0300) 2004; 21 Goldsmith, Lang, Truszczynski, Wilson (br0680) 2008; 33 Simons, Niemelä, Soininen (br0020) 2002; 138 (br0890) 2018 pp. 158–172. Gebser (10.1016/j.artint.2023.104023_br0090) 2019; 19 Ferraris (10.1016/j.artint.2023.104023_br0160) 2005; vol. 3662 Boutilier (10.1016/j.artint.2023.104023_br0300) 2004; 21 Janhunen (10.1016/j.artint.2023.104023_br0260) 2004; vol. 3229 Domshlak (10.1016/j.artint.2023.104023_br0490) 2011; 175 (10.1016/j.artint.2023.104023_br0880) 2013; vol. 8148 Booth (10.1016/j.artint.2023.104023_br0670) 2010 Ensan (10.1016/j.artint.2023.104023_br0550) 2019; vol. 11715 Brewka (10.1016/j.artint.2023.104023_br0050) 2004 Giordano (10.1016/j.artint.2023.104023_br0740) 2021; vol. 345 Rudolph (10.1016/j.artint.2023.104023_br0780) 2018; vol. 11092 Di Rosa (10.1016/j.artint.2023.104023_br0370) 2013; 26 10.1016/j.artint.2023.104023_br0710 Son (10.1016/j.artint.2023.104023_br0070) 2006; 6 Gebser (10.1016/j.artint.2023.104023_br0340) 2012 Fraser (10.1016/j.artint.2023.104023_br0650) 1993 Brewka (10.1016/j.artint.2023.104023_br0040) 2003 Gebser (10.1016/j.artint.2023.104023_br0180) 2014; 14 Banbara (10.1016/j.artint.2023.104023_br0430) 2013; 13 10.1016/j.artint.2023.104023_br0830 Simons (10.1016/j.artint.2023.104023_br0020) 2002; 138 10.1016/j.artint.2023.104023_br0110 Kaminski (10.1016/j.artint.2023.104023_br0250) 2023; 23 Gebser (10.1016/j.artint.2023.104023_br0330) 2019 10.1016/j.artint.2023.104023_br0390 10.1016/j.artint.2023.104023_br0270 10.1016/j.artint.2023.104023_br0190 Lifschitz (10.1016/j.artint.2023.104023_br0910) 1994 Charalambidis (10.1016/j.artint.2023.104023_br0600) 2021; 21 Alviano (10.1016/j.artint.2023.104023_br0480) 2023; 320 (10.1016/j.artint.2023.104023_br0840) 2015; vol. 9345 Leone (10.1016/j.artint.2023.104023_br0030) 2006; 7 Di Rosa (10.1016/j.artint.2023.104023_br0460) 2008 Gao (10.1016/j.artint.2023.104023_br0790) 2016; 16 Brafman (10.1016/j.artint.2023.104023_br0500) 2009; 30 Giordano (10.1016/j.artint.2023.104023_br0750) 2022; 22 Niemelä (10.1016/j.artint.2023.104023_br0100) 1999; 25 Apt (10.1016/j.artint.2023.104023_br0140) 1987 Eiter (10.1016/j.artint.2023.104023_br0530) 2013; 13 Gebser (10.1016/j.artint.2023.104023_br0800) 2016 10.1016/j.artint.2023.104023_br0620 10.1016/j.artint.2023.104023_br0420 Lehtonen (10.1016/j.artint.2023.104023_br0820) 2020 Balduccini (10.1016/j.artint.2023.104023_br0630) 2003 Gebser (10.1016/j.artint.2023.104023_br0240) 2011; 11 Bigot (10.1016/j.artint.2023.104023_br0690) 2013 10.1016/j.artint.2023.104023_br0580 10.1016/j.artint.2023.104023_br0380 Eiter (10.1016/j.artint.2023.104023_br0770) 2020; 20 (10.1016/j.artint.2023.104023_br0900) 2020 Baral (10.1016/j.artint.2023.104023_br0010) 2003 Goldsmith (10.1016/j.artint.2023.104023_br0680) 2008; 33 Eiter (10.1016/j.artint.2023.104023_br0230) 1995; 15 Alviano (10.1016/j.artint.2023.104023_br0310) 2019 Brewka (10.1016/j.artint.2023.104023_br0060) 2004; 20 Delgrande (10.1016/j.artint.2023.104023_br0510) 2004; 20 Lehtonen (10.1016/j.artint.2023.104023_br0810) 2021; 71 Lierler (10.1016/j.artint.2023.104023_br0540) 2022 Di Rosa (10.1016/j.artint.2023.104023_br0080) 2010; 15 Brewka (10.1016/j.artint.2023.104023_br0560) 2010 (10.1016/j.artint.2023.104023_br0850) 2010 (10.1016/j.artint.2023.104023_br0890) 2018 Buccafurri (10.1016/j.artint.2023.104023_br0920) 2000; 12 (10.1016/j.artint.2023.104023_br0860) 2016; vol. 52 Gebser (10.1016/j.artint.2023.104023_br0280) 2007; vol. 4483 Eiter (10.1016/j.artint.2023.104023_br0320) 1997; 189 10.1016/j.artint.2023.104023_br0130 10.1016/j.artint.2023.104023_br0570 Pareto (10.1016/j.artint.2023.104023_br0200) 1964 10.1016/j.artint.2023.104023_br0450 Järvisalo (10.1016/j.artint.2023.104023_br0350) 2005; 44 (10.1016/j.artint.2023.104023_br0870) 2013 Calimeri (10.1016/j.artint.2023.104023_br0170) 2020; 20 Giordano (10.1016/j.artint.2023.104023_br0720) 2016; 16 Bernreiter (10.1016/j.artint.2023.104023_br0610) 2021 Brewka (10.1016/j.artint.2023.104023_br0520) 2008; 29 Papadimitriou (10.1016/j.artint.2023.104023_br0290) 1994 Giordano (10.1016/j.artint.2023.104023_br0730) 2020; 20 Gelfond (10.1016/j.artint.2023.104023_br0150) 1991; 9 Brewka (10.1016/j.artint.2023.104023_br0120) 2015 McCarthy (10.1016/j.artint.2023.104023_br0210) 1986; 28 Siddiqi (10.1016/j.artint.2023.104023_br0400) 2011 Liu (10.1016/j.artint.2023.104023_br0660) 2015; vol. 9346 Guns (10.1016/j.artint.2023.104023_br0700) Giunchiglia (10.1016/j.artint.2023.104023_br0220) 2012; vol. 7265 Bozzato (10.1016/j.artint.2023.104023_br0760) 2021; 21 Huelsman (10.1016/j.artint.2023.104023_br0590) 2022 10.1016/j.artint.2023.104023_br0640 10.1016/j.artint.2023.104023_br0440 10.1016/j.artint.2023.104023_br0360 Schaub (10.1016/j.artint.2023.104023_br0410) 2009; vol. 5649 Alviano (10.1016/j.artint.2023.104023_br0470) 2020; 30 |
| References_xml | – volume: 11 start-page: 821 year: 2011 end-page: 839 ident: br0240 article-title: Complex optimization in answer set programming publication-title: Theory Pract. Log. Program. – volume: 30 start-page: 58 year: 2009 end-page: 86 ident: br0500 article-title: Preference handling — an introductory tutorial publication-title: AI Mag. – volume: 26 start-page: 395 year: 2013 end-page: 408 ident: br0370 article-title: Combining approaches for solving satisfiability problems with qualitative preferences publication-title: AI Commun. – volume: 16 start-page: 703 year: 2016 end-page: 720 ident: br0790 article-title: Paraconsistency and word puzzles publication-title: Theory Pract. Log. Program. – volume: 189 start-page: 129 year: 1997 end-page: 177 ident: br0320 article-title: Abduction from logic programs: semantics and complexity publication-title: Theor. Comput. Sci. – start-page: 273 year: 2010 end-page: 278 ident: br0560 article-title: Representing preferences among sets publication-title: Proceedings of the Twenty-Fourth National Conference on Artificial Intelligence (AAAI'10) – volume: 6 start-page: 559 year: 2006 end-page: 608 ident: br0070 article-title: Planning with preferences using logic programming publication-title: Theory Pract. Log. Program. – volume: 15 start-page: 289 year: 1995 end-page: 323 ident: br0230 article-title: On the computational cost of disjunctive logic programming: propositional case publication-title: Ann. Math. Artif. Intell. – reference: , pp. 348–360. – start-page: 1467 year: 2015 end-page: 1474 ident: br0120 article-title: asprin: customizing answer set preferences without a headache publication-title: Proceedings of the Twenty-Ninth National Conference on Artificial Intelligence (AAAI'15) – start-page: 1794 year: 2021 end-page: 1800 ident: br0610 article-title: Choice logics and their computational properties publication-title: Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence (IJCAI'21) – year: 2018 ident: br0890 publication-title: Proceedings of the Sixteenth International Conference on Principles of Knowledge Representation and Reasoning (KR'18) – volume: 22 start-page: 589 year: 2022 end-page: 605 ident: br0750 article-title: An ASP approach for reasoning on neural networks under a finitely many-valued semantics for weighted conditional knowledge bases publication-title: Theory Pract. Log. Program. – reference: M. Alviano, J. Romero, T. Schaub, Preference relations by approximation, in: Thielscher et al. – start-page: 9 year: 2003 end-page: 18 ident: br0630 article-title: Logic programs with consistency-restoring rules publication-title: Proceedings of the International Symposium on Logical Formalization of Commonsense Reasoning (COMMONSENSE'03) – reference: M. Gebser, H. Jost, R. Kaminski, P. Obermeier, O. Sabuncu, T. Schaub, M. Schneider, Ricochet robots: A transverse ASP benchmark, in: Cabalar and Son – volume: 30 start-page: 863 year: 2020 end-page: 897 ident: br0470 article-title: Optimum stable model search: algorithms and implementation publication-title: J. Log. Comput. – volume: 138 start-page: 181 year: 2002 end-page: 234 ident: br0020 article-title: Extending and implementing the stable model semantics publication-title: Artif. Intell. – reference: Y. Zhu, M. Truszczyński, On optimal solutions of answer set optimization problems, in: Cabalar and Son – start-page: 636 year: 2020 end-page: 646 ident: br0820 article-title: An answer set programming approach to argumentative reasoning in the ASPIC+ framework publication-title: Proceedings of the Seventeenth International Conference on Principles of Knowledge Representation and Reasoning (KR'21) – reference: M. Gebser, R. Kaminski, B. Kaufmann, M. Ostrowski, T. Schaub, P. Wanko, Theory solving made easy with clingo 5, in: Carro and King – start-page: 1 year: 2022 end-page: 29 ident: br0540 article-title: An abstract view on optimizations in propositional frameworks publication-title: Theory Pract. Log. Program. – reference: , pp. 297–303. – volume: 12 start-page: 845 year: 2000 end-page: 860 ident: br0920 article-title: Enhancing disjunctive datalog by constraints publication-title: IEEE Trans. Knowl. Data Eng. – volume: vol. 5649 start-page: 312 year: 2009 end-page: 326 ident: br0410 article-title: Metabolic network expansion with ASP publication-title: Proceedings of the Twenty-Fifth International Conference on Logic Programming (ICLP'09) – year: 2013 ident: br0870 publication-title: Proceedings of the Twenty-Seventh National Conference on Artificial Intelligence (AAAI'13) – reference: W. Faber, M. Truszczynski, S. Woltran, Abstract preference frameworks — a unifying perspective on separability and strong equivalence, in: desJardins and Littman – start-page: 1087 year: 2011 end-page: 1092 ident: br0400 article-title: Computing minimum-cardinality diagnoses by model relaxation publication-title: Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence (IJCAI'11) – volume: 15 start-page: 485 year: 2010 end-page: 515 ident: br0080 article-title: Solving satisfiability problems with preferences publication-title: Constraints – reference: , pp. 497–507. – volume: 21 start-page: 629 year: 2021 end-page: 645 ident: br0600 article-title: A logical characterization of the preferred models of logic programs with ordered disjunction publication-title: Theory Pract. Log. Program. – volume: 29 start-page: 69 year: 2008 end-page: 78 ident: br0520 article-title: Preferences and nonmonotonic reasoning publication-title: AI Mag. – start-page: 269 year: 2010 end-page: 274 ident: br0670 article-title: Learning conditionally lexicographic preference relations publication-title: Proceedings of the Nineteenth European Conference on Artificial Intelligence (ECAI'10) – reference: , pp. 331–338. – start-page: 89 year: 1987 end-page: 148 ident: br0140 article-title: Towards a theory of declarative knowledge publication-title: Foundations of Deductive Databases and Logic Programming – year: 2022 ident: br0590 article-title: Relating preference languages by their expressive power publication-title: Proceedings of the Thirty-Fifth International Florida Artificial Intelligence Research Society Conference, FLAIRS 2022 – volume: 13 start-page: 783 year: 2013 end-page: 798 ident: br0430 article-title: Answer set programming as a modeling language for course timetabling publication-title: Theory Pract. Log. Program. – volume: vol. 11092 start-page: 185 year: 2018 end-page: 200 ident: br0780 article-title: Justifications for description logic knowledge bases under the fixed-domain semantics publication-title: Proceedings of the Second International Joint Conference on Rules and Reasoning (RuleML+RR'18) – volume: 28 start-page: 89 year: 1986 end-page: 116 ident: br0210 article-title: Applications of circumscription to formalizing common-sense knowledge publication-title: Artif. Intell. – year: 2020 ident: br0900 publication-title: Proceedings of the Twenty-Fourth European Conference on Artificial Intelligence (ECAI'20) – year: 2019 ident: br0330 article-title: Potassco User Guide, Version 2.2.0 Edition – reference: G. Brewka, J. Delgrande, J. Romero, T. Schaub, Implementing preferences with asprin, in: Calimeri et al. – volume: vol. 8148 year: 2013 ident: br0880 publication-title: Proceedings of the Twelfth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'13) – start-page: 1497 year: 2016 end-page: 1504 ident: br0800 article-title: Knowledge-based sequence mining with ASP publication-title: Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence (IJCAI'16) – volume: vol. 3229 start-page: 134 year: 2004 end-page: 146 ident: br0260 article-title: Capturing parallel circumscription with disjunctive logic programs publication-title: Proceedings of the Ninth European Conference on Logics in Artificial Intelligence (JELIA'04) – volume: 44 start-page: 373 year: 2005 end-page: 399 ident: br0350 article-title: Unrestricted vs restricted cut in a tableau method for Boolean circuits publication-title: Ann. Math. Artif. Intell. – volume: 20 start-page: 751 year: 2020 end-page: 766 ident: br0730 article-title: An ASP approach for reasoning in a concept-aware multipreferential lightweight DL publication-title: Theory Pract. Log. Program. – reference: , pp. 729–736. – reference: M. Banbara, M. Gebser, K. Inoue, M. Ostrowski, A. Peano, T. Schaub, T. Soh, N. Tamura, M. Weise, aspartame: Solving constraint satisfaction problems with answer set programming, in: Calimeri et al. – volume: vol. 3662 start-page: 119 year: 2005 end-page: 131 ident: br0160 article-title: Answer sets for propositional theories publication-title: Proceedings of the Eighth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'05) – reference: , pp. 112–126. – start-page: 72 year: 2013 end-page: 81 ident: br0690 article-title: Probabilistic conditional preference networks publication-title: Proceedings of the Twenty Ninth Conference on Uncertainty in Artificial Intelligence (UAI 2013) – ident: br0700 article-title: Solution dominance over constraint satisfaction problems – volume: 9 start-page: 365 year: 1991 end-page: 385 ident: br0150 article-title: Classical negation in logic programs and disjunctive databases publication-title: New Gener. Comput. – reference: G. Koçak, Ö. Akgün, T. Guns, I. Miguel, Exploiting incomparability in solution dominance: Improving general purpose constraint-based mining, in: De Giacomo et al. – reference: , pp. 158–172. – volume: vol. 9346 start-page: 19 year: 2015 end-page: 34 ident: br0660 article-title: Reasoning with preference trees over combinatorial domains publication-title: Algorithmic Decision Theory - 4th International Conference, ADT, Proceedings – reference: M. Gebser, C. Guziolowski, M. Ivanchev, T. Schaub, A. Siegel, S. Thiele, P. Veber, Repair and prediction (under inconsistency) in large biological networks with answer set programming, in: Lin and Sattler – volume: 20 start-page: 308 year: 2004 end-page: 334 ident: br0510 article-title: A classification and survey of preference handling approaches in nonmonotonic reasoning publication-title: Comput. Intell. – volume: vol. 9345 year: 2015 ident: br0840 publication-title: Proceedings of the Thirteenth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'15) – volume: vol. 11715 start-page: 57 year: 2019 end-page: 73 ident: br0550 article-title: A language–independent framework for reasoning about preferences for declarative problem solving publication-title: Frontiers of Combining Systems - 12th International Symposium, FroCoS, Proceedings – reference: , pp. 57–61. – volume: 23 start-page: 299 year: 2023 end-page: 361 ident: br0250 article-title: How to build your own asp-based system?! publication-title: Theory Pract. Log. Program. – reference: M. Bienvenu, J. Lang, N. Wilson, From preference logics to preference languages, and back, in: Lin and Sattler – volume: 20 start-page: 294 year: 2020 end-page: 309 ident: br0170 article-title: ASP-Core-2 input language format publication-title: Theory Pract. Log. Program. – reference: M. Gebser, R. Kaminski, B. Kaufmann, J. Romero, T. Schaub, Progress in clasp series 3, in: Calimeri et al. – reference: M. Gebser, B. Kaufmann, R. Otero, J. Romero, T. Schaub, P. Wanko, Domain-specific heuristics in answer set programming, in: desJardins and Littman – volume: 20 start-page: 335 year: 2004 end-page: 357 ident: br0060 article-title: Logic programs with ordered disjunction publication-title: Comput. Intell. – reference: S. Coste-Marquis, J. Lang, P. Liberatore, P. Marquis, Expressive power and succinctness of propositional languages for preference representation, in: Lin and Sattler – reference: , pp. 368–383. – volume: 25 start-page: 241 year: 1999 end-page: 273 ident: br0100 article-title: Logic programs with stable model semantics as a constraint programming paradigm publication-title: Ann. Math. Artif. Intell. – reference: , pp. 2–11. – volume: 33 start-page: 403 year: 2008 end-page: 432 ident: br0680 article-title: The computational complexity of dominance and consistency in cp-nets publication-title: J. Artif. Intell. Res. – year: 1994 ident: br0290 article-title: Computational Complexity – start-page: 510 year: 2008 end-page: 514 ident: br0460 article-title: A new approach for solving satisfiability problems with qualitative preferences publication-title: Proceedings of the Eighteenth European Conference on Artificial Intelligence (ECAI'08) – volume: vol. 7265 start-page: 327 year: 2012 end-page: 344 ident: br0220 article-title: Algorithms for solving satisfiability problems with qualitative preferences publication-title: Correct Reasoning: Essays on Logic-Based AI in Honour of Vladimir Lifschitz – start-page: 1495 year: 2019 end-page: 1501 ident: br0310 article-title: On the integration of cp-nets in ASPRIN publication-title: Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence (IJCAI'19) – reference: , pp. 2:1–2:15. – reference: , pp. 3:1–3:14. – volume: 21 start-page: 135 year: 2004 end-page: 191 ident: br0300 article-title: CP-nets: a tool for representing and reasoning with conditional ceteris paribus preference statements publication-title: J. Artif. Intell. Res. – volume: 20 start-page: 895 year: 2020 end-page: 910 ident: br0770 article-title: Asp( publication-title: Theory Pract. Log. Program. – year: 2003 ident: br0010 article-title: Knowledge Representation, Reasoning and Declarative Problem Solving – volume: vol. 4483 start-page: 136 year: 2007 end-page: 148 ident: br0280 article-title: Conflict-driven answer set enumeration publication-title: Proceedings of the Ninth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'07) – reference: J. Lee, Z. Yang, Computing logic programs with ordered disjunction using asprin, in: Thielscher et al. – reference: , pp. 350–356. – start-page: 213 year: 2004 end-page: 223 ident: br0050 article-title: Complex preferences for answer set optimization publication-title: Proceedings of the Ninth International Conference on Principles of Knowledge Representation and Reasoning (KR'04) – start-page: 867 year: 2003 end-page: 872 ident: br0040 article-title: Answer set optimization publication-title: Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence (IJCAI'03) – volume: 13 start-page: 303 year: 2013 end-page: 359 ident: br0530 article-title: Finding similar/diverse solutions in answer set programming publication-title: Theory Pract. Log. Program. – reference: J. Romero, T. Schaub, P. Wanko, Computing diverse optimal stable models, in: Carro and King – volume: vol. 345 start-page: 70 year: 2021 end-page: 76 ident: br0740 article-title: Weighted conditional EL publication-title: Technical Communications of the Thirty Seventh International Conference on Logic Programming (ICLP'21) – reference: T. Eiter, R. Kiesel, Weighted LARS for quantitative stream reasoning, in: De Giacomo et al. – year: 2012 ident: br0340 article-title: Answer Set Solving in Practice, Synthesis Lectures on Artificial Intelligence and Machine Learning – year: 2010 ident: br0850 publication-title: Proceedings of the Twelfth International Conference on Principles of Knowledge Representation and Reasoning (KR'10) – reference: , pp. 203–212. – volume: 7 start-page: 499 year: 2006 end-page: 562 ident: br0030 article-title: The DLV system for knowledge representation and reasoning publication-title: ACM Trans. Comput. Log. – volume: 320 year: 2023 ident: br0480 article-title: ASP and subset minimality: enumeration, cautious reasoning and MUSes publication-title: Artif. Intell. – volume: 16 start-page: 738 year: 2016 end-page: 754 ident: br0720 article-title: ASP for minimal entailment in a rational extension of SROEL publication-title: Theory Pract. Log. Program. – start-page: 23 year: 1994 end-page: 37 ident: br0910 article-title: Splitting a logic program publication-title: Proceedings of the Eleventh International Conference on Logic Programming – reference: , pp. 556–568. – start-page: 132 year: 1993 end-page: 136 ident: br0650 article-title: Applications of preference trees publication-title: Proceedings of the IEEE International Conference on Systems, Man and Cybernetics – reference: . – volume: 71 start-page: 265 year: 2021 end-page: 318 ident: br0810 article-title: Declarative algorithms and complexity results for assumption-based argumentation publication-title: J. Artif. Intell. Res. – volume: vol. 52 year: 2016 ident: br0860 publication-title: Technical Communications of the Thirty-Second International Conference on Logic Programming (ICLP'16) – volume: 175 start-page: 1037 year: 2011 end-page: 1052 ident: br0490 article-title: Preferences in AI: an overview publication-title: Artif. Intell. – volume: 19 start-page: 27 year: 2019 end-page: 82 ident: br0090 article-title: Multi-shot ASP solving with clingo publication-title: Theory Pract. Log. Program. – volume: 21 start-page: 593 year: 2021 end-page: 609 ident: br0760 article-title: Reasoning on multirelational contextual hierarchies via answer set programming with algebraic measures publication-title: Theory Pract. Log. Program. – volume: 14 year: 2014 ident: br0180 article-title: Clingo = ASP + control: preliminary report publication-title: Technical Communications of the Thirtieth International Conference on Logic Programming (ICLP'14) – year: 1964 ident: br0200 article-title: Cours d'economie politique – volume: 13 start-page: 783 issue: 4–5 year: 2013 ident: 10.1016/j.artint.2023.104023_br0430 article-title: Answer set programming as a modeling language for course timetabling publication-title: Theory Pract. Log. Program. doi: 10.1017/S1471068413000495 – start-page: 1794 year: 2021 ident: 10.1016/j.artint.2023.104023_br0610 article-title: Choice logics and their computational properties – volume: 14 issue: 4–5 year: 2014 ident: 10.1016/j.artint.2023.104023_br0180 article-title: Clingo = ASP + control: preliminary report publication-title: Theory Pract. Log. Program. – ident: 10.1016/j.artint.2023.104023_br0450 – volume: 21 start-page: 593 issue: 5 year: 2021 ident: 10.1016/j.artint.2023.104023_br0760 article-title: Reasoning on multirelational contextual hierarchies via answer set programming with algebraic measures publication-title: Theory Pract. Log. Program. doi: 10.1017/S1471068421000284 – ident: 10.1016/j.artint.2023.104023_br0190 – volume: 23 start-page: 299 issue: 1 year: 2023 ident: 10.1016/j.artint.2023.104023_br0250 article-title: How to build your own asp-based system?! publication-title: Theory Pract. Log. Program. doi: 10.1017/S1471068421000508 – volume: 16 start-page: 738 issue: 5–6 year: 2016 ident: 10.1016/j.artint.2023.104023_br0720 article-title: ASP for minimal entailment in a rational extension of SROEL publication-title: Theory Pract. Log. Program. doi: 10.1017/S1471068416000399 – volume: vol. 7265 start-page: 327 year: 2012 ident: 10.1016/j.artint.2023.104023_br0220 article-title: Algorithms for solving satisfiability problems with qualitative preferences – volume: vol. 3662 start-page: 119 year: 2005 ident: 10.1016/j.artint.2023.104023_br0160 article-title: Answer sets for propositional theories – ident: 10.1016/j.artint.2023.104023_br0440 doi: 10.1007/978-3-319-23264-5_31 – year: 2018 ident: 10.1016/j.artint.2023.104023_br0890 – year: 2020 ident: 10.1016/j.artint.2023.104023_br0900 – volume: 30 start-page: 58 issue: 1 year: 2009 ident: 10.1016/j.artint.2023.104023_br0500 article-title: Preference handling — an introductory tutorial publication-title: AI Mag. – ident: 10.1016/j.artint.2023.104023_br0710 – volume: 44 start-page: 373 issue: 4 year: 2005 ident: 10.1016/j.artint.2023.104023_br0350 article-title: Unrestricted vs restricted cut in a tableau method for Boolean circuits publication-title: Ann. Math. Artif. Intell. doi: 10.1007/s10472-005-7034-1 – volume: vol. 11715 start-page: 57 year: 2019 ident: 10.1016/j.artint.2023.104023_br0550 article-title: A language–independent framework for reasoning about preferences for declarative problem solving – ident: 10.1016/j.artint.2023.104023_br0270 – ident: 10.1016/j.artint.2023.104023_br0620 – year: 2010 ident: 10.1016/j.artint.2023.104023_br0850 – ident: 10.1016/j.artint.2023.104023_br0420 – volume: vol. 9346 start-page: 19 year: 2015 ident: 10.1016/j.artint.2023.104023_br0660 article-title: Reasoning with preference trees over combinatorial domains – volume: vol. 52 year: 2016 ident: 10.1016/j.artint.2023.104023_br0860 – volume: 138 start-page: 181 issue: 1–2 year: 2002 ident: 10.1016/j.artint.2023.104023_br0020 article-title: Extending and implementing the stable model semantics publication-title: Artif. Intell. doi: 10.1016/S0004-3702(02)00187-X – volume: vol. 8148 year: 2013 ident: 10.1016/j.artint.2023.104023_br0880 – volume: vol. 9345 year: 2015 ident: 10.1016/j.artint.2023.104023_br0840 – volume: 6 start-page: 559 issue: 5 year: 2006 ident: 10.1016/j.artint.2023.104023_br0070 article-title: Planning with preferences using logic programming publication-title: Theory Pract. Log. Program. doi: 10.1017/S1471068406002717 – start-page: 1497 year: 2016 ident: 10.1016/j.artint.2023.104023_br0800 article-title: Knowledge-based sequence mining with ASP – volume: 9 start-page: 365 year: 1991 ident: 10.1016/j.artint.2023.104023_br0150 article-title: Classical negation in logic programs and disjunctive databases publication-title: New Gener. Comput. doi: 10.1007/BF03037169 – start-page: 1495 year: 2019 ident: 10.1016/j.artint.2023.104023_br0310 article-title: On the integration of cp-nets in ASPRIN – start-page: 1 year: 2022 ident: 10.1016/j.artint.2023.104023_br0540 article-title: An abstract view on optimizations in propositional frameworks publication-title: Theory Pract. Log. Program. – year: 2013 ident: 10.1016/j.artint.2023.104023_br0870 – volume: 19 start-page: 27 issue: 1 year: 2019 ident: 10.1016/j.artint.2023.104023_br0090 article-title: Multi-shot ASP solving with clingo publication-title: Theory Pract. Log. Program. doi: 10.1017/S1471068418000054 – year: 1994 ident: 10.1016/j.artint.2023.104023_br0290 – volume: 16 start-page: 703 issue: 5–6 year: 2016 ident: 10.1016/j.artint.2023.104023_br0790 article-title: Paraconsistency and word puzzles publication-title: Theory Pract. Log. Program. doi: 10.1017/S1471068416000326 – volume: 15 start-page: 289 issue: 3–4 year: 1995 ident: 10.1016/j.artint.2023.104023_br0230 article-title: On the computational cost of disjunctive logic programming: propositional case publication-title: Ann. Math. Artif. Intell. doi: 10.1007/BF01536399 – volume: 189 start-page: 129 issue: 1–2 year: 1997 ident: 10.1016/j.artint.2023.104023_br0320 article-title: Abduction from logic programs: semantics and complexity publication-title: Theor. Comput. Sci. doi: 10.1016/S0304-3975(96)00179-X – year: 2019 ident: 10.1016/j.artint.2023.104023_br0330 – volume: 320 year: 2023 ident: 10.1016/j.artint.2023.104023_br0480 article-title: ASP and subset minimality: enumeration, cautious reasoning and MUSes publication-title: Artif. Intell. doi: 10.1016/j.artint.2023.103931 – volume: 20 start-page: 895 issue: 6 year: 2020 ident: 10.1016/j.artint.2023.104023_br0770 article-title: Asp(AC): answer set programming with algebraic constraints publication-title: Theory Pract. Log. Program. doi: 10.1017/S1471068420000393 – ident: 10.1016/j.artint.2023.104023_br0360 doi: 10.1609/aaai.v27i1.8585 – volume: 20 start-page: 335 issue: 2 year: 2004 ident: 10.1016/j.artint.2023.104023_br0060 article-title: Logic programs with ordered disjunction publication-title: Comput. Intell. doi: 10.1111/j.0824-7935.2004.00241.x – volume: 25 start-page: 241 issue: 3–4 year: 1999 ident: 10.1016/j.artint.2023.104023_br0100 article-title: Logic programs with stable model semantics as a constraint programming paradigm publication-title: Ann. Math. Artif. Intell. doi: 10.1023/A:1018930122475 – volume: vol. 4483 start-page: 136 year: 2007 ident: 10.1016/j.artint.2023.104023_br0280 article-title: Conflict-driven answer set enumeration – start-page: 1087 year: 2011 ident: 10.1016/j.artint.2023.104023_br0400 article-title: Computing minimum-cardinality diagnoses by model relaxation – start-page: 89 year: 1987 ident: 10.1016/j.artint.2023.104023_br0140 article-title: Towards a theory of declarative knowledge – ident: 10.1016/j.artint.2023.104023_br0110 doi: 10.1007/978-3-319-23264-5_10 – volume: 21 start-page: 135 year: 2004 ident: 10.1016/j.artint.2023.104023_br0300 article-title: CP-nets: a tool for representing and reasoning with conditional ceteris paribus preference statements publication-title: J. Artif. Intell. Res. doi: 10.1613/jair.1234 – volume: vol. 5649 start-page: 312 year: 2009 ident: 10.1016/j.artint.2023.104023_br0410 article-title: Metabolic network expansion with ASP – ident: 10.1016/j.artint.2023.104023_br0580 – ident: 10.1016/j.artint.2023.104023_br0830 – volume: 29 start-page: 69 issue: 4 year: 2008 ident: 10.1016/j.artint.2023.104023_br0520 article-title: Preferences and nonmonotonic reasoning publication-title: AI Mag. – volume: 12 start-page: 845 issue: 5 year: 2000 ident: 10.1016/j.artint.2023.104023_br0920 article-title: Enhancing disjunctive datalog by constraints publication-title: IEEE Trans. Knowl. Data Eng. doi: 10.1109/69.877512 – volume: 175 start-page: 1037 issue: 7–8 year: 2011 ident: 10.1016/j.artint.2023.104023_br0490 article-title: Preferences in AI: an overview publication-title: Artif. Intell. doi: 10.1016/j.artint.2011.03.004 – volume: vol. 11092 start-page: 185 year: 2018 ident: 10.1016/j.artint.2023.104023_br0780 article-title: Justifications for description logic knowledge bases under the fixed-domain semantics – volume: 20 start-page: 294 issue: 2 year: 2020 ident: 10.1016/j.artint.2023.104023_br0170 article-title: ASP-Core-2 input language format publication-title: Theory Pract. Log. Program. doi: 10.1017/S1471068419000450 – start-page: 273 year: 2010 ident: 10.1016/j.artint.2023.104023_br0560 article-title: Representing preferences among sets – ident: 10.1016/j.artint.2023.104023_br0380 doi: 10.1007/978-3-642-40564-8_55 – volume: 22 start-page: 589 issue: 4 year: 2022 ident: 10.1016/j.artint.2023.104023_br0750 article-title: An ASP approach for reasoning on neural networks under a finitely many-valued semantics for weighted conditional knowledge bases publication-title: Theory Pract. Log. Program. doi: 10.1017/S1471068422000163 – volume: 28 start-page: 89 year: 1986 ident: 10.1016/j.artint.2023.104023_br0210 article-title: Applications of circumscription to formalizing common-sense knowledge publication-title: Artif. Intell. doi: 10.1016/0004-3702(86)90032-9 – volume: 13 start-page: 303 issue: 3 year: 2013 ident: 10.1016/j.artint.2023.104023_br0530 article-title: Finding similar/diverse solutions in answer set programming publication-title: Theory Pract. Log. Program. doi: 10.1017/S1471068411000548 – volume: 20 start-page: 308 issue: 2 year: 2004 ident: 10.1016/j.artint.2023.104023_br0510 article-title: A classification and survey of preference handling approaches in nonmonotonic reasoning publication-title: Comput. Intell. doi: 10.1111/j.0824-7935.2004.00240.x – volume: 33 start-page: 403 year: 2008 ident: 10.1016/j.artint.2023.104023_br0680 article-title: The computational complexity of dominance and consistency in cp-nets publication-title: J. Artif. Intell. Res. doi: 10.1613/jair.2627 – year: 1964 ident: 10.1016/j.artint.2023.104023_br0200 – ident: 10.1016/j.artint.2023.104023_br0130 doi: 10.1007/978-3-319-23264-5_15 – year: 2012 ident: 10.1016/j.artint.2023.104023_br0340 – start-page: 867 year: 2003 ident: 10.1016/j.artint.2023.104023_br0040 article-title: Answer set optimization – volume: 26 start-page: 395 issue: 4 year: 2013 ident: 10.1016/j.artint.2023.104023_br0370 article-title: Combining approaches for solving satisfiability problems with qualitative preferences publication-title: AI Commun. doi: 10.3233/AIC-130575 – volume: 7 start-page: 499 issue: 3 year: 2006 ident: 10.1016/j.artint.2023.104023_br0030 article-title: The DLV system for knowledge representation and reasoning publication-title: ACM Trans. Comput. Log. doi: 10.1145/1149114.1149117 – start-page: 9 year: 2003 ident: 10.1016/j.artint.2023.104023_br0630 article-title: Logic programs with consistency-restoring rules – volume: vol. 345 start-page: 70 year: 2021 ident: 10.1016/j.artint.2023.104023_br0740 article-title: Weighted conditional EL⊥ knowledge bases with integer weights: an ASP approach – volume: vol. 3229 start-page: 134 year: 2004 ident: 10.1016/j.artint.2023.104023_br0260 article-title: Capturing parallel circumscription with disjunctive logic programs – ident: 10.1016/j.artint.2023.104023_br0570 doi: 10.1609/aaai.v27i1.8593 – start-page: 636 year: 2020 ident: 10.1016/j.artint.2023.104023_br0820 article-title: An answer set programming approach to argumentative reasoning in the ASPIC+ framework – start-page: 1467 year: 2015 ident: 10.1016/j.artint.2023.104023_br0120 article-title: asprin: customizing answer set preferences without a headache – start-page: 23 year: 1994 ident: 10.1016/j.artint.2023.104023_br0910 article-title: Splitting a logic program – start-page: 213 year: 2004 ident: 10.1016/j.artint.2023.104023_br0050 article-title: Complex preferences for answer set optimization – volume: 11 start-page: 821 issue: 4–5 year: 2011 ident: 10.1016/j.artint.2023.104023_br0240 article-title: Complex optimization in answer set programming publication-title: Theory Pract. Log. Program. doi: 10.1017/S1471068411000329 – ident: 10.1016/j.artint.2023.104023_br0390 doi: 10.1007/978-3-642-40564-8_35 – volume: 30 start-page: 863 issue: 4 year: 2020 ident: 10.1016/j.artint.2023.104023_br0470 article-title: Optimum stable model search: algorithms and implementation publication-title: J. Log. Comput. doi: 10.1093/logcom/exv061 – start-page: 269 year: 2010 ident: 10.1016/j.artint.2023.104023_br0670 article-title: Learning conditionally lexicographic preference relations – ident: 10.1016/j.artint.2023.104023_br0700 – volume: 15 start-page: 485 issue: 4 year: 2010 ident: 10.1016/j.artint.2023.104023_br0080 article-title: Solving satisfiability problems with preferences publication-title: Constraints doi: 10.1007/s10601-010-9095-y – volume: 20 start-page: 751 issue: 5 year: 2020 ident: 10.1016/j.artint.2023.104023_br0730 article-title: An ASP approach for reasoning in a concept-aware multipreferential lightweight DL publication-title: Theory Pract. Log. Program. doi: 10.1017/S1471068420000381 – volume: 21 start-page: 629 issue: 5 year: 2021 ident: 10.1016/j.artint.2023.104023_br0600 article-title: A logical characterization of the preferred models of logic programs with ordered disjunction publication-title: Theory Pract. Log. Program. doi: 10.1017/S1471068421000235 – start-page: 132 year: 1993 ident: 10.1016/j.artint.2023.104023_br0650 article-title: Applications of preference trees – year: 2022 ident: 10.1016/j.artint.2023.104023_br0590 article-title: Relating preference languages by their expressive power – volume: 71 start-page: 265 year: 2021 ident: 10.1016/j.artint.2023.104023_br0810 article-title: Declarative algorithms and complexity results for assumption-based argumentation publication-title: J. Artif. Intell. Res. doi: 10.1613/jair.1.12479 – year: 2003 ident: 10.1016/j.artint.2023.104023_br0010 – ident: 10.1016/j.artint.2023.104023_br0640 – start-page: 72 year: 2013 ident: 10.1016/j.artint.2023.104023_br0690 article-title: Probabilistic conditional preference networks – start-page: 510 year: 2008 ident: 10.1016/j.artint.2023.104023_br0460 article-title: A new approach for solving satisfiability problems with qualitative preferences |
| SSID | ssj0003991 |
| Score | 2.4342456 |
| Snippet | We introduce a general, flexible, and extensible framework for quantitative and qualitative preferences among the stable models of logic programs. Since it is... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 104023 |
| SubjectTerms | Answer set programming Optimization Preferences |
| Title | A general framework for preferences in answer set programming |
| URI | https://dx.doi.org/10.1016/j.artint.2023.104023 |
| Volume | 325 |
| WOSCitedRecordID | wos001088302000001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1872-7921 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0003991 issn: 0004-3702 databaseCode: AIEXJ dateStart: 20211211 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1JS8QwFA46evDiLu7k4E0qbdqa9OBhEEU9iIcR5lbSJMW1M8yMy8_3ZWvrgstBCqWUJi19H29JvvceQntxUQoRChKEkqgAFF4UsIKqQIG6TLmI9Gq_aTZBLy9Zv59dOdrY2LQToFXFXl-z4b-KGu6BsHXq7B_EXU8KN-AahA5nEDucfyX4ru6KrFea9ktPvDJcwmHdUcRQYMFEaX78WE08R-vRW7G6KK3hEZmuHq3CnU0Ar17uuV1XH_nkfOMTK93UqLL1fA0Lt9nVeVQ2r-aCa3vc7ALd8CezMdQbgDfqstPcWgSJW7wOr18TUFnhO_0ak7SlISH8C22G8SflbdcR7g5M_QTNcyXxQfP4-1rZH2xYzSz0pLW73M6S61lyO8s0miE0zVgHzXTPT_oXtcUGJ811VrRf71MsDQ_w89d87cK03JLeIpp38QTuWhwsoSlVLaMF36sDO9W9go662MEC17DAAAvcggW-rbCFBQZY4BYsVtH16Unv-CxwrTMCATHgJKCSsoQnMi0YT8okilQaZwJi6zKKeCEZY0kqacapkCLhIuOSSHDeSkoPeQhHvIY61aBS6wiTpEhTGB1KVoInQzIwC0VZcnqopC6mt4Fi_zdy4erK6_YmD_l3sthAQT1qaOuq_PA89T86d76h9flyQM-3Izf_-KYtNNdAext1JqMntYNmxfPkdjzaddB5Ay-9h14 |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+general+framework+for+preferences+in+answer+set+programming&rft.jtitle=Artificial+intelligence&rft.au=Brewka%2C+Gerhard&rft.au=Delgrande%2C+James&rft.au=Romero%2C+Javier&rft.au=Schaub%2C+Torsten&rft.date=2023-12-01&rft.issn=0004-3702&rft.volume=325&rft.spage=104023&rft_id=info:doi/10.1016%2Fj.artint.2023.104023&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_artint_2023_104023 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0004-3702&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0004-3702&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0004-3702&client=summon |