{"id":"https://openalex.org/W2157661807","doi":"https://doi.org/10.3233/sat190015","title":"Hard Satisfiable Clause Sets for Benchmarking Equivalence Reasoning Techniques","display_name":"Hard Satisfiable Clause Sets for Benchmarking Equivalence Reasoning Techniques","publication_year":2006,"publication_date":"2006-03-01","ids":{"openalex":"https://openalex.org/W2157661807","doi":"https://doi.org/10.3233/sat190015","mag":"2157661807"},"language":"en","primary_location":{"id":"doi:10.3233/sat190015","is_oa":true,"landing_page_url":"https://doi.org/10.3233/sat190015","pdf_url":"https://content.iospress.com:443/download/journal-on-satisfiability-boolean-modeling-and-computation/sat190015?id=journal-on-satisfiability-boolean-modeling-and-computation%2Fsat190015","source":{"id":"https://openalex.org/S92264924","display_name":"Journal on Satisfiability Boolean Modeling and Computation","issn_l":"1574-0617","issn":["1574-0617","1875-5011"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal on Satisfiability, Boolean Modeling and Computation","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://content.iospress.com:443/download/journal-on-satisfiability-boolean-modeling-and-computation/sat190015?id=journal-on-satisfiability-boolean-modeling-and-computation%2Fsat190015","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5007724460","display_name":"Harri Haanp\u00e4\u00e4","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Harri Haanp\u00e4\u00e4","raw_affiliation_strings":["Laboratory for Theoretical Computer Science, Helsinki University of Technology, P.O. Box 5400, FI-02015 TKK, Finland. E-mails:\u00a0Harri.Haanpaa@tkk.fi,\u00a0Matti.Jarvisalo@tkk.fi,\u00a0Petteri.Kaski@tkk.fi,\u00a0Ilkka.Niemela@tkk.fi"],"affiliations":[{"raw_affiliation_string":"Laboratory for Theoretical Computer Science, Helsinki University of Technology, P.O. Box 5400, FI-02015 TKK, Finland. E-mails:\u00a0Harri.Haanpaa@tkk.fi,\u00a0Matti.Jarvisalo@tkk.fi,\u00a0Petteri.Kaski@tkk.fi,\u00a0Ilkka.Niemela@tkk.fi","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081120128","display_name":"Matti J\u0084\u00e4rvisalo","orcid":"https://orcid.org/0000-0003-2572-063X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Matti J\u00e4rvisalo","raw_affiliation_strings":["Laboratory for Theoretical Computer Science, Helsinki University of Technology, P.O. Box 5400, FI-02015 TKK, Finland. E-mails:\u00a0Harri.Haanpaa@tkk.fi,\u00a0Matti.Jarvisalo@tkk.fi,\u00a0Petteri.Kaski@tkk.fi,\u00a0Ilkka.Niemela@tkk.fi"],"affiliations":[{"raw_affiliation_string":"Laboratory for Theoretical Computer Science, Helsinki University of Technology, P.O. Box 5400, FI-02015 TKK, Finland. E-mails:\u00a0Harri.Haanpaa@tkk.fi,\u00a0Matti.Jarvisalo@tkk.fi,\u00a0Petteri.Kaski@tkk.fi,\u00a0Ilkka.Niemela@tkk.fi","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5055721632","display_name":"Petteri Kaski","orcid":"https://orcid.org/0009-0002-3069-7753"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Petteri Kaski","raw_affiliation_strings":["Laboratory for Theoretical Computer Science, Helsinki University of Technology, P.O. Box 5400, FI-02015 TKK, Finland. E-mails:\u00a0Harri.Haanpaa@tkk.fi,\u00a0Matti.Jarvisalo@tkk.fi,\u00a0Petteri.Kaski@tkk.fi,\u00a0Ilkka.Niemela@tkk.fi"],"affiliations":[{"raw_affiliation_string":"Laboratory for Theoretical Computer Science, Helsinki University of Technology, P.O. Box 5400, FI-02015 TKK, Finland. E-mails:\u00a0Harri.Haanpaa@tkk.fi,\u00a0Matti.Jarvisalo@tkk.fi,\u00a0Petteri.Kaski@tkk.fi,\u00a0Ilkka.Niemela@tkk.fi","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5000911721","display_name":"Ilkka Niemel\u00e4","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ilkka Niemel\u00e4","raw_affiliation_strings":["Laboratory for Theoretical Computer Science, Helsinki University of Technology, P.O. Box 5400, FI-02015 TKK, Finland. E-mails:\u00a0Harri.Haanpaa@tkk.fi,\u00a0Matti.Jarvisalo@tkk.fi,\u00a0Petteri.Kaski@tkk.fi,\u00a0Ilkka.Niemela@tkk.fi"],"affiliations":[{"raw_affiliation_string":"Laboratory for Theoretical Computer Science, Helsinki University of Technology, P.O. Box 5400, FI-02015 TKK, Finland. E-mails:\u00a0Harri.Haanpaa@tkk.fi,\u00a0Matti.Jarvisalo@tkk.fi,\u00a0Petteri.Kaski@tkk.fi,\u00a0Ilkka.Niemela@tkk.fi","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5007724460"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.3706,"has_fulltext":true,"cited_by_count":38,"citation_normalized_percentile":{"value":0.92529066,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"2","issue":"1-4","first_page":"27","last_page":"46"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998000264167786,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10126","display_name":"Logic, programming, and type systems","score":0.9965000152587891,"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/equivalence","display_name":"Equivalence (formal languages)","score":0.7045325040817261},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5662490129470825},{"id":"https://openalex.org/keywords/benchmarking","display_name":"Benchmarking","score":0.5289229154586792},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.5105212926864624},{"id":"https://openalex.org/keywords/natural-language-processing","display_name":"Natural language processing","score":0.3441756069660187},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.33920809626579285},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.2652030885219574},{"id":"https://openalex.org/keywords/business","display_name":"Business","score":0.07483446598052979}],"concepts":[{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.7045325040817261},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5662490129470825},{"id":"https://openalex.org/C86251818","wikidata":"https://www.wikidata.org/wiki/Q816754","display_name":"Benchmarking","level":2,"score":0.5289229154586792},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5105212926864624},{"id":"https://openalex.org/C204321447","wikidata":"https://www.wikidata.org/wiki/Q30642","display_name":"Natural language processing","level":1,"score":0.3441756069660187},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33920809626579285},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2652030885219574},{"id":"https://openalex.org/C144133560","wikidata":"https://www.wikidata.org/wiki/Q4830453","display_name":"Business","level":0,"score":0.07483446598052979},{"id":"https://openalex.org/C162853370","wikidata":"https://www.wikidata.org/wiki/Q39809","display_name":"Marketing","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.3233/sat190015","is_oa":true,"landing_page_url":"https://doi.org/10.3233/sat190015","pdf_url":"https://content.iospress.com:443/download/journal-on-satisfiability-boolean-modeling-and-computation/sat190015?id=journal-on-satisfiability-boolean-modeling-and-computation%2Fsat190015","source":{"id":"https://openalex.org/S92264924","display_name":"Journal on Satisfiability Boolean Modeling and Computation","issn_l":"1574-0617","issn":["1574-0617","1875-5011"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal on Satisfiability, Boolean Modeling and Computation","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.108.8985","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.108.8985","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://jsat.ewi.tudelft.nl/content/volume2/JSAT2_2_Haanpaa.pdf","raw_type":"text"}],"best_oa_location":{"id":"doi:10.3233/sat190015","is_oa":true,"landing_page_url":"https://doi.org/10.3233/sat190015","pdf_url":"https://content.iospress.com:443/download/journal-on-satisfiability-boolean-modeling-and-computation/sat190015?id=journal-on-satisfiability-boolean-modeling-and-computation%2Fsat190015","source":{"id":"https://openalex.org/S92264924","display_name":"Journal on Satisfiability Boolean Modeling and Computation","issn_l":"1574-0617","issn":["1574-0617","1875-5011"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal on Satisfiability, Boolean Modeling and Computation","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.4399999976158142,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320321108","display_name":"Academy of Finland","ror":"https://ror.org/05k73zm37"},{"id":"https://openalex.org/F4320322426","display_name":"Nokia Foundation","ror":"https://ror.org/0401nzk46"},{"id":"https://openalex.org/F4320322861","display_name":"Emil Aaltosen S\u00e4\u00e4ti\u00f6","ror":"https://ror.org/005rt3g54"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2157661807.pdf","grobid_xml":"https://content.openalex.org/works/W2157661807.grobid-xml"},"referenced_works_count":63,"referenced_works":["https://openalex.org/W1480466499","https://openalex.org/W1503773079","https://openalex.org/W1508206977","https://openalex.org/W1518056084","https://openalex.org/W1518705996","https://openalex.org/W1542944854","https://openalex.org/W1556130451","https://openalex.org/W1561953468","https://openalex.org/W1592213313","https://openalex.org/W1594948273","https://openalex.org/W1600919542","https://openalex.org/W1601301932","https://openalex.org/W1631603072","https://openalex.org/W1689936258","https://openalex.org/W1819209966","https://openalex.org/W1950282396","https://openalex.org/W1968864043","https://openalex.org/W1978526866","https://openalex.org/W1979328057","https://openalex.org/W1982531027","https://openalex.org/W1987851683","https://openalex.org/W1993111701","https://openalex.org/W1993216347","https://openalex.org/W1999823208","https://openalex.org/W2017127020","https://openalex.org/W2021144815","https://openalex.org/W2038690430","https://openalex.org/W2040924621","https://openalex.org/W2045377861","https://openalex.org/W2048623062","https://openalex.org/W2059044209","https://openalex.org/W2069767473","https://openalex.org/W2078007422","https://openalex.org/W2084384424","https://openalex.org/W2098022011","https://openalex.org/W2121284046","https://openalex.org/W2125123691","https://openalex.org/W2126420408","https://openalex.org/W2133527541","https://openalex.org/W2135414548","https://openalex.org/W2142785340","https://openalex.org/W2149719182","https://openalex.org/W2155218845","https://openalex.org/W2157280385","https://openalex.org/W2160444875","https://openalex.org/W2168726553","https://openalex.org/W2171790376","https://openalex.org/W2285269242","https://openalex.org/W2296572843","https://openalex.org/W2766195878","https://openalex.org/W2950654313","https://openalex.org/W2951536659","https://openalex.org/W3140660692","https://openalex.org/W4233090747","https://openalex.org/W4239360664","https://openalex.org/W4242206114","https://openalex.org/W4245630182","https://openalex.org/W6631101949","https://openalex.org/W6683185822","https://openalex.org/W6779915889","https://openalex.org/W6814292443","https://openalex.org/W6941226251","https://openalex.org/W6966448157"],"related_works":["https://openalex.org/W4238897586","https://openalex.org/W435179959","https://openalex.org/W2619091065","https://openalex.org/W2341842940","https://openalex.org/W1490753184","https://openalex.org/W2284465472","https://openalex.org/W2291782699","https://openalex.org/W1993948687","https://openalex.org/W2059640416","https://openalex.org/W2329895846"],"abstract_inverted_index":{"A":[0],"family":[1],"of":[2,25],"satisfiable":[3],"benchmark":[4],"instances":[5,13],"in":[6],"conjunctive":[7],"normal":[8],"form":[9],"is":[10],"introduced.":[11],"The":[12],"are":[14],"constructed":[15],"by":[16,29],"transforming":[17],"a":[18,23],"random":[19],"regular":[20],"graph":[21],"into":[22],"system":[24],"linear":[26],"equations":[27],"followed":[28],"clausification.":[30],"Schemes":[31],"for":[32],"introducing":[33],"nonlinear":[34]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":5}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}