{"id":"https://openalex.org/W2124587220","doi":"https://doi.org/10.3233/sat190043","title":"tts: A SAT-Solver for Small, Difficult Instances","display_name":"tts: A SAT-Solver for Small, Difficult Instances","publication_year":2008,"publication_date":"2008-06-01","ids":{"openalex":"https://openalex.org/W2124587220","doi":"https://doi.org/10.3233/sat190043","mag":"2124587220"},"language":"en","primary_location":{"id":"doi:10.3233/sat190043","is_oa":true,"landing_page_url":"https://doi.org/10.3233/sat190043","pdf_url":"https://content.iospress.com:443/download/journal-on-satisfiability-boolean-modeling-and-computation/sat190043?id=journal-on-satisfiability-boolean-modeling-and-computation%2Fsat190043","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/sat190043?id=journal-on-satisfiability-boolean-modeling-and-computation%2Fsat190043","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5049905270","display_name":"Ivor Spence","orcid":"https://orcid.org/0000-0002-0289-6790"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Ivor Spence","raw_affiliation_strings":["Institute of Electronics, Communications and Information Technology, Queen\u2019s University Belfast, Northern Ireland. E-mail:\u00a0i.spence@qub.ac.uk"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Electronics, Communications and Information Technology, Queen\u2019s University Belfast, Northern Ireland. E-mail:\u00a0i.spence@qub.ac.uk","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5049905270"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.2244,"has_fulltext":true,"cited_by_count":7,"citation_normalized_percentile":{"value":0.81401256,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"4","issue":"2-4","first_page":"173","last_page":"190"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9976000189781189,"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.9976000189781189,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9962999820709229,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.8345620632171631},{"id":"https://openalex.org/keywords/suite","display_name":"Suite","score":0.7382778525352478},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6950977444648743},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.6735302209854126},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.5977057814598083},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5007565021514893},{"id":"https://openalex.org/keywords/propositional-calculus","display_name":"Propositional calculus","score":0.49793338775634766},{"id":"https://openalex.org/keywords/ternary-operation","display_name":"Ternary operation","score":0.41990232467651367},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38943859934806824},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.3791343569755554},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.37298035621643066},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2345513105392456},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.08991566300392151}],"concepts":[{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.8345620632171631},{"id":"https://openalex.org/C79581498","wikidata":"https://www.wikidata.org/wiki/Q1367530","display_name":"Suite","level":2,"score":0.7382778525352478},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6950977444648743},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.6735302209854126},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.5977057814598083},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5007565021514893},{"id":"https://openalex.org/C69562738","wikidata":"https://www.wikidata.org/wiki/Q200694","display_name":"Propositional calculus","level":2,"score":0.49793338775634766},{"id":"https://openalex.org/C64452783","wikidata":"https://www.wikidata.org/wiki/Q1524945","display_name":"Ternary operation","level":2,"score":0.41990232467651367},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38943859934806824},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3791343569755554},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.37298035621643066},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2345513105392456},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.08991566300392151},{"id":"https://openalex.org/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","level":1,"score":0.0},{"id":"https://openalex.org/C95457728","wikidata":"https://www.wikidata.org/wiki/Q309","display_name":"History","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.3233/sat190043","is_oa":true,"landing_page_url":"https://doi.org/10.3233/sat190043","pdf_url":"https://content.iospress.com:443/download/journal-on-satisfiability-boolean-modeling-and-computation/sat190043?id=journal-on-satisfiability-boolean-modeling-and-computation%2Fsat190043","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:pure.qub.ac.uk/portal:publications/e5c3b087-3205-408e-b257-1d6901424967","is_oa":false,"landing_page_url":"https://pure.qub.ac.uk/en/publications/e5c3b087-3205-408e-b257-1d6901424967","pdf_url":null,"source":{"id":"https://openalex.org/S4306402319","display_name":"Research Portal (Queen's University Belfast)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I126231945","host_organization_name":"Queen's University Belfast","host_organization_lineage":["https://openalex.org/I126231945"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Spence, I 2008, 'tts: A SAT-Solver for Small, Difficult Instances', Journal on Satisfiability, Boolean Modeling and Computation, vol. 4, no. null, pp. 173-190.","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.151.2726","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.151.2726","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/volume4/JSAT4_9_Spence.pdf","raw_type":"text"}],"best_oa_location":{"id":"doi:10.3233/sat190043","is_oa":true,"landing_page_url":"https://doi.org/10.3233/sat190043","pdf_url":"https://content.iospress.com:443/download/journal-on-satisfiability-boolean-modeling-and-computation/sat190043?id=journal-on-satisfiability-boolean-modeling-and-computation%2Fsat190043","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":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2124587220.pdf","grobid_xml":"https://content.openalex.org/works/W2124587220.grobid-xml"},"referenced_works_count":11,"referenced_works":["https://openalex.org/W1487965496","https://openalex.org/W1503159836","https://openalex.org/W1567600461","https://openalex.org/W1592878310","https://openalex.org/W1923495615","https://openalex.org/W2024060531","https://openalex.org/W2057361103","https://openalex.org/W2090995721","https://openalex.org/W2139551184","https://openalex.org/W2150148016","https://openalex.org/W6656506093"],"related_works":["https://openalex.org/W2115480761","https://openalex.org/W4386614288","https://openalex.org/W3176904788","https://openalex.org/W21597398","https://openalex.org/W2091617677","https://openalex.org/W4298153058","https://openalex.org/W2408080066","https://openalex.org/W2268872489","https://openalex.org/W2920896101","https://openalex.org/W1913543287"],"abstract_inverted_index":{"The":[0],"Ternary":[1],"Tree":[2],"Solver":[3],"(tts":[4],")":[5],"is":[6],"a":[7,28],"complete":[8],"solver":[9],"for":[10],"propositional":[11],"satisfiability":[12],"which":[13],"was":[14],"designed":[15],"to":[16,34],"have":[17],"good":[18],"performance":[19],"on":[20],"the":[21,36],"most":[22],"difficult":[23],"small":[24],"instances.":[25],"It":[26],"uses":[27],"static":[29],"ternary":[30],"tree":[31],"data":[32],"structure":[33],"represent":[35],"simplified":[37],"propositi":[38]},"counts_by_year":[{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2026-03-10T14:07:55.174380","created_date":"2025-10-10T00:00:00"}