{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T21:40:45Z","timestamp":1757626845623,"version":"3.44.0"},"reference-count":20,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1989,9,1]],"date-time":"1989-09-01T00:00:00Z","timestamp":620611200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1989,9,1]],"date-time":"1989-09-01T00:00:00Z","timestamp":620611200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"funder":[{"DOI":"10.13039\/501100004541","name":"Ministry of Education, India","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004541","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005049","name":"Science and Engineering Research Council","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100005049","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Data & Knowledge Engineering"],"published-print":{"date-parts":[[1989,9]]},"DOI":"10.1016\/0169-023x(89)90021-9","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T12:15:20Z","timestamp":1047644120000},"page":"223-244","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":23,"title":["A path finding method for constraint checking in deductive databases"],"prefix":"10.1016","volume":"4","author":[{"given":"Subrata K.","family":"Das","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Howard Williams","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0169-023X(89)90021-9_BIB1","series-title":"Foundation of Deductive Databases and Logic Programming","first-page":"89","article-title":"Towards a theory of declarative knowledge","author":"Apt","year":"1988"},{"key":"10.1016\/0169-023X(89)90021-9_BIB2","series-title":"Proceedings of Extending Database Technology","first-page":"488","article-title":"A uniform approach to constraint satisfaction and constraint satisfiability in deductive databases","author":"Bry","year":"1988"},{"key":"10.1016\/0169-023X(89)90021-9_BIB3","series-title":"Logic and Databases","first-page":"293","article-title":"Negation as failure","author":"Clark","year":"1978"},{"year":"1984","author":"Clocksin","series-title":"Programming in Prolog","key":"10.1016\/0169-023X(89)90021-9_BIB4"},{"key":"10.1016\/0169-023X(89)90021-9_BIB5","series-title":"Proc. Seventh British Nat. Conf. on Databases","first-page":"85","article-title":"Integrity checking methods in deductive databases: A comparative evaluation","author":"Das","year":"1989"},{"volume":"Vol. 1","year":"1986","author":"Date","key":"10.1016\/0169-023X(89)90021-9_BIB6"},{"volume":"Vol. 2","year":"1985","author":"Date","key":"10.1016\/0169-023X(89)90021-9_BIB7"},{"key":"10.1016\/0169-023X(89)90021-9_BIB8","series-title":"Proceedings of the First International Conference on Expert Database Systems","first-page":"271","article-title":"Integrity enforcements on deductive databases","author":"Decker","year":"1986"},{"year":"1981","author":"Fernandez","series-title":"Database Security and Integrity","key":"10.1016\/0169-023X(89)90021-9_BIB9"},{"issue":"2","key":"10.1016\/0169-023X(89)90021-9_BIB10","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1145\/356924.356929","article-title":"Logic and databases \u2014 a deductive approach","volume":"16","author":"Gallaire","year":"1984","journal-title":"Computing Surveys"},{"key":"10.1016\/0169-023X(89)90021-9_BIB11","series-title":"Proceedings of the 13th VLDB Conference","first-page":"61","article-title":"Integrity checking in deductive databases","author":"Kowalski","year":"1987"},{"key":"10.1016\/0169-023X(89)90021-9_BIB12","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0169-023X(87)90019-X","article-title":"Integrity constraint checking in deductive databases using the Prolog not-predicate","volume":"2","author":"Ling","year":"1987","journal-title":"Data & Knowledge Engineering"},{"key":"10.1016\/0169-023X(89)90021-9_BIB13","article-title":"Integrity constraint checking in stratified databases","author":"Lloyd","year":"1986","journal-title":"Department of Computer Science, University of Melbourne, Technical Report 86\/5"},{"issue":"3","key":"10.1016\/0169-023X(89)90021-9_BIB14","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0743-1066(84)90011-6","article-title":"Making Prolog more expressive","volume":"1","author":"Lloyd","year":"1984","journal-title":"J. Logic Programming"},{"issue":"2","key":"10.1016\/0169-023X(89)90021-9_BIB15","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0743-1066(85)90013-5","article-title":"A basis for deductive database systems","volume":"2","author":"Lloyd","year":"1985","journal-title":"J. Logic Programming"},{"key":"10.1016\/0169-023X(89)90021-9_BIB16","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/BF00263192","article-title":"Logic for improving integrity checking in relational databases","volume":"18","author":"Nicolas","year":"1982","journal-title":"Acta Informatica"},{"key":"10.1016\/0169-023X(89)90021-9_BIB17","series-title":"Proceedings of the Workshop on Foundations of Deductive Databases and Logic Programming","article-title":"An application of general purpose theorem-proving to database integrity","author":"Sadri","year":"1987"},{"key":"10.1016\/0169-023X(89)90021-9_BIB18","first-page":"303","article-title":"The Art of Prolog","author":"Sterling","year":"1986"},{"unstructured":"R.W. Topor, T. Keddis and D.W. Wright, Deductive database tools, Department of Computer Science, University of Melbourne, Technical Report 84\/7.","key":"10.1016\/0169-023X(89)90021-9_BIB19"},{"year":"1984","author":"Ullman","series-title":"Principles of Database Systems","key":"10.1016\/0169-023X(89)90021-9_BIB20"}],"container-title":["Data & Knowledge Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0169023X89900219?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0169023X89900219?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T23:35:37Z","timestamp":1757460937000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0169023X89900219"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,9]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1989,9]]}},"alternative-id":["0169023X89900219"],"URL":"https:\/\/doi.org\/10.1016\/0169-023x(89)90021-9","relation":{},"ISSN":["0169-023X"],"issn-type":[{"type":"print","value":"0169-023X"}],"subject":[],"published":{"date-parts":[[1989,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A path finding method for constraint checking in deductive databases","name":"articletitle","label":"Article Title"},{"value":"Data & Knowledge Engineering","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0169-023X(89)90021-9","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1989 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}