{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T18:28:58Z","timestamp":1648664938225},"reference-count":29,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1994,8,1]],"date-time":"1994-08-01T00:00:00Z","timestamp":775699200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6925,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1994,8]]},"DOI":"10.1016\/0304-3975(94)90095-7","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"197-218","source":"Crossref","is-referenced-by-count":4,"title":["A kind of logical compilation for knowledge bases"],"prefix":"10.1016","volume":"131","author":[{"given":"Philippe","family":"Mathieu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Paul","family":"Delahaye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(94)90095-7_bib1","doi-asserted-by":"crossref","first-page":"633","DOI":"10.1145\/322276.322277","article-title":"On matrices with connections","volume":"28","author":"Bibel","year":"1981","journal-title":"J. Acm"},{"key":"10.1016\/0304-3975(94)90095-7_bib2","series-title":"Symbolic Logic and Mechanical Theorem Proving","author":"Chang","year":"1973"},{"key":"10.1016\/0304-3975(94)90095-7_bib3","series-title":"Proc. 3rd Ann. Acm Symp. on Theory of Computing","first-page":"151","article-title":"The complexity of theorem-proving procedures","author":"Cook","year":"1971"},{"key":"10.1016\/0304-3975(94)90095-7_bib4","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1145\/1008335.1008338","article-title":"A short proof of the pigeon-hole principle using extended resolution","volume":"8","author":"Cook","year":"1976","journal-title":"Acm Sigact News"},{"key":"10.1016\/0304-3975(94)90095-7_bib5","doi-asserted-by":"crossref","first-page":"36","DOI":"10.2307\/2273702","article-title":"The relative efficiency of propositional proof systems","volume":"44","author":"Cook","year":"1979","journal-title":"J. Sym. Logic"},{"key":"10.1016\/0304-3975(94)90095-7_bib6","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1145\/321033.321034","article-title":"A computing procedure for quantification theory","volume":"7","author":"Davis","year":"1960","journal-title":"J. Acm"},{"key":"10.1016\/0304-3975(94)90095-7_bib7","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0004-3702(86)90080-9","article-title":"An assumption-based TMS","volume":"28","author":"De Kleer","year":"1986","journal-title":"Artif. Intell."},{"key":"10.1016\/0304-3975(94)90095-7_bib8","first-page":"290","article-title":"A comparison of ATMS and CSP techniques","author":"De Kleer","year":"1989","journal-title":"Proc. IJCAI'89"},{"key":"10.1016\/0304-3975(94)90095-7_bib9","first-page":"1341","article-title":"Forward chaining and computation of two-valued and three-valued models","author":"Delahaye","year":"1987","journal-title":"Proc. 7th Inter. Conf. on Expert Systems and Applications"},{"key":"10.1016\/0304-3975(94)90095-7_bib10","first-page":"155","article-title":"An Achievement by Part Method to Solve the Incompleteness of Forward Chaining","author":"Delahaye","year":"1993","journal-title":"Proc. JFPL'93"},{"key":"10.1016\/0304-3975(94)90095-7_bib11","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0304-3975(51)90008-4","article-title":"Programming in three-valued logic","volume":"78","author":"Delahaye","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)90095-7_bib12","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0304-3975(91)90315-S","article-title":"Counting the number of solutions for instances of satisfiability","volume":"81","author":"Dubois","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)90095-7_bib13","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0304-3975(91)90316-T","article-title":"Probabilistic approach to the satisfiability problem","volume":"81","author":"Dubois","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)90095-7_SB0070","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/S0743-1066(85)80005-4","article-title":"A Kripke-Kleene semantics for logic programs","volume":"2","author":"Fitting","year":"1985","journal-title":"J. Logic Programming"},{"key":"10.1016\/0304-3975(94)90095-7_SB0075","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1016\/S0743-1066(85)80005-4","article-title":"A Kripke-Kleene semantics for logic programs","volume":"2","author":"Fitting","year":"1985","journal-title":"J. Logic Programming"},{"key":"10.1016\/0304-3975(94)90095-7_bib15","first-page":"1054","article-title":"Stratified and three-valued logic programming semantics","author":"Fitting","year":"1988","journal-title":"Proc. 5th Inter. Conf. and Symp. in Logic Programming"},{"key":"10.1016\/0304-3975(94)90095-7_bib16","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0304-3975(85)90144-6","article-title":"The intractability of resolution","volume":"39","author":"Haken","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)90095-7_bib17","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/0004-3702(92)90030-2","article-title":"Linear resolution for consequence finding","volume":"56","author":"Inoue","year":"1992","journal-title":"Artif. Intell."},{"key":"10.1016\/0304-3975(94)90095-7_bib18","series-title":"Introduction to Metamathematics","author":"Kleene","year":"1952"},{"key":"10.1016\/0304-3975(94)90095-7_bib19","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0743-1066(87)90007-0","article-title":"Negation in logic programming","volume":"4","author":"Kunen","year":"1987","journal-title":"J. Logic Programming"},{"key":"10.1016\/0304-3975(94)90095-7_bib20","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0743-1066(89)90022-8","article-title":"Signed data dependencies in logic programs","volume":"7","author":"Kunen","year":"1989","journal-title":"J. Logic Programming"},{"key":"10.1016\/0304-3975(94)90095-7_bib21","series-title":"Ph.D. Thesis","article-title":"A completeness theorem and a computer program for finding theorems derivable from given axioms","author":"Lee","year":"1967"},{"key":"10.1016\/0304-3975(94)90095-7_bib22","series-title":"Elements of Mathematical Logic","author":"Lukasiewicz","year":"1963"},{"key":"10.1016\/0304-3975(94)90095-7_bib23","series-title":"Ph.D. Thesis","article-title":"La notion d'ach\u00e8vement et ses applications aux interpr\u00e9teurs de r\u00e8gles","author":"Mathieu","year":"1991"},{"key":"10.1016\/0304-3975(94)90095-7_bib24","first-page":"699","article-title":"For which bases forward chaining is sufficient?","author":"Mathieu","year":"1990","journal-title":"Proc. Cognitiva 90"},{"key":"10.1016\/0304-3975(94)90095-7_bib25","series-title":"Proc. JELIA 90","first-page":"386","article-title":"The logical compilation of knowledge bases","volume":"Vol. 478","author":"Mathieu","year":"1990"},{"key":"10.1016\/0304-3975(94)90095-7_bib26","series-title":"Proc. 6th Inter. Conf. on Logic Programming","first-page":"655","article-title":"Non-monotonic formalisms and logic programming","author":"Przymusinski","year":"1989"},{"key":"10.1016\/0304-3975(94)90095-7_bib27","series-title":"Ph.D. Thesis","article-title":"L'evaluation s\u00e9mantique en calcul propositionnel","author":"Rauzy","year":"1989"},{"key":"10.1016\/0304-3975(94)90095-7_bib28","series-title":"Th\u00e8se d'\u00e9tat","article-title":"Representation et utilisation de la connaissance en calcul propositionnel","author":"Siegel","year":"1987"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594900957?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594900957?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:28:13Z","timestamp":1555129693000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397594900957"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,8]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,8]]}},"alternative-id":["0304397594900957"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)90095-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1994,8]]}}}