{"id":"https://openalex.org/W2019170811","doi":"https://doi.org/10.1080/03057920412331272207","title":"Exploiting parallelism: highly competitive semantic tree theorem prover","display_name":"Exploiting parallelism: highly competitive semantic tree theorem prover","publication_year":2004,"publication_date":"2004-08-30","ids":{"openalex":"https://openalex.org/W2019170811","doi":"https://doi.org/10.1080/03057920412331272207","mag":"2019170811"},"language":"en","primary_location":{"id":"doi:10.1080/03057920412331272207","is_oa":false,"landing_page_url":"https://doi.org/10.1080/03057920412331272207","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","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/A5088706019","display_name":"Choon Kyu Kim \u2020","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Choon Kyu Kim * \u2020","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5088706019"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.0967485,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"81","issue":"9","first_page":"1051","last_page":"1067"},"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.9997000098228455,"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.9997000098228455,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9991000294685364,"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/T10181","display_name":"Natural Language Processing Techniques","score":0.9977999925613403,"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/automated-theorem-proving","display_name":"Automated theorem proving","score":0.7693814039230347},{"id":"https://openalex.org/keywords/gas-meter-prover","display_name":"Gas meter prover","score":0.7155695557594299},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6483399868011475},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5060879588127136},{"id":"https://openalex.org/keywords/parallelism","display_name":"Parallelism (grammar)","score":0.5005667209625244},{"id":"https://openalex.org/keywords/resolution","display_name":"Resolution (logic)","score":0.4674210250377655},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4569888114929199},{"id":"https://openalex.org/keywords/first-order-logic","display_name":"First-order logic","score":0.44576162099838257},{"id":"https://openalex.org/keywords/predicate","display_name":"Predicate (mathematical logic)","score":0.4438035786151886},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.42186439037323},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.4108128547668457},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.39454400539398193},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3939855396747589},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.33128854632377625},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.2791644036769867},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.09178578853607178}],"concepts":[{"id":"https://openalex.org/C206880738","wikidata":"https://www.wikidata.org/wiki/Q431667","display_name":"Automated theorem proving","level":2,"score":0.7693814039230347},{"id":"https://openalex.org/C159718280","wikidata":"https://www.wikidata.org/wiki/Q5526353","display_name":"Gas meter prover","level":3,"score":0.7155695557594299},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6483399868011475},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5060879588127136},{"id":"https://openalex.org/C2781172179","wikidata":"https://www.wikidata.org/wiki/Q853109","display_name":"Parallelism (grammar)","level":2,"score":0.5005667209625244},{"id":"https://openalex.org/C138268822","wikidata":"https://www.wikidata.org/wiki/Q1051925","display_name":"Resolution (logic)","level":2,"score":0.4674210250377655},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4569888114929199},{"id":"https://openalex.org/C100481476","wikidata":"https://www.wikidata.org/wiki/Q4055684","display_name":"First-order logic","level":2,"score":0.44576162099838257},{"id":"https://openalex.org/C140146324","wikidata":"https://www.wikidata.org/wiki/Q1144319","display_name":"Predicate (mathematical logic)","level":2,"score":0.4438035786151886},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.42186439037323},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.4108128547668457},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.39454400539398193},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3939855396747589},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33128854632377625},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.2791644036769867},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.09178578853607178},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/03057920412331272207","is_oa":false,"landing_page_url":"https://doi.org/10.1080/03057920412331272207","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1482308554","https://openalex.org/W1556001983","https://openalex.org/W1646117648","https://openalex.org/W1856099230","https://openalex.org/W2058900023","https://openalex.org/W2079454194","https://openalex.org/W2098022011","https://openalex.org/W2117029917","https://openalex.org/W2120959311","https://openalex.org/W2126583599","https://openalex.org/W2150470619","https://openalex.org/W2464999653","https://openalex.org/W2487176464","https://openalex.org/W2765969748","https://openalex.org/W4247100129"],"related_works":["https://openalex.org/W4246350535","https://openalex.org/W3083050876","https://openalex.org/W1875958796","https://openalex.org/W1780472831","https://openalex.org/W1976200187","https://openalex.org/W1561644379","https://openalex.org/W2479603923","https://openalex.org/W2809689211","https://openalex.org/W260563712","https://openalex.org/W162260173"],"abstract_inverted_index":{"Semantic":[0],"trees":[1,56,69],"have":[2,98],"often":[3],"been":[4,23],"used":[5],"as":[6],"a":[7,43,48,90],"theoretical":[8],"tool":[9],"for":[10],"showing":[11],"the":[12,52,83,107,126],"unsatisfiability":[13],"of":[14,54,85,102,109],"clauses":[15,35],"in":[16],"first-order":[17],"predicate":[18],"logic.":[19],"Their":[20],"practicality":[21],"has":[22],"overshadowed,":[24],"however,":[25],"by":[26,78],"other":[27],"strategies.":[28],"In":[29,88],"this":[30],"paper,":[31],"we":[32],"introduce":[33],"unit":[34],"derived":[36],"from":[37],"resolutions":[38],"when":[39],"necessary":[40],"to":[41,47,97],"construct":[42],"semantic":[44,55,61,68,127],"tree,":[45],"leading":[46],"strategy":[49],"that":[50],"combines":[51,67],"construction":[53],"with":[57,82],"resolution\u2013refutation.":[58],"The":[59,73,111],"parallel":[60,74,91,133],"tree":[62,128],"theorem":[63],"prover,":[64,129],"called":[65],"PrHERBY,":[66],"and":[70,118,131],"resolution\u2013refutation":[71],"methods.":[72],"system":[75,96,113],"is":[76],"scalable":[77],"strategically":[79],"selecting":[80],"atoms":[81,124],"help":[84],"dedicated":[86],"resolutions.":[87],"addition,":[89],"grounding":[92],"scheme":[93],"allows":[94],"each":[95],"its":[99,132],"own":[100],"instance":[101],"generated":[103],"atoms,":[104],"thereby":[105],"increasing":[106],"possibility":[108],"success.":[110],"PrHERBY":[112],"presented":[114],"performs":[115],"significantly":[116],"better":[117],"generally":[119],"finds":[120],"proof":[121],"using":[122],"fewer":[123],"than":[125],"HERBY":[130],"version,":[134],"PHERBY.":[135]},"counts_by_year":[{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}