{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,4]],"date-time":"2025-01-04T05:18:34Z","timestamp":1735967914647,"version":"3.32.0"},"reference-count":0,"publisher":"IOS Press","issue":"2","license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Fundamenta Informaticae"],"published-print":{"date-parts":[[2010,1]]},"abstract":" The reduced implicate trie is a data structure that was introduced in [12] as a target language for knowledge compilation. It has the property that, even when large, it guarantees that a query can be processed in time linear in the size of the query, regardless of the size of the compiled knowledge base. In this paper, the branches of a reduced implicate trie that correspond to prime implicates are characterized. A technique is developed for finding and marking nodes for which all descending branches correspond to non-prime implicates. This is extended to allow the discovery of prime implicate subsets of queries with a \"yes\" answer. <\/jats:p>","DOI":"10.3233\/fi-2010-247","type":"journal-article","created":{"date-parts":[[2025,1,3]],"date-time":"2025-01-03T05:36:47Z","timestamp":1735882607000},"page":"227-243","source":"Crossref","is-referenced-by-count":0,"title":["Identifying Prime Implicate Branches in Reduced Implicate Tries"],"prefix":"10.3233","volume":"99","author":[{"given":"Neil V.","family":"Murray","sequence":"first","affiliation":[{"name":"Department of Computer Science, State University of\r\t\t\t New York Albany, NY 12222, USA. E-mail: nvm@cs.albany.edu"}]},{"given":"Erik","family":"Rosenthal","sequence":"additional","affiliation":[{"name":"Department of Mathematics, University of New Haven\r\t\t\t West Haven, CT 06516, USA. E-mail: erosenthal@newhaven.edu"}]}],"member":"7437","published-online":{"date-parts":[[2010,1,1]]},"container-title":["Fundamenta Informaticae"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-2010-247","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-2010-247","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,3]],"date-time":"2025-01-03T05:36:49Z","timestamp":1735882609000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/FI-2010-247"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,1]]},"references-count":0,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,1]]}},"alternative-id":["10.3233\/FI-2010-247"],"URL":"https:\/\/doi.org\/10.3233\/fi-2010-247","relation":{},"ISSN":["0169-2968","1875-8681"],"issn-type":[{"value":"0169-2968","type":"print"},{"value":"1875-8681","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,1]]}}}