{"id":"https://openalex.org/W1963804765","doi":"https://doi.org/10.1109/tc.1976.1674701","title":"A Search Technique for Clause Interconnectivity Graphs","display_name":"A Search Technique for Clause Interconnectivity Graphs","publication_year":1976,"publication_date":"1976-08-01","ids":{"openalex":"https://openalex.org/W1963804765","doi":"https://doi.org/10.1109/tc.1976.1674701","mag":"1963804765"},"language":"en","primary_location":{"id":"doi:10.1109/tc.1976.1674701","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tc.1976.1674701","pdf_url":null,"source":{"id":"https://openalex.org/S157670870","display_name":"IEEE Transactions on Computers","issn_l":"0018-9340","issn":["0018-9340","0016-9340","1557-9956","2326-3814"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Computers","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5098283675","display_name":"Sickel","orcid":null},"institutions":[{"id":"https://openalex.org/I185103710","display_name":"University of California, Santa Cruz","ror":"https://ror.org/03s65by71","country_code":"US","type":"education","lineage":["https://openalex.org/I185103710"]},{"id":"https://openalex.org/I2803209242","display_name":"University of California System","ror":"https://ror.org/00pjdza24","country_code":"US","type":"education","lineage":["https://openalex.org/I2803209242"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Sickel","raw_affiliation_strings":["Department of Information Sciences, University of California, Santa Cruz, CA, USA","Department of Information Sciences, University of California"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information Sciences, University of California, Santa Cruz, CA, USA","institution_ids":["https://openalex.org/I185103710"]},{"raw_affiliation_string":"Department of Information Sciences, University of California","institution_ids":["https://openalex.org/I2803209242"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5098283675"],"corresponding_institution_ids":["https://openalex.org/I185103710","https://openalex.org/I2803209242"],"apc_list":null,"apc_paid":null,"fwci":22.9664,"has_fulltext":false,"cited_by_count":84,"citation_normalized_percentile":{"value":0.99141528,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"C-25","issue":"8","first_page":"823","last_page":"835"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9944000244140625,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9919000267982483,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/axiom","display_name":"Axiom","score":0.5455271005630493},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5030307173728943},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.48633891344070435},{"id":"https://openalex.org/keywords/automated-theorem-proving","display_name":"Automated theorem proving","score":0.4614796042442322},{"id":"https://openalex.org/keywords/negation","display_name":"Negation","score":0.4530413746833801},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.42148441076278687},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.40052610635757446}],"concepts":[{"id":"https://openalex.org/C167729594","wikidata":"https://www.wikidata.org/wiki/Q17736","display_name":"Axiom","level":2,"score":0.5455271005630493},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5030307173728943},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48633891344070435},{"id":"https://openalex.org/C206880738","wikidata":"https://www.wikidata.org/wiki/Q431667","display_name":"Automated theorem proving","level":2,"score":0.4614796042442322},{"id":"https://openalex.org/C2185349","wikidata":"https://www.wikidata.org/wiki/Q190558","display_name":"Negation","level":2,"score":0.4530413746833801},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.42148441076278687},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.40052610635757446},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tc.1976.1674701","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tc.1976.1674701","pdf_url":null,"source":{"id":"https://openalex.org/S157670870","display_name":"IEEE Transactions on Computers","issn_l":"0018-9340","issn":["0018-9340","0016-9340","1557-9956","2326-3814"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Computers","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.41999998688697815,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1494497985","https://openalex.org/W1817451992","https://openalex.org/W1892615864","https://openalex.org/W1970045008","https://openalex.org/W1984820433","https://openalex.org/W2003287551","https://openalex.org/W2010405422","https://openalex.org/W2021473914","https://openalex.org/W2062032114","https://openalex.org/W2523365043","https://openalex.org/W2592184324","https://openalex.org/W2752061190","https://openalex.org/W2752853835","https://openalex.org/W4229861117","https://openalex.org/W4246345775"],"related_works":["https://openalex.org/W2059922809","https://openalex.org/W2387527986","https://openalex.org/W2479250593","https://openalex.org/W4283261428","https://openalex.org/W2131148043","https://openalex.org/W2092783274","https://openalex.org/W4318829426","https://openalex.org/W4391025849","https://openalex.org/W4384940451","https://openalex.org/W1555836633"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"a":[3,22,38,46,54,67,94,105,127,133],"new":[4],"representation":[5],"and":[6,20,24,50,75,88],"technique":[7,110],"for":[8],"proving":[9,33,103],"theorems":[10],"automatically":[11],"that":[12,44,131],"is":[13],"both":[14],"computationally":[15],"more":[16],"effective":[17],"than":[18],"resolution":[19],"permits":[21],"clear":[23],"concise":[25],"formal":[26],"description.":[27],"A":[28],"problem":[29],"in":[30,69,113,126],"automatic":[31],"theorem":[32,55,102],"can":[34,63],"be":[35,57,64],"specified":[36],"by":[37,66,85],"set":[39,47,60],"of":[40,48,53,61,120,135],"clauses,":[41],"containing":[42],"literals,":[43],"represents":[45],"axioms":[49],"the":[51,71,76,89,116],"negation":[52],"to":[56],"proved.":[58],"The":[59,81,108,123],"clauses":[62],"replaced":[65],"graph":[68,117],"which":[70],"nodes":[72,82],"represent":[73],"literals":[74],"edges":[77,90],"link":[78],"unifiable":[79],"complements.":[80],"are":[83,91],"partitioned":[84],"clause":[86],"membership,":[87],"labeled":[92],"with":[93],"most":[95],"general":[96],"unifying":[97],"substitution.":[98],"Given":[99],"this":[100],"representation,":[101],"becomes":[104],"graph-searching":[106],"problem.":[107],"search":[109],"presented":[111],"here,":[112],"effect,":[114],"unrolls":[115],"into":[118],"sets":[119],"solution":[121],"trees.":[122],"trees":[124],"grow":[125],"well-defined":[128],"breadth-first":[129],"way":[130],"defines":[132],"measure":[134],"proof":[136],"complexity.":[137]},"counts_by_year":[{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}