{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T11:47:33Z","timestamp":1763466453834},"reference-count":0,"publisher":"Cambridge University Press (CUP)","issue":"1","license":[{"start":{"date-parts":[[2002,12,18]],"date-time":"2002-12-18T00:00:00Z","timestamp":1040169600000},"content-version":"unspecified","delay-in-days":0,"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":[[2003,1]]},"abstract":"<jats:p>This paper describes the [Lscr    ][Dscr    ][Lscr    ]++ system and the research advances that have enabled its \ndesign and development. We begin by discussing the new nonmonotonic and nondeterministic \nconstructs that extend the functionality of the [Lscr    ][Dscr    ][Lscr    ]++ language, while preserving its \nmodel-theoretic and fixpoint semantics. Then, we describe the execution model and the open \narchitecture designed to support these new constructs and to facilitate the integration with \nexisting DBMSs and applications. Finally, we describe the lessons learned by using [Lscr    ][Dscr    ][Lscr    ]++ \non various tested applications, such as middleware and datamining.<\/jats:p>","DOI":"10.1017\/s1471068402001515","type":"journal-article","created":{"date-parts":[[2003,2,5]],"date-time":"2003-02-05T11:08:57Z","timestamp":1044443337000},"page":"61-94","source":"Crossref","is-referenced-by-count":39,"title":["The deductive database system [Lscr    ][Dscr    ][Lscr    ]++"],"prefix":"10.1017","volume":"3","author":[{"given":"FAIZ","family":"ARNI","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"KAYLIANG","family":"ONG","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"SHALOM","family":"TSUR","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"HAIXUN","family":"WANG","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"CARLO","family":"ZANIOLO","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2002,12,18]]},"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\/S1471068402001515","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,31]],"date-time":"2019-03-31T15:27:50Z","timestamp":1554046070000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068402001515\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,12,18]]},"references-count":0,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,1]]}},"alternative-id":["S1471068402001515"],"URL":"https:\/\/doi.org\/10.1017\/s1471068402001515","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,12,18]]}}}