{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T02:22:49Z","timestamp":1768270969292,"version":"3.49.0"},"reference-count":24,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1996,4,1]],"date-time":"1996-04-01T00:00:00Z","timestamp":828316800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,25]],"date-time":"2013-07-25T00:00:00Z","timestamp":1374710400000},"content-version":"vor","delay-in-days":6324,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[1996,4]]},"DOI":"10.1016\/0004-3702(96)00004-5","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:24:09Z","timestamp":1027657449000},"page":"353-367","source":"Crossref","is-referenced-by-count":187,"title":["On the relative expressiveness of description logics and predicate logics"],"prefix":"10.1016","volume":"82","author":[{"given":"Alex","family":"Borgida","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"5","key":"10.1016\/0004-3702(96)00004-5_BIB1","first-page":"685","article-title":"Back and forth between modal logic and classical logic","volume":"3","author":"Andreka","year":"1995","journal-title":"J. Int. Gp. Pure Appl. Logic"},{"key":"10.1016\/0004-3702(96)00004-5_BIB2","series-title":"Proceedings ECAI-90","first-page":"53","article-title":"A formal definition for expressive power of Knowledge Representation Languages","author":"Baader","year":"1990"},{"key":"10.1016\/0004-3702(96)00004-5_BIB3","article-title":"Terminological knowledge representation: a proposal for a terminological logic","author":"Baader","year":"1992"},{"key":"10.1016\/0004-3702(96)00004-5_BIB4","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1109\/69.469829","article-title":"Description logics in data management","volume":"7","author":"Borgida","year":"1995","journal-title":"IEEE Trans. Knowledge Data Eng."},{"key":"10.1016\/0004-3702(96)00004-5_BIB5","series-title":"Proceedings ACM SIGMOD Conference on Data Management","first-page":"217","article-title":"Loading data into description reasoners","author":"Borgida","year":"1993"},{"key":"10.1016\/0004-3702(96)00004-5_BIB6","article-title":"A structural paradigm for representing knowledge","author":"Brachman","year":"1977"},{"issue":"1","key":"10.1016\/0004-3702(96)00004-5_BIB7","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0306-4379(94)90025-6","article-title":"Subsumption between queries in object-oriented databases","volume":"19","author":"Buchheit","year":"1994","journal-title":"Inf. Syst."},{"key":"10.1016\/0004-3702(96)00004-5_BIB8","series-title":"Proceedings 30th IEEE Symposium on Foundations of Computer Science","first-page":"612","article-title":"An optimal lower bound on the number of variables for graph identification","author":"Cai","year":"1989"},{"key":"10.1016\/0004-3702(96)00004-5_BIB9","series-title":"Trends in Artificial Intelligence","first-page":"88","article-title":"A hybrid system with Datalog and concept languages","volume":"549","author":"Donini","year":"1991"},{"key":"10.1016\/0004-3702(96)00004-5_BIB10","series-title":"Aspects of Philosophical Logic","first-page":"91","article-title":"Expressive functional completeness in tense logic","author":"Gabbay","year":"1981"},{"key":"10.1016\/0004-3702(96)00004-5_BIB11","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1016\/0022-0000(82)90011-3","article-title":"Upper and lower bounds for first-order expressibility","volume":"25","author":"Immerman","year":"1982","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/0004-3702(96)00004-5_BIB12","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/S0019-9958(86)80029-8","article-title":"Relational queries computable in polynomial time","volume":"68","author":"Immerman","year":"1986","journal-title":"Inf. Control"},{"key":"10.1016\/0004-3702(96)00004-5_BIB13","series-title":"Proceedings 9th ACM Symposium on Principles of Database Systems","first-page":"61","article-title":"On the expressive power of Datalog: tools and a case study","author":"Kolaitis","year":"1990"},{"key":"10.1016\/0004-3702(96)00004-5_BIB14","author":"Lewis","year":"1979"},{"key":"10.1016\/0004-3702(96)00004-5_BIB15","series-title":"Proceedings AAAI-87","first-page":"403","article-title":"A deductive pattern matcher","author":"MacGregor","year":"1987"},{"key":"10.1016\/0004-3702(96)00004-5_BIB16","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1002\/malq.19750210118","article-title":"On languages with two variables","volume":"21","author":"Mortimer","year":"1975","journal-title":"Z. Math. Logik Grundl. Math."},{"key":"10.1016\/0004-3702(96)00004-5_BIB17","series-title":"Principles of Semantic Networks","first-page":"331","article-title":"Terminological cycles: semantics and computational properties","author":"Nebel","year":"1991"},{"key":"10.1016\/0004-3702(96)00004-5_BIB18","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0004-3702(89)90030-1","article-title":"Undecidability of subsumption in NIKL","volume":"39","author":"Patel-Schneider","year":"1989","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(96)00004-5_BIB19","article-title":"Description logic knowledge representation system specification from the KRSS group of the ARPA knowledge sharing effort","author":"Patel-Schneider","year":"1994","journal-title":"AT&T Bell Laboratories Report"},{"key":"10.1016\/0004-3702(96)00004-5_BIB20","series-title":"Proceedings IJCAI-91","article-title":"A correspondence theory for terminologic logics","author":"Schild","year":"1991"},{"key":"10.1016\/0004-3702(96)00004-5_BIB21","series-title":"Deliverables for Year 3 of ESPRIT BRA Compulog 2","article-title":"The role of domain-closure axioms and complete knowledge in enabling decidable and tractable reasoning in description logics","author":"Schild","year":"1995"},{"key":"10.1016\/0004-3702(96)00004-5_BIB22","series-title":"Research in Knowledge Representation for NL Understanding","article-title":"KL-ONE: semantics and classification","author":"Schmolze","year":"1983"},{"key":"10.1016\/0004-3702(96)00004-5_BIB23","doi-asserted-by":"crossref","DOI":"10.1090\/coll\/041","article-title":"A Formalization of Set Theory without Variables","author":"Tarski","year":"1987"},{"key":"10.1016\/0004-3702(96)00004-5_BIB24","doi-asserted-by":"crossref","unstructured":"W.A. Woods and J.G. Schmolze, The KL-ONE family, Comput. Math. Appl.23 (2\u20135) Special Issue on Semantic Networks in Artificial Intelligence.","DOI":"10.1016\/0898-1221(92)90139-9"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0004370296000045?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0004370296000045?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T15:19:36Z","timestamp":1580915976000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0004370296000045"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,4]]},"references-count":24,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1996,4]]}},"alternative-id":["0004370296000045"],"URL":"https:\/\/doi.org\/10.1016\/0004-3702(96)00004-5","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[1996,4]]}}}