{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:30:53Z","timestamp":1761611453371,"version":"3.37.3"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2018,6,9]],"date-time":"2018-06-09T00:00:00Z","timestamp":1528502400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["SCH 550\/9"],"award-info":[{"award-number":["SCH 550\/9"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002428","name":"Austrian Science Fund","doi-asserted-by":"publisher","award":["Y698"],"award-info":[{"award-number":["Y698"]}],"id":[{"id":"10.13039\/501100002428","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["K\u00fcnstl Intell"],"published-print":{"date-parts":[[2018,8]]},"DOI":"10.1007\/s13218-018-0550-z","type":"journal-article","created":{"date-parts":[[2018,6,9]],"date-time":"2018-06-09T15:57:52Z","timestamp":1528559872000},"page":"105-108","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Answer set programming unleashed!"],"prefix":"10.1007","volume":"32","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7456-041X","authenticated-orcid":false,"given":"Torsten","family":"Schaub","sequence":"first","affiliation":[]},{"given":"Stefan","family":"Woltran","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,6,9]]},"reference":[{"key":"550_CR1","volume-title":"Foundations of databases","author":"S Abiteboul","year":"1995","unstructured":"Abiteboul S, Hull R, Vianu V (1995) Foundations of databases. Addison-Wesley, Boston"},{"key":"550_CR2","doi-asserted-by":"crossref","unstructured":"Alviano M, Dodaro C, Leone N, Ricca F (2015) Advances in WASP. In: Calimeri E, Ianni G, Truszczy\u0144ski (eds) Proceedings of the thirteenth international conference on logic programming and nonmonotonic reasoning (LPNMR\u201915). Lecture notes in artificial intelligence, vol 9345. Springer, Berlin, pp 40\u201354 (2015)","DOI":"10.1007\/978-3-319-23264-5_5"},{"key":"550_CR3","doi-asserted-by":"crossref","unstructured":"Alviano M, Faber W (2018) Aggregates in answer set programming. K++nstliche Intelligenz","DOI":"10.1007\/s13218-018-0545-9"},{"key":"550_CR4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511543357","volume-title":"Knowledge representation, reasoning and declarative problem solving","author":"C Baral","year":"2003","unstructured":"Baral C (2003) Knowledge representation, reasoning and declarative problem solving. Cambridge University Press, Cambridge"},{"key":"550_CR5","unstructured":"Barrett C, Sebastiani R, Seshia S, Tinelli C (2018) Satisfiability modulo theories. In: Biere et al. (ed) Chap. 26, pp 825\u2013885"},{"key":"550_CR6","unstructured":"Bidoit N, Froidevaux C (1987) Minimalism subsumes default logic and circumscription in stratified logic programming. In: Proceedings of the second annual symposium on logic in computer science (LICS\u201987), IEEE Computer Society Press, Washington, DC, pp 89\u201397"},{"volume-title":"Handbook of satisfiability. Frontiers in artificial intelligence and applications","year":"2009","key":"550_CR7","unstructured":"Biere A, Heule M, van Maaren H, Walsh T (eds) (2009) Handbook of satisfiability. Frontiers in artificial intelligence and applications, vol 185. IOS Press, Amsterdam"},{"key":"550_CR8","doi-asserted-by":"crossref","unstructured":"Brewka G, Delgrande J, Romero J, Schaub T (2015) Asprin: customizing answer set preferences without a headache. In: Bonet B, Koenig S (eds) Proceedings of the twenty-ninth national conference on artificial intelligence (AAAI\u201915), AAAI Press, Palo Alto, pp 1467\u20131474. http:\/\/www.aaai.org\/ocs\/index.php\/AAAI\/AAAI15\/paper\/view\/9535","DOI":"10.1609\/aaai.v29i1.9398"},{"issue":"12","key":"550_CR9","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1145\/2043174.2043195","volume":"54","author":"G Brewka","year":"2011","unstructured":"Brewka G, Eiter T, Truszczy\u0144ski M (2011) Answer set programming at a glance. Commun ACM 54(12):92\u2013103","journal-title":"Commun ACM"},{"key":"550_CR10","doi-asserted-by":"crossref","unstructured":"Cabalar P, Pearce D, Valverde A (2018) Answer set programming from a logical point of view. K++nstliche Intelligenz","DOI":"10.1007\/s13218-018-0547-7"},{"key":"550_CR11","unstructured":"Calimeri F, Faber W, Gebser M, Ianni G, Kaminski R, Krennwallner T, Leone N, Ricca F, Schaub T (2012) ASP-Core-2: input language format. https:\/\/www.mat.unical.it\/aspcomp2013\/ASPStandardization"},{"key":"550_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-83952-8","volume-title":"Logic programming and databases","author":"S Ceri","year":"1990","unstructured":"Ceri S, Gottlob G, Tanca L (1990) Logic programming and databases. Springer, Berlin"},{"key":"550_CR13","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/978-1-4684-3384-5_11","volume-title":"Logic and data bases","author":"K Clark","year":"1978","unstructured":"Clark K (1978) Negation as failure. In: Gallaire H, Minker J (eds) Logic and data bases. Plenum Press, Berlin, pp 293\u2013322"},{"key":"550_CR14","volume-title":"Programming in Prolog","author":"W Clocksin","year":"1981","unstructured":"Clocksin W (1981) Programming in Prolog. Springer, Berlin"},{"key":"550_CR15","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1145\/368273.368557","volume":"5","author":"M Davis","year":"1962","unstructured":"Davis M, Logemann G, Loveland D (1962) A machine program for theorem-proving. Commun ACM 5:394\u2013397","journal-title":"Commun ACM"},{"key":"550_CR16","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1145\/321033.321034","volume":"7","author":"M Davis","year":"1960","unstructured":"Davis M, Putnam H (1960) A computing procedure for quantification theory. J ACM 7:201\u2013215","journal-title":"J ACM"},{"key":"550_CR17","volume-title":"Constraint processing","author":"R Dechter","year":"2003","unstructured":"Dechter R (2003) Constraint processing. Morgan Kaufmann Publishers, Burlington"},{"key":"550_CR18","doi-asserted-by":"crossref","unstructured":"Eiter T, Ianni G, Krennwallner T (2009) Answer set programming: a primer. In: Tessaris S, Franconi E, Eiter T, Gutierrez C, Handschuh S, Rousset M, Schmidt R (eds) Fifth international reasoning web summer school (RW\u201909). Lecture notes in computer science, vol 5689. Springer, Berlin, pp 40\u2013110. http:\/\/www.kr.tuwien.ac.at\/staff\/tkren\/pub\/2009\/rw2009-asp.pdf","DOI":"10.1007\/978-3-642-03754-2_2"},{"issue":"3","key":"550_CR19","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1609\/aimag.v37i3.2678","volume":"37","author":"E Erdem","year":"2016","unstructured":"Erdem E, Gelfond M, Leone N (2016) Applications of ASP. AI Mag 37(3):53\u201368","journal-title":"AI Mag"},{"key":"550_CR20","doi-asserted-by":"crossref","unstructured":"Falkner A, Friedrich G, Schekotihin K, Taupe R, Teppan E (2018) Industrial applications of answer set programming. K++nstliche Intelligenz (to appear)","DOI":"10.1007\/s13218-018-0548-6"},{"key":"550_CR21","doi-asserted-by":"crossref","unstructured":"Febbraro O, Reale K, Ricca F (2011) ASPIDE: integrated development environment for answer set programming. In: Delgrande J, Faber W (eds) Proceedings of the eleventh international conference on logic programming and nonmonotonic reasoning (LPNMR\u201911). Lecture notes in artificial intelligence, vol 6645. Springer, Berlin, pp 317\u2013330","DOI":"10.1007\/978-3-642-20895-9_37"},{"key":"550_CR22","volume-title":"Answer set solving in practice. Synthesis lectures on artificial intelligence and machine learning","author":"M Gebser","year":"2012","unstructured":"Gebser M, Kaminski R, Kaufmann B, Schaub T (2012) Answer set solving in practice. Synthesis lectures on artificial intelligence and machine learning. Morgan and Claypool Publishers, San Rafael"},{"key":"550_CR23","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.artint.2012.04.001","volume":"187\u2013188","author":"M Gebser","year":"2012","unstructured":"Gebser M, Kaufmann B, Schaub T (2012) Conflict-driven answer set solving: from theory to practice. Artif Intell 187\u2013188:52\u201389","journal-title":"Artif Intell"},{"issue":"3","key":"550_CR24","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1609\/aimag.v37i3.2673","volume":"37","author":"M Gebser","year":"2016","unstructured":"Gebser M, Schaub T (2016) Modeling and language extensions. AI Mag 37(3):33\u201344","journal-title":"AI Mag"},{"key":"550_CR25","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139342124","volume-title":"Knowledge representation, reasoning, and the design of intelligent agents: the answer-set programming approach","author":"M Gelfond","year":"2014","unstructured":"Gelfond M, Kahl Y (2014) Knowledge representation, reasoning, and the design of intelligent agents: the answer-set programming approach. Cambridge University Press, Cambridge"},{"key":"550_CR26","unstructured":"Gelfond M, Lifschitz V (1988) The stable model semantics for logic programming. In: Kowalski R, Bowen K (eds) Proceedings of the fifth international conference and symposium of logic programming (ICLP\u201988), MIT Press, Cambridge, pp 1070\u20131080"},{"key":"550_CR27","doi-asserted-by":"crossref","unstructured":"Heyting A (1986) Die formalen Regeln der intuitionistischen Logik. In: Sitzungsberichte der Preussischen Akademie der Wissenschaften, pp 42\u201356. Deutsche Akademie der Wissenschaften zu Berlin (1930). Reprint in Logik-Texte: Kommentierte Auswahl zur Geschichte der Modernen Logik, Akademie-Verlag","DOI":"10.1515\/9783112645826-009"},{"key":"550_CR28","doi-asserted-by":"crossref","unstructured":"Kaminski R, Schaub T, Wanko P (2017) A tutorial on hybrid answer set solving with clingo. In: Ianni G, Lembo D, Bertossi L, Faber W, Glimm B, Gottlob G, Staab S (eds) Proceedings of the thirteenth international summer school of the reasoning web. Lecture notes in computer science, vol 10370. Springer, Berlin, pp 167\u2013203","DOI":"10.1007\/978-3-319-61033-7_6"},{"issue":"3","key":"550_CR29","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1609\/aimag.v37i3.2672","volume":"37","author":"B Kaufmann","year":"2016","unstructured":"Kaufmann B, Leone N, Perri S, Schaub T (2016) Grounding and solving in answer set programming. AI Mag 37(3):25\u201332","journal-title":"AI Mag"},{"key":"550_CR30","unstructured":"Kowalski R (1974) Predicate logic as programming language. In: Proceedings IFIP Congress, North-Holland Publishing Company, Amsterdam, pp 569\u2013574"},{"issue":"3","key":"550_CR31","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1145\/1149114.1149117","volume":"7","author":"N Leone","year":"2006","unstructured":"Leone N, Pfeifer G, Faber W, Eiter T, Gottlob G, Perri S, Scarcello F (2006) The DLV system for knowledge representation and reasoning. ACM Trans Comput Logic 7(3):499\u2013562","journal-title":"ACM Trans Comput Logic"},{"issue":"2","key":"550_CR32","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1145\/1131313.1131316","volume":"7","author":"V Lifschitz","year":"2006","unstructured":"Lifschitz V, Razborov A (2006) Why are there so many loop formulas? ACM Trans Comput Logic 7(2):261\u2013268","journal-title":"ACM Trans Comput Logic"},{"key":"550_CR33","unstructured":"Lin F, Zhao Y (2002) ASSAT: computing answer sets of a logic program by SAT solvers. In: Proceedings of the national conference on artificial intelligence (AAAI), AAAI\/MIT Press, Cambridge, pp 112\u2013118"},{"issue":"5","key":"550_CR34","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1109\/12.769433","volume":"48","author":"J Marques-Silva","year":"1999","unstructured":"Marques-Silva J, Sakallah K (1999) GRASP: a search algorithm for propositional satisfiability. IEEE Trans Comput 48(5):506\u2013521","journal-title":"IEEE Trans Comput"},{"key":"550_CR35","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/0004-3702(86)90032-9","volume":"28","author":"J McCarthy","year":"1986","unstructured":"McCarthy J (1986) Applications of circumscription to formalizing common-sense knowledge. Artif Intell 28:89\u2013116","journal-title":"Artif Intell"},{"key":"550_CR36","unstructured":"McCarthy J (1998) Elaboration tolerance. http:\/\/www-formal.stanford.edu\/jmc\/elaboration.html"},{"issue":"3\u20134","key":"550_CR37","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1023\/A:1018930122475","volume":"25","author":"I Niemel\u00e4","year":"1999","unstructured":"Niemel\u00e4 I (1999) Logic programs with stable model semantics as a constraint programming paradigm. Ann Math Artif Intell 25(3\u20134):241\u2013273","journal-title":"Ann Math Artif Intell"},{"issue":"4\u20136","key":"550_CR38","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1017\/S1471068410000256","volume":"10","author":"J Oetsch","year":"2010","unstructured":"Oetsch J, P\u00fchrer J, Tompits H (2010) Catching the ouroboros: on debugging non-ground answer-set programs. Theory Pract Logic Program 10(4\u20136):513\u2013529","journal-title":"Theory Pract Logic Program"},{"issue":"1\u20132","key":"550_CR39","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10472-006-9028-z","volume":"47","author":"D Pearce","year":"2006","unstructured":"Pearce D (2006) Equilibrium logic. Ann Math Artif Intell 47(1\u20132):3\u201341","journal-title":"Ann Math Artif Intell"},{"key":"550_CR40","doi-asserted-by":"crossref","unstructured":"Pearce D, Tompits H, Woltran S (2001) Encodings for equilibrium logic and logic programs with nested expressions. In: Brazdil P, Jorge A (eds) Proceedings of the tenth Portuguese conference on artificial intelligence (EPIA\u201901). Lecture notes in computer science, vol 2258. Springer, Berlin, pp 306\u2013320","DOI":"10.1007\/3-540-45329-6_31"},{"issue":"1\u20132","key":"550_CR41","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0004-3702(80)90014-4","volume":"13","author":"R Reiter","year":"1980","unstructured":"Reiter R (1980) A logic for default reasoning. Artif Intell 13(1\u20132):81\u2013132","journal-title":"Artif Intell"},{"key":"550_CR42","volume-title":"Theory of linear and integer programming. Discrete mathematics and optimization","author":"A Schrijver","year":"1999","unstructured":"Schrijver A (1999) Theory of linear and integer programming. Discrete mathematics and optimization. Wiley, Hoboken"},{"issue":"1\u20132","key":"550_CR43","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/S0004-3702(02)00187-X","volume":"138","author":"P Simons","year":"2002","unstructured":"Simons P, Niemel\u00e4 I, Soininen T (2002) Extending and implementing the stable model semantics. Artif Intell 138(1\u20132):181\u2013234","journal-title":"Artif Intell"},{"key":"550_CR44","first-page":"279","volume-title":"Proceedings of the 2001 IEEE\/ACM international conference on Computer-aided design","author":"L Zhang","year":"2001","unstructured":"Zhang L, Madigan C, Moskewicz M, Malik S (2001) Efficient conflict driven learning in a Boolean satisfiability solver. In: Ernst R (ed) Proceedings of the 2001 IEEE\/ACM international conference on Computer-aided design. IEEE, San Jose, pp 279\u2013285"}],"container-title":["KI - K\u00fcnstliche Intelligenz"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13218-018-0550-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13218-018-0550-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13218-018-0550-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,25]],"date-time":"2022-08-25T10:43:23Z","timestamp":1661424203000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13218-018-0550-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,9]]},"references-count":44,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2018,8]]}},"alternative-id":["550"],"URL":"https:\/\/doi.org\/10.1007\/s13218-018-0550-z","relation":{},"ISSN":["0933-1875","1610-1987"],"issn-type":[{"type":"print","value":"0933-1875"},{"type":"electronic","value":"1610-1987"}],"subject":[],"published":{"date-parts":[[2018,6,9]]},"assertion":[{"value":"22 May 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 June 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 June 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}