{"id":"https://openalex.org/W2046239089","doi":"https://doi.org/10.1016/s1571-0661(05)82542-3","title":"Temporal Induction by Incremental SAT Solving","display_name":"Temporal Induction by Incremental SAT Solving","publication_year":2003,"publication_date":"2003-01-01","ids":{"openalex":"https://openalex.org/W2046239089","doi":"https://doi.org/10.1016/s1571-0661(05)82542-3","mag":"2046239089"},"language":"en","primary_location":{"id":"doi:10.1016/s1571-0661(05)82542-3","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(05)82542-3","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/s1571-0661(05)82542-3","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5030158202","display_name":"Niklas E\u00e9n","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Niklas E\u00e9n","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5053866278","display_name":"Niklas S\u00f6rensson","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Niklas S\u00f6rensson","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5030158202"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":16.001,"has_fulltext":false,"cited_by_count":374,"citation_normalized_percentile":{"value":0.99364927,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":"89","issue":"4","first_page":"543","last_page":"560"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998999834060669,"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.9998999834060669,"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/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.995199978351593,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/model-checking","display_name":"Model checking","score":0.8377566337585449},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.657014012336731},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5585988163948059},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.5006334781646729},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4592769742012024},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.45758453011512756},{"id":"https://openalex.org/keywords/series","display_name":"Series (stratigraphy)","score":0.4560936987400055},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.44264543056488037},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.26300355792045593},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.24657940864562988}],"concepts":[{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.8377566337585449},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.657014012336731},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5585988163948059},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.5006334781646729},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4592769742012024},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.45758453011512756},{"id":"https://openalex.org/C143724316","wikidata":"https://www.wikidata.org/wiki/Q312468","display_name":"Series (stratigraphy)","level":2,"score":0.4560936987400055},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.44264543056488037},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26300355792045593},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.24657940864562988},{"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/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1016/s1571-0661(05)82542-3","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(05)82542-3","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.4.8161","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.4.8161","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.chalmers.se/~een/Tip/Temporal_Induction_by_Incremental_SAT_Solving.ps.gz","raw_type":"text"},{"id":"pmh:oai:publications.lib.chalmers.se:74330","is_oa":false,"landing_page_url":"http://publications.lib.chalmers.se/publication/74330-temporal-induction-by-incremental-sat-solving","pdf_url":null,"source":{"id":"https://openalex.org/S4377196470","display_name":"Chalmers Publication Library (Chalmers University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66862912","host_organization_name":"Chalmers University of Technology","host_organization_lineage":["https://openalex.org/I66862912"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text.Article.Journal.PeerReviewed"},{"id":"pmh:oai:research.chalmers.se:74330","is_oa":false,"landing_page_url":"https://research.chalmers.se/en/publication/74330","pdf_url":null,"source":{"id":"https://openalex.org/S4306402469","display_name":"Chalmers Research (Chalmers University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66862912","host_organization_name":"Chalmers University of Technology","host_organization_lineage":["https://openalex.org/I66862912"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""}],"best_oa_location":{"id":"doi:10.1016/s1571-0661(05)82542-3","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(05)82542-3","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1490969264","https://openalex.org/W1495266209","https://openalex.org/W1501649906","https://openalex.org/W1513300473","https://openalex.org/W1549820563","https://openalex.org/W1787074469","https://openalex.org/W2044560939","https://openalex.org/W2057361103","https://openalex.org/W2080267935","https://openalex.org/W2100404896","https://openalex.org/W2107470986","https://openalex.org/W2110123236","https://openalex.org/W2123736383","https://openalex.org/W2142785340","https://openalex.org/W2151056896","https://openalex.org/W2152426072","https://openalex.org/W4231640108","https://openalex.org/W4235527454","https://openalex.org/W4285719527","https://openalex.org/W6632923231","https://openalex.org/W6638020115","https://openalex.org/W6675337563","https://openalex.org/W6817500462"],"related_works":["https://openalex.org/W2186864281","https://openalex.org/W4255427455","https://openalex.org/W1966025497","https://openalex.org/W68941528","https://openalex.org/W4206451355","https://openalex.org/W2400856453","https://openalex.org/W1993103557","https://openalex.org/W2115480761","https://openalex.org/W4386614288","https://openalex.org/W2920896101"],"abstract_inverted_index":{"We":[0,22,43,61],"show":[1],"how":[2],"a":[3,8,16,35,46],"very":[4],"modest":[5],"modification":[6],"to":[7,14,26,39,56],"typical":[9],"modern":[10],"SAT-solver":[11],"enables":[12],"it":[13],"solve":[15],"series":[17],"of":[18,32,50,70],"related":[19,38],"SAT-instances":[20],"efficiently.":[21],"apply":[23],"this":[24],"idea":[25],"checking":[27],"safety":[28],"properties":[29],"by":[30],"means":[31],"temporal":[33],"induction,":[34],"technique":[36],"strongly":[37],"bounded":[40],"model":[41],"checking.":[42],"further":[44],"give":[45],"more":[47],"efficient":[48],"way":[49],"constraining":[51],"the":[52,65],"extended":[53],"induction":[54,71],"hypothesis":[55],"so":[57],"called":[58],"loop-free":[59],"paths.":[60],"have":[62],"also":[63],"performed":[64],"first":[66],"comprehensive":[67],"experimental":[68],"evaluation":[69],"methods":[72],"for":[73],"safety-checking.":[74]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":7},{"year":2024,"cited_by_count":12},{"year":2023,"cited_by_count":9},{"year":2022,"cited_by_count":8},{"year":2021,"cited_by_count":15},{"year":2020,"cited_by_count":17},{"year":2019,"cited_by_count":13},{"year":2018,"cited_by_count":23},{"year":2017,"cited_by_count":20},{"year":2016,"cited_by_count":18},{"year":2015,"cited_by_count":32},{"year":2014,"cited_by_count":28},{"year":2013,"cited_by_count":26},{"year":2012,"cited_by_count":18}],"updated_date":"2026-04-16T08:26:57.006410","created_date":"2025-10-10T00:00:00"}