{"id":"https://openalex.org/W2130140147","doi":"https://doi.org/10.1016/j.entcs.2004.06.065","title":"TSAT++: an Open Platform for Satisfiability Modulo Theories","display_name":"TSAT++: an Open Platform for Satisfiability Modulo Theories","publication_year":2005,"publication_date":"2005-07-01","ids":{"openalex":"https://openalex.org/W2130140147","doi":"https://doi.org/10.1016/j.entcs.2004.06.065","mag":"2130140147"},"language":"en","primary_location":{"id":"doi:10.1016/j.entcs.2004.06.065","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.entcs.2004.06.065","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.1016/j.entcs.2004.06.065","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5039827178","display_name":"Alessandro Armando","orcid":"https://orcid.org/0000-0002-5246-2157"},"institutions":[{"id":"https://openalex.org/I83816512","display_name":"University of Genoa","ror":"https://ror.org/0107c5v14","country_code":"IT","type":"education","lineage":["https://openalex.org/I83816512"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Alessandro Armando","raw_affiliation_strings":["MRG-DIST, University of Genova, Genova, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"MRG-DIST, University of Genova, Genova, Italy","institution_ids":["https://openalex.org/I83816512"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5019460740","display_name":"Claudio Castellini","orcid":"https://orcid.org/0000-0002-7346-2180"},"institutions":[{"id":"https://openalex.org/I83816512","display_name":"University of Genoa","ror":"https://ror.org/0107c5v14","country_code":"IT","type":"education","lineage":["https://openalex.org/I83816512"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Claudio Castellini","raw_affiliation_strings":["MRG-DIST, University of Genova, Genova, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"MRG-DIST, University of Genova, Genova, Italy","institution_ids":["https://openalex.org/I83816512"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5004609930","display_name":"Enrico Giunchiglia","orcid":"https://orcid.org/0000-0001-5758-2556"},"institutions":[{"id":"https://openalex.org/I83816512","display_name":"University of Genoa","ror":"https://ror.org/0107c5v14","country_code":"IT","type":"education","lineage":["https://openalex.org/I83816512"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Enrico Giunchiglia","raw_affiliation_strings":["MRG-DIST, University of Genova, Genova, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"MRG-DIST, University of Genova, Genova, Italy","institution_ids":["https://openalex.org/I83816512"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5032640313","display_name":"Massimo Idini","orcid":null},"institutions":[{"id":"https://openalex.org/I83816512","display_name":"University of Genoa","ror":"https://ror.org/0107c5v14","country_code":"IT","type":"education","lineage":["https://openalex.org/I83816512"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Massimo Idini","raw_affiliation_strings":["MRG-DIST, University of Genova, Genova, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"MRG-DIST, University of Genova, Genova, Italy","institution_ids":["https://openalex.org/I83816512"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5077756388","display_name":"Marco Maratea","orcid":"https://orcid.org/0000-0002-9034-2527"},"institutions":[{"id":"https://openalex.org/I83816512","display_name":"University of Genoa","ror":"https://ror.org/0107c5v14","country_code":"IT","type":"education","lineage":["https://openalex.org/I83816512"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Marco Maratea","raw_affiliation_strings":["MRG-DIST, University of Genova, Genova, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"MRG-DIST, University of Genova, Genova, Italy","institution_ids":["https://openalex.org/I83816512"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5004609930","https://openalex.org/A5019460740","https://openalex.org/A5032640313","https://openalex.org/A5039827178","https://openalex.org/A5077756388"],"corresponding_institution_ids":["https://openalex.org/I83816512"],"apc_list":null,"apc_paid":null,"fwci":2.6606,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.90558842,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"125","issue":"3","first_page":"25","last_page":"36"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9997000098228455,"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.9997000098228455,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9991999864578247,"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.9973999857902527,"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/satisfiability","display_name":"Satisfiability","score":0.82572340965271},{"id":"https://openalex.org/keywords/modulo","display_name":"Modulo","score":0.7777066826820374},{"id":"https://openalex.org/keywords/satisfiability-modulo-theories","display_name":"Satisfiability modulo theories","score":0.6514931917190552},{"id":"https://openalex.org/keywords/modular-design","display_name":"Modular design","score":0.6433525085449219},{"id":"https://openalex.org/keywords/modularity","display_name":"Modularity (biology)","score":0.5394014120101929},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4960709512233734},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.4550340175628662},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.45228761434555054},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4519486427307129},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4500772953033447},{"id":"https://openalex.org/keywords/literal","display_name":"Literal (mathematical logic)","score":0.4297364354133606},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.320922315120697},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.24085551500320435}],"concepts":[{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.82572340965271},{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.7777066826820374},{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.6514931917190552},{"id":"https://openalex.org/C101468663","wikidata":"https://www.wikidata.org/wiki/Q1620158","display_name":"Modular design","level":2,"score":0.6433525085449219},{"id":"https://openalex.org/C2779478453","wikidata":"https://www.wikidata.org/wiki/Q6889748","display_name":"Modularity (biology)","level":2,"score":0.5394014120101929},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4960709512233734},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.4550340175628662},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45228761434555054},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4519486427307129},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4500772953033447},{"id":"https://openalex.org/C2780882242","wikidata":"https://www.wikidata.org/wiki/Q14235582","display_name":"Literal (mathematical logic)","level":2,"score":0.4297364354133606},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.320922315120697},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.24085551500320435},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1016/j.entcs.2004.06.065","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.entcs.2004.06.065","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.1.3576","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1.3576","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.loria.fr/~ranise/pdpar04/papers/paper3.pdf","raw_type":"text"},{"id":"pmh:oai:iris.unige.it:11567/316852","is_oa":false,"landing_page_url":"http://hdl.handle.net/11567/316852","pdf_url":null,"source":{"id":"https://openalex.org/S4377196291","display_name":"CINECA IRIS Institutial Research Information System (University of Genoa)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I83816512","host_organization_name":"University of Genoa","host_organization_lineage":["https://openalex.org/I83816512"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1016/j.entcs.2004.06.065","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.entcs.2004.06.065","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W47684144","https://openalex.org/W56814239","https://openalex.org/W1489527380","https://openalex.org/W1516600063","https://openalex.org/W1531082202","https://openalex.org/W1532000439","https://openalex.org/W1553731663","https://openalex.org/W1571054242","https://openalex.org/W1589982562","https://openalex.org/W1834186039","https://openalex.org/W1948299783","https://openalex.org/W2043829066","https://openalex.org/W2047580205","https://openalex.org/W2057361103","https://openalex.org/W2089110971","https://openalex.org/W2103943372","https://openalex.org/W2121273320","https://openalex.org/W2259817465","https://openalex.org/W2479999086","https://openalex.org/W2622427009","https://openalex.org/W4285719527","https://openalex.org/W6631834109","https://openalex.org/W6633061677","https://openalex.org/W6634178641","https://openalex.org/W6635207884","https://openalex.org/W6640837604","https://openalex.org/W6664827099"],"related_works":["https://openalex.org/W2048903787","https://openalex.org/W2652810043","https://openalex.org/W2238963713","https://openalex.org/W2183278541","https://openalex.org/W2210642749","https://openalex.org/W2130140147","https://openalex.org/W2624368008","https://openalex.org/W1936354298","https://openalex.org/W2585406248","https://openalex.org/W2400691703"],"abstract_inverted_index":{"This":[0],"paper":[1],"describes":[2],"TSAT++,":[3,109,129],"an":[4,57],"open":[5],"platform":[6],"which":[7,38,56,110],"realizes":[8],"the":[9,20,114,119],"lazy":[10],"SAT-based":[11],"approach":[12],"to":[13,67,85,94],"Satisfiability":[14],"Modulo":[15],"Theories":[16],"(SMT).":[17],"SMT":[18],"is":[19,33,48,134],"problem":[21],"of":[22,25,29,45,83,102,113,118],"determining":[23],"satisfiability":[24,40,62,76],"a":[26,34,39,43,52,60,95],"propositional":[27],"combination":[28],"T-literals,":[30],"where":[31],"T":[32],"first-order":[35],"theory":[36],"for":[37,42,78,131,142],"procedure":[41],"set":[44],"ground":[46],"atoms":[47],"known.":[49],"TSAT++":[50],"enjoys":[51],"modular":[53],"design":[54],"in":[55,65,108],"enumerator":[58],"and":[59,75,97],"theory-specific":[61],"checker":[63],"cooperate":[64],"order":[66],"solve":[68],"SMT.":[69],"Modularity":[70],"allows":[71],"both":[72],"different":[73,79],"enumerators,":[74],"checkers":[77],"theories":[80],"(or":[81],"combinations":[82],"theories),":[84],"be":[86],"plugged":[87],"in,":[88],"as":[89,91],"far":[90],"they":[92],"comply":[93],"simple":[96],"well-defined":[98],"interface.":[99],"A":[100],"number":[101],"optimization":[103],"techniques":[104],"are":[105,111,125],"also":[106],"implemented":[107],"independent":[112],"modules":[115],"used":[116],"(and":[117],"corresponding":[120],"theory).":[121],"Some":[122],"experimental":[123],"results":[124],"presented,":[126],"showing":[127],"that":[128,143],"instantiated":[130],"Separation":[132],"Logic,":[133],"competitive":[135],"with,":[136],"or":[137],"faster":[138],"than,":[139],"state-of-the-art":[140],"solvers":[141],"very":[144],"logic.":[145]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}