{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T22:45:59Z","timestamp":1649112359795},"reference-count":18,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1991,1,1]],"date-time":"1991-01-01T00:00:00Z","timestamp":662688000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,19]],"date-time":"2013-07-19T00:00:00Z","timestamp":1374192000000},"content-version":"vor","delay-in-days":8235,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Journal of Logic Programming"],"published-print":{"date-parts":[[1991,1]]},"DOI":"10.1016\/0743-1066(91)90002-7","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:32Z","timestamp":1027655252000},"page":"1-17","source":"Crossref","is-referenced-by-count":19,"title":["Definite-clause set grammars: a formalism for problem solving"],"prefix":"10.1016","volume":"10","author":[{"given":"Takushi","family":"Tanaka","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0743-1066(91)90002-7_BIB1","series-title":"Introduction to Artificial Intelligence","author":"Charniak","year":"1985"},{"key":"10.1016\/0743-1066(91)90002-7_BIB2","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0031371","article-title":"Metamorphosis Grammars","author":"Colmerauer","year":"1978"},{"key":"10.1016\/0743-1066(91)90002-7_BIB3","first-page":"77","article-title":"On Gapping Grammars","author":"Dahl","year":"1984","journal-title":"Proceedings of the 2nd International Conference of Logic Programming"},{"key":"10.1016\/0743-1066(91)90002-7_BIB4","first-page":"669","article-title":"More on Gapping Grammars","author":"Dahl","year":"1984","journal-title":"Proceedings of FGCS"},{"key":"10.1016\/0743-1066(91)90002-7_BIB5","series-title":"Generalized Phrase Structure Grammar","author":"Gazder","year":"1985"},{"key":"10.1016\/0743-1066(91)90002-7_BIB6","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1145\/321250.321254","article-title":"A New Normal Form Theorem for Context-Free Phrase Structure Grammars","volume":"12","author":"Greibach","year":"1965","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0743-1066(91)90002-7_BIB7","series-title":"Logic for Problem Solving","author":"Kowalski","year":"1979"},{"key":"10.1016\/0743-1066(91)90002-7_BIB8","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF03037421","article-title":"BUP: A Bottom-Up Parser Embedded in Prolog","volume":"1","author":"Matsumoto","year":"1983","journal-title":"New Generation Comput."},{"key":"10.1016\/0743-1066(91)90002-7_BIB9","series-title":"Duck Reference Manual","author":"McDermott","year":"1983"},{"key":"10.1016\/0743-1066(91)90002-7_BIB10","series-title":"Principles of Artificial Intelligence","author":"Nilsson","year":"1980"},{"key":"10.1016\/0743-1066(91)90002-7_BIB11","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0004-3702(80)90003-X","article-title":"Definite Clause Grammars for Language Analysis","volume":"13","author":"Pereira","year":"1980","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0743-1066(91)90002-7_BIB12","first-page":"243","article-title":"Extraposition Grammar","volume":"7","author":"Pereila","year":"1981","journal-title":"AJCL"},{"key":"10.1016\/0743-1066(91)90002-7_BIB13","first-page":"765","article-title":"Unrestricted Gapping Grammars","author":"Popowich","year":"1985","journal-title":"Proceedings of IJCAI-85"},{"key":"10.1016\/0743-1066(91)90002-7_BIB14","first-page":"17","article-title":"Contextual Discontinuous Grammars","author":"Saint-Dizier","year":"1987","journal-title":"Proceedings of the 2nd International Workshop on Natural Language Understanding and Logic Programming"},{"key":"10.1016\/0743-1066(91)90002-7_BIB15","series-title":"The Art of Prolog","author":"Sterling","year":"1986"},{"key":"10.1016\/0743-1066(91)90002-7_BIB16","first-page":"263","article-title":"Representation and Analysis of Electrical Circuits in a Deductive System","author":"Tanaka","year":"1983","journal-title":"Proceedings of IJCAI-83"},{"key":"10.1016\/0743-1066(91)90002-7_BIB17","first-page":"407","article-title":"Parsing Circuit Topology in a Deductive System","author":"Tanaka","year":"1985","journal-title":"Proceedings of IJCAI-85"},{"key":"10.1016\/0743-1066(91)90002-7_BIB18","series-title":"Expert System Applications","first-page":"257","article-title":"Structural Analysis of Electronic Circuits in a Deductive System","author":"Tanaka","year":"1988"}],"container-title":["The Journal of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743106691900027?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743106691900027?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:56:09Z","timestamp":1555127769000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0743106691900027"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,1]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,1]]}},"alternative-id":["0743106691900027"],"URL":"https:\/\/doi.org\/10.1016\/0743-1066(91)90002-7","relation":{},"ISSN":["0743-1066"],"issn-type":[{"value":"0743-1066","type":"print"}],"subject":[],"published":{"date-parts":[[1991,1]]}}}