{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T06:39:52Z","timestamp":1648795192574},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"2-4","license":[{"start":{"date-parts":[[1995,6,1]],"date-time":"1995-06-01T00:00:00Z","timestamp":801964800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[1995,6]]},"DOI":"10.1007\/bf01530818","type":"journal-article","created":{"date-parts":[[2005,4,19]],"date-time":"2005-04-19T00:41:27Z","timestamp":1113871287000},"page":"151-176","source":"Crossref","is-referenced-by-count":0,"title":["Dynamic maintenance of the transitive closure in disjunctive graphs"],"prefix":"10.1007","volume":"14","author":[{"given":"Jorge","family":"Lobo","sequence":"first","affiliation":[]},{"given":"Qi","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Clement","family":"Yu","sequence":"additional","affiliation":[]},{"given":"Gaoming","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Tracy","family":"Pham","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1137\/0215029","volume":"15","author":"G. Ausiello","year":"1986","unstructured":"G. Ausiello, A. D'Atri and D. Sacca, Minimal representation of directed hypergraphs, SIAM J. Comp. 15(1986)418?431.","journal-title":"SIAM J. Comp."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0304-3975(90)90030-L","volume":"72","author":"G. Ausiello","year":"1990","unstructured":"G. Ausiello, U. Nanni and G.F. Italiano, Dynamic maintenance of directed hypergraphs, Theor. Comp. Sci. 72(1990)97?117.","journal-title":"Theor. Comp. Sci."},{"key":"CR3","volume-title":"Graphs and Hypergraphs","author":"C. Berge","year":"1973","unstructured":"C. Berge,Graphs and Hypergraphs (North-Holland, Amsterdam, 1973)."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0004-3702(77)90014-5","volume":"9","author":"H. Boley","year":"1977","unstructured":"H. Boley, Directed recursive labelnode hypergraphs: A new representation language, Artificial Intelligence 9(1977)49?85.","journal-title":"Artificial Intelligence"},{"key":"CR5","unstructured":"R. Demolombe, An efficient evaluation strategy for non-Horn deductive databases,Proc. IFIP (1989)."},{"key":"CR6","unstructured":"E.A. Emerson and C. Leis, Efficient model-checking in fragments of mu-calculus,Proc. Symp. on Logic in Computer Science (1986)."},{"key":"CR7","first-page":"660","volume-title":"Bottom-up evaluation on disjunctive databases","author":"J.A. Fern\u00e1ndez","year":"1991","unstructured":"J.A. Fern\u00e1ndez and J. Minker, Bottom-up evaluation on disjunctive databases, in:Proc. Int. Conf. on Logic Programming, ed. K. Furukawa (MIT Press, Cambridge, MA, 1991) pp. 660?675."},{"key":"CR8","unstructured":"M. Garey and D. Johson,Computers and Intractability, A Guide to Theory of NP-Completeness (Freeman, 1983)."},{"key":"CR9","doi-asserted-by":"crossref","first-page":"737","DOI":"10.1145\/322276.322285","volume":"28","author":"S. Gnesi","year":"1981","unstructured":"S. Gnesi, U. Montanari and A. Martelli, Dynamic programming as graph searching: An algebraic approach, J. ACM 28(1981)737?751.","journal-title":"J. ACM"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1109\/69.149932","volume":"4","author":"K.-C. Guh","year":"1992","unstructured":"K.-C. Guh and C. Yu, Efficient management of materalized generalized transitive closure in centralized and parallel environments, IEEE Trans. Knowledge and Data Eng. 4(1992)371?381.","journal-title":"IEEE Trans. Knowledge and Data Eng."},{"key":"CR11","first-page":"259","volume":"3","author":"T. Imielinski","year":"1991","unstructured":"T. Imielinski, Incomplete deductive databases, Ann. Math. and AI 3(1991)259?293.","journal-title":"Ann. Math. and AI"},{"key":"CR12","doi-asserted-by":"crossref","unstructured":"T. Imielinski, S. Naqvi and K. Vadaparty, Querying design and planning databases,Proc. 2nd Int. Conf. on Deductive and Object Oriented Databases, Munich (1991) pp. 524?545.","DOI":"10.1007\/3-540-55015-1_28"},{"key":"CR13","doi-asserted-by":"crossref","unstructured":"T. Imielinski and K. Vadaparty, Complexity of query processing in databases with OR-objects,Proc. 7th ACM SIGACT\/SIGMOD Symp. on Principles of Database Systems, Philadelphia, PA (1989) pp. 51?65.","DOI":"10.1145\/73721.73726"},{"key":"CR14","doi-asserted-by":"crossref","unstructured":"Y. Liu, Null values in definite programs,Proc. North American Conf. on Logic Programming, Austin, TX (1990) pp. 273?288.","DOI":"10.21236\/ADA232065"},{"key":"CR15","volume-title":"Foundations of Disjunctive Logic Programming","author":"J. Lobo","year":"1992","unstructured":"J. Lobo, J. Minker and A. Rajasekar,Foundations of Disjunctive Logic Programming (MIT Press, Cambridge, MA, 1992)."},{"key":"CR16","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1109\/TR.1985.5222226","volume":"R-34","author":"I.J. Sacks","year":"1985","unstructured":"I.J. Sacks, Digraph matrix analysis, IEEE Trans. Reliability R-34(1985)437?446.","journal-title":"IEEE Trans. Reliability"},{"key":"CR17","unstructured":"J. Ullman,Database and Knowledge-Base Systems (Computer Science Press, 1988)."},{"key":"CR18","unstructured":"M.Y. Vardi, The complexity of relational query languages,Proc. 14th ACM Symp. on Theory of Computing (1982) pp. 137?146."},{"key":"CR19","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1145\/360715.360746","volume":"18","author":"H.S. Warren","year":"1975","unstructured":"H.S. Warren, A modification of Washall's algorithm for the transitive closure of binary relations, Commun. ACM 18(1975)218?220.","journal-title":"Commun. ACM"},{"key":"CR20","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1145\/322326.322333","volume":"29","author":"M. Yannakakis","year":"1982","unstructured":"M. Yannakakis, A theory of safe locking policies in database systems, J. ACM 29(1982)718?740.","journal-title":"J. ACM"}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01530818\/fulltext.html","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01530818.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01530818\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01530818","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T13:31:30Z","timestamp":1556890290000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01530818"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,6]]},"references-count":20,"journal-issue":{"issue":"2-4","published-print":{"date-parts":[[1995,6]]}},"alternative-id":["BF01530818"],"URL":"https:\/\/doi.org\/10.1007\/bf01530818","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"value":"1012-2443","type":"print"},{"value":"1573-7470","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,6]]}}}