{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T13:29:06Z","timestamp":1648906146743},"reference-count":11,"publisher":"World Scientific Pub Co Pte Lt","issue":"05","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Algebra Comput."],"published-print":{"date-parts":[[1998,10]]},"abstract":"<jats:p> In the database framework of Kanellakis et al. it was argued that constraint query languages should meet the closed-form requirement, that is, queries should take as input constraint databases and give as output constraint databases that use the same type of constraints. This paper shows that the closed-form requirement can be met for Datalog queries with Boolean equality constraints with double exponential time-complete data complexity, for Datalog queries with precedence and monotone inequality constraints in triple exponential-time data complexity. A closed-form evaluation is also shown for (Stratified) Datalog queries with equality and inequality constraints in atomless Boolean algebras in triple exponential-time data complexity. <\/jats:p>","DOI":"10.1142\/s0218196798000260","type":"journal-article","created":{"date-parts":[[2003,7,31]],"date-time":"2003-07-31T10:08:41Z","timestamp":1059646121000},"page":"553-573","source":"Crossref","is-referenced-by-count":4,"title":["The Evaluation and the Computational Complexity of Datalog Queries of Boolean Constraint Databases"],"prefix":"10.1142","volume":"08","author":[{"given":"Peter Z.","family":"Revesz","sequence":"first","affiliation":[{"name":"Department of Computer Science and Engineering, University of Nebraska\u2013Lincoln, Lincoln, NE 68588-0115, USA"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"p_4","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(87)80065-2"},{"key":"p_5","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(82)90012-5"},{"key":"p_8","first-page":"197","volume":"5","author":"Helm R.","journal-title":"J. Comput. Syst. Sci."},{"key":"p_10","first-page":"503","volume":"1","author":"Jaffar J.","journal-title":"J. Logic Programming"},{"key":"p_12","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1995.1051"},{"key":"p_13","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(80)90048-1"},{"key":"p_14","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(95)00209-X"},{"key":"p_15","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(89)80013-6"},{"key":"p_16","first-page":"425","volume":"893","author":"Revesz P. Z.","year":"1995","journal-title":"Springer-Verlag LNCS"},{"key":"p_17","first-page":"209","volume":"1358","author":"Revesz P. Z.","year":"1998","journal-title":"Springer-Verlag LNCS"},{"key":"p_18","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1949-09359-X"}],"container-title":["International Journal of Algebra and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218196798000260","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T21:54:30Z","timestamp":1565128470000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218196798000260"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,10]]},"references-count":11,"journal-issue":{"issue":"05","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[1998,10]]}},"alternative-id":["10.1142\/S0218196798000260"],"URL":"https:\/\/doi.org\/10.1142\/s0218196798000260","relation":{},"ISSN":["0218-1967","1793-6500"],"issn-type":[{"value":"0218-1967","type":"print"},{"value":"1793-6500","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998,10]]}}}