{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T05:18:00Z","timestamp":1772515080015,"version":"3.50.1"},"reference-count":27,"publisher":"Cambridge University Press (CUP)","issue":"3-4","license":[{"start":{"date-parts":[[2018,8,10]],"date-time":"2018-08-10T00:00:00Z","timestamp":1533859200000},"content-version":"unspecified","delay-in-days":40,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2018,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Extending ASP with constraints (CASP) enhances its expressiveness and performance. This extension is not straightforward as the grounding phase, present in most ASP systems, removes variables and the links among them, and also causes a combinatorial explosion in the size of the program. Several methods to overcome this issue have been devised: restricting the constraint domains (e.g., discrete instead of dense), or the type (or number) of models that can be returned. In this paper we propose to incorporate constraints into s(ASP), a goal-directed, top-down execution model which implements ASP while retaining logical variables both during execution and in the answer sets. The resulting model, s(CASP), can constrain variables that, as in CLP, are kept during the execution and in the answer sets. s(CASP) inherits and generalizes the execution model of s(ASP) and is parametric w.r.t. the constraint solver. We describe this novel execution model and show through several examples the enhanced expressiveness of s(CASP) w.r.t. ASP, CLP, and other CASP systems. We also report improved performance w.r.t. other very mature, highly optimized ASP systems in some benchmarks.<\/jats:p>","DOI":"10.1017\/s1471068418000285","type":"journal-article","created":{"date-parts":[[2018,8,10]],"date-time":"2018-08-10T09:44:17Z","timestamp":1533894257000},"page":"337-354","source":"Crossref","is-referenced-by-count":63,"title":["Constraint Answer Set Programming without Grounding"],"prefix":"10.1017","volume":"18","author":[{"given":"JOAQUIN","family":"ARIAS","sequence":"first","affiliation":[]},{"given":"MANUEL","family":"CARRO","sequence":"additional","affiliation":[]},{"given":"ELMER","family":"SALAZAR","sequence":"additional","affiliation":[]},{"given":"KYLE","family":"MARPLE","sequence":"additional","affiliation":[]},{"given":"GOPAL","family":"GUPTA","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2018,8,10]]},"reference":[{"key":"S1471068418000285_ref23","first-page":"872","article-title":"Clingo goes Linear Constraints over Reals and Integers","volume":"17","author":"Janhunen","year":"2017","journal-title":"TPLP"},{"key":"S1471068418000285_ref20","unstructured":"H\u00f6lldobler S. and Schweizer L. 2014. Answer Set Programming and clasp, a Tutorial. In Young Scientists' International Workshop on Trends in Information Processing (YSIP). 77."},{"key":"S1471068418000285_ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s10472-007-9076-z"},{"key":"S1471068418000285_ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2043174.2043195"},{"key":"S1471068418000285_ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2012.04.008"},{"key":"S1471068418000285_ref1","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068403001960"},{"key":"S1471068418000285_ref18","unstructured":"Gupta G. , Bansal A. , Min R. , Simon L. , and Mallya A. 2007. Coinductive Logic Programming and its Applications. Logic Programming, 27\u201344."},{"key":"S1471068418000285_ref24","unstructured":"Ji J. , Wan H. , Wang K. , Wang Z. , Zhang C. , and Xu J. 2016. Eliminating Disjunctions in Answer Set Programming by Restricted Unfolding. In IJCAI. 1130\u20131137."},{"key":"S1471068418000285_ref22","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(94)90033-7"},{"key":"S1471068418000285_ref17","doi-asserted-by":"publisher","DOI":"10.1007\/BF03037169"},{"key":"S1471068418000285_ref16","unstructured":"Gelfond M. and Lifschitz V. 1988. The Stable Model Semantics for Logic Programming. In International Conference on Logic Programming 1988. 1070\u20131080."},{"key":"S1471068418000285_ref15","unstructured":"Gebser M. , Kaminski R. , Kaufmann B. , Ostrowski M. , Schaub T. , and Thiele S. 2008. A User's Guide to gringo, clasp, clingo, and iclingo."},{"key":"S1471068418000285_ref4","doi-asserted-by":"crossref","unstructured":"Arias J. and Carro M. 2016. Description and Evaluation of a Generic Design to Integrate CLP and Tabled Execution. In 18th Int'l. ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming (PPDP'16). ACM Press, 10\u201323.","DOI":"10.1145\/2967973.2968596"},{"key":"S1471068418000285_ref7","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068410000232"},{"key":"S1471068418000285_ref26","unstructured":"Marple K. , Salazar E. , and Gupta G. 2017b. Computing Stable Models of Normal Logic Programs Without Grounding. CoRR abs\/1709.00501."},{"key":"S1471068418000285_ref5","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068417000102"},{"key":"S1471068418000285_ref12","doi-asserted-by":"crossref","first-page":"297","DOI":"10.3233\/FI-2009-180","article-title":"GASP: Answer Set Programming with Lazy Grounding","volume":"96","author":"Dal Pal\u00f9","year":"2009","journal-title":"Fundamenta Informaticae"},{"key":"S1471068418000285_ref6","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068417000138"},{"key":"S1471068418000285_ref8","doi-asserted-by":"publisher","DOI":"10.1017\/S147106840900372X"},{"key":"S1471068418000285_ref27","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(93)90222-F"},{"key":"S1471068418000285_ref19","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068411000457"},{"key":"S1471068418000285_ref21","unstructured":"Holzbaur C. 1995. OFAI CLP(Q,R) Manual, Edition 1.3.3. Tech. Rep. TR-95-09, Austrian Research Institute for Artificial Intelligence, Vienna."},{"key":"S1471068418000285_ref11","volume-title":"Logic and Data Bases","author":"Clark","year":"1978"},{"key":"S1471068418000285_ref25","unstructured":"Marple K. , Salazar E. , Chen Z. , and Gupta G. 2017a. The s(ASP) Predicate Answer Set Programming System. The Association for Logic Programming Newsletter."},{"key":"S1471068418000285_ref3","unstructured":"Arias J. 2016. Tabled CLP for Reasoning over Stream Data. In Technical Communications of the 32nd Int'l Conference on Logic Programming (ICLP'16). Vol. 52. OASIcs, 1\u20138. Doctoral Consortium."},{"key":"S1471068418000285_ref13","doi-asserted-by":"publisher","DOI":"10.1007\/11562931_8"},{"key":"S1471068418000285_ref14","unstructured":"Gabbrielli M. and Levi G. 1991. Modeling Answer Constraints in Constraint Logic Programs. In Proc. Eighth Int'l Conf. on Logic Programming."}],"container-title":["Theory and Practice of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1471068418000285","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,7]],"date-time":"2020-11-07T15:09:10Z","timestamp":1604761750000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068418000285\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7]]},"references-count":27,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2018,7]]}},"alternative-id":["S1471068418000285"],"URL":"https:\/\/doi.org\/10.1017\/s1471068418000285","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,7]]}}}