{"id":"https://openalex.org/W2128219525","doi":"https://doi.org/10.1017/s1471068410000165","title":"Automated termination analysis for logic programs with cut","display_name":"Automated termination analysis for logic programs with cut","publication_year":2010,"publication_date":"2010-07-01","ids":{"openalex":"https://openalex.org/W2128219525","doi":"https://doi.org/10.1017/s1471068410000165","mag":"2128219525"},"language":"en","primary_location":{"id":"doi:10.1017/s1471068410000165","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068410000165","pdf_url":null,"source":{"id":"https://openalex.org/S59670734","display_name":"Theory and Practice of Logic Programming","issn_l":"1471-0684","issn":["1471-0684","1475-3081"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory and Practice of Logic Programming","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1007.4908","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5058200123","display_name":"Peter Schneider\u2013Kamp","orcid":"https://orcid.org/0000-0003-4000-5570"},"institutions":[{"id":"https://openalex.org/I177969490","display_name":"University of Southern Denmark","ror":"https://ror.org/03yrrjy16","country_code":"DK","type":"education","lineage":["https://openalex.org/I177969490"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"PETER SCHNEIDER-KAMP","raw_affiliation_strings":["Department of Mathematics and Computer Science, University of Southern Denmark, Denmark"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, University of Southern Denmark, Denmark","institution_ids":["https://openalex.org/I177969490"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025232172","display_name":"J\u00fcrgen Giesl","orcid":"https://orcid.org/0000-0003-0283-8520"},"institutions":[{"id":"https://openalex.org/I887968799","display_name":"RWTH Aachen University","ror":"https://ror.org/04xfq0f34","country_code":"DE","type":"education","lineage":["https://openalex.org/I887968799"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"J\u00dcRGEN GIESL","raw_affiliation_strings":["LuFG Informatik 2, RWTH Aachen University, Germany","Lufg informatik 2, rwth aachen university, germany#TAB#"],"affiliations":[{"raw_affiliation_string":"LuFG Informatik 2, RWTH Aachen University, Germany","institution_ids":["https://openalex.org/I887968799"]},{"raw_affiliation_string":"Lufg informatik 2, rwth aachen university, germany#TAB#","institution_ids":["https://openalex.org/I887968799"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5072166791","display_name":"Thomas Str\u00f6der","orcid":null},"institutions":[{"id":"https://openalex.org/I887968799","display_name":"RWTH Aachen University","ror":"https://ror.org/04xfq0f34","country_code":"DE","type":"education","lineage":["https://openalex.org/I887968799"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"THOMAS STR\u00d6DER","raw_affiliation_strings":["LuFG Informatik 2, RWTH Aachen University, Germany","Lufg informatik 2, rwth aachen university, germany#TAB#"],"affiliations":[{"raw_affiliation_string":"LuFG Informatik 2, RWTH Aachen University, Germany","institution_ids":["https://openalex.org/I887968799"]},{"raw_affiliation_string":"Lufg informatik 2, rwth aachen university, germany#TAB#","institution_ids":["https://openalex.org/I887968799"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5054753279","display_name":"Alexander Serebrenik","orcid":"https://orcid.org/0000-0002-1418-0095"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"ALEXANDER SEREBRENIK","raw_affiliation_strings":["Department of Mathematics and Computer Science, TU Eindhoven, The Netherlands","Department of Mathematics & Computer Science, TU Eindhoven, The Netherlands#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, TU Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]},{"raw_affiliation_string":"Department of Mathematics & Computer Science, TU Eindhoven, The Netherlands#TAB#","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5078037586","display_name":"Ren\u00e9 Thiemann","orcid":"https://orcid.org/0000-0002-0323-8829"},"institutions":[{"id":"https://openalex.org/I190249584","display_name":"Universit\u00e4t Innsbruck","ror":"https://ror.org/054pv6659","country_code":"AT","type":"education","lineage":["https://openalex.org/I190249584"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"REN\u00c9 THIEMANN","raw_affiliation_strings":["Institute of Computer Science, University of Innsbruck, Austria","Institute of Computer Science, University of Innsbruck, Austria.#TAB#"],"affiliations":[{"raw_affiliation_string":"Institute of Computer Science, University of Innsbruck, Austria","institution_ids":["https://openalex.org/I190249584"]},{"raw_affiliation_string":"Institute of Computer Science, University of Innsbruck, Austria.#TAB#","institution_ids":["https://openalex.org/I190249584"]}]}],"institutions":[],"countries_distinct_count":4,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5058200123"],"corresponding_institution_ids":["https://openalex.org/I177969490"],"apc_list":null,"apc_paid":null,"fwci":9.3097,"has_fulltext":false,"cited_by_count":34,"citation_normalized_percentile":{"value":0.97907707,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"10","issue":"4-6","first_page":"365","last_page":"381"},"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/T10142","display_name":"Formal Methods in Verification","score":0.9994000196456909,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.996999979019165,"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/prolog","display_name":"Prolog","score":0.8971340656280518},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8038018941879272},{"id":"https://openalex.org/keywords/gas-meter-prover","display_name":"Gas meter prover","score":0.6591975688934326},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.6247557401657104},{"id":"https://openalex.org/keywords/logic-programming","display_name":"Logic programming","score":0.5862700343132019},{"id":"https://openalex.org/keywords/horn-clause","display_name":"Horn clause","score":0.5778215527534485},{"id":"https://openalex.org/keywords/automated-theorem-proving","display_name":"Automated theorem proving","score":0.4773530960083008},{"id":"https://openalex.org/keywords/logic-program","display_name":"Logic program","score":0.4765204191207886},{"id":"https://openalex.org/keywords/property","display_name":"Property (philosophy)","score":0.42698508501052856},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3645106852054596},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.12128117680549622},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.09006178379058838}],"concepts":[{"id":"https://openalex.org/C81721847","wikidata":"https://www.wikidata.org/wiki/Q163468","display_name":"Prolog","level":2,"score":0.8971340656280518},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8038018941879272},{"id":"https://openalex.org/C159718280","wikidata":"https://www.wikidata.org/wiki/Q5526353","display_name":"Gas meter prover","level":3,"score":0.6591975688934326},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.6247557401657104},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.5862700343132019},{"id":"https://openalex.org/C189790780","wikidata":"https://www.wikidata.org/wiki/Q933932","display_name":"Horn clause","level":3,"score":0.5778215527534485},{"id":"https://openalex.org/C206880738","wikidata":"https://www.wikidata.org/wiki/Q431667","display_name":"Automated theorem proving","level":2,"score":0.4773530960083008},{"id":"https://openalex.org/C2987117450","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic program","level":3,"score":0.4765204191207886},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.42698508501052856},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3645106852054596},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.12128117680549622},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.09006178379058838},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":12,"locations":[{"id":"doi:10.1017/s1471068410000165","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068410000165","pdf_url":null,"source":{"id":"https://openalex.org/S59670734","display_name":"Theory and Practice of Logic Programming","issn_l":"1471-0684","issn":["1471-0684","1475-3081"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory and Practice of Logic Programming","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:publications/a1d72558-0b73-490c-a7de-9ccf1c31d9ff","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/a1d72558-0b73-490c-a7de-9ccf1c31d9ff","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Schneider-Kamp, P, Giesl, J, Stroeder, T, Serebrenik, A & Thiemann, R 2010, 'Automated termination analysis for logic programs with cut', Theory and Practice of Logic Programming, vol. 10, no. 4-6, pp. 365-381. https://doi.org/10.1017/S1471068410000165","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:sdu.dk:publications/f4cbd835-2db3-4dd8-b053-200d6a0cbec9","is_oa":false,"landing_page_url":"https://portal.findresearcher.sdu.dk/da/publications/f4cbd835-2db3-4dd8-b053-200d6a0cbec9","pdf_url":null,"source":{"id":"https://openalex.org/S4306400423","display_name":"University of Southern Denmark Research Portal (University of Southern Denmark)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I177969490","host_organization_name":"University of Southern Denmark","host_organization_lineage":["https://openalex.org/I177969490"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Schneider-Kamp, P, Giesl, J, Str\u00f6der, T, Serebrenik, A & Thiemann, R 2010, 'Automated Termination Analysis for Logic Programs with Cut', Theory and Practice of Logic Programming, vol. 10, no. 4-6, pp. 365. https://doi.org/10.1017/S1471068410000165","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:arXiv.org:1007.4908","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1007.4908","pdf_url":"https://arxiv.org/pdf/1007.4908","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:674353","is_oa":false,"landing_page_url":"http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=674353","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN:1471-0684","raw_type":"Article / Letter to the editor"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.175.8929","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.175.8929","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://aib.informatik.rwth-aachen.de/2010/2010-10.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.184.3474","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.184.3474","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://verify.rwth-aachen.de/giesl/papers/CutReport.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.715.5391","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.715.5391","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://verify.rwth-aachen.de/stroeder/papers/wst2010.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.752.1607","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.752.1607","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1007.4908.pdf","raw_type":"text"},{"id":"pmh:oai:library.tue.nl:674353","is_oa":false,"landing_page_url":"http://repository.tue.nl/674353","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN:1471-0684","raw_type":"Article / Letter to the editor"},{"id":"pmh:oai:publications.rwth-aachen.de:169766","is_oa":false,"landing_page_url":"https://publications.rwth-aachen.de/record/169766","pdf_url":null,"source":{"id":"https://openalex.org/S4306401362","display_name":"RWTH Publications (RWTH Aachen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887968799","host_organization_name":"RWTH Aachen University","host_organization_lineage":["https://openalex.org/I887968799"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Theory and practice of logic programming : TPLP 10(4/6), 365-381 (2010). doi:10.1017/S1471068410000165","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:tue:oai:pure.tue.nl:publications/a1d72558-0b73-490c-a7de-9ccf1c31d9ff","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/a1d72558-0b73-490c-a7de-9ccf1c31d9ff","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Theory and Practice of Logic Programming, 10(4-6), 365 - 381. Cambridge University Press","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1007.4908","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1007.4908","pdf_url":"https://arxiv.org/pdf/1007.4908","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W36212144","https://openalex.org/W91193428","https://openalex.org/W1479857163","https://openalex.org/W1495922050","https://openalex.org/W1545180650","https://openalex.org/W1579524364","https://openalex.org/W1597918680","https://openalex.org/W1598890912","https://openalex.org/W1845547899","https://openalex.org/W1875104636","https://openalex.org/W1979684422","https://openalex.org/W2009286786","https://openalex.org/W2058402932","https://openalex.org/W2066556632","https://openalex.org/W2070546615","https://openalex.org/W2081810835","https://openalex.org/W2095555925","https://openalex.org/W2119843185","https://openalex.org/W2122211950","https://openalex.org/W2128219525","https://openalex.org/W2137327104","https://openalex.org/W2149677005","https://openalex.org/W2168393711","https://openalex.org/W2193302029","https://openalex.org/W2491413729","https://openalex.org/W2786353107","https://openalex.org/W2808509863","https://openalex.org/W2952575532","https://openalex.org/W4402318550","https://openalex.org/W6634777376"],"related_works":["https://openalex.org/W4246350535","https://openalex.org/W4238632608","https://openalex.org/W2388232299","https://openalex.org/W3083050876","https://openalex.org/W1875958796","https://openalex.org/W1974299393","https://openalex.org/W1780472831","https://openalex.org/W1976200187","https://openalex.org/W1493824320","https://openalex.org/W2741053223"],"abstract_inverted_index":{"Abstract":[0],"Termination":[1],"is":[2],"an":[3],"important":[4],"and":[5,86],"well-studied":[6],"property":[7],"for":[8,15,67],"logic":[9,22,45,72],"programs.":[10],"However,":[11],"almost":[12],"all":[13],"approaches":[14],"automated":[16],"termination":[17,50,56,69,83],"analysis":[18],"focus":[19],"on":[20],"definite":[21,71],"programs,":[23],"whereas":[24],"real-world":[25],"Prolog":[26,42],"programs":[27,43,46,73],"typically":[28],"use":[29],"the":[30,52,58],"cut":[31],"operator.":[32],"We":[33,77],"introduce":[34],"a":[35],"novel":[36],"pre-processing":[37,80],"method":[38],"which":[39],"automatically":[40],"transforms":[41],"into":[44],"without":[47],"cuts,":[48],"where":[49],"of":[51,57,70],"cut-free":[53],"program":[54],"implies":[55],"original":[59],"program.":[60],"Hence":[61],"after":[62],"this":[63,79],"pre-processing,":[64],"any":[65],"technique":[66],"proving":[68],"can":[74],"be":[75],"applied.":[76],"implemented":[78],"in":[81],"our":[82],"prover":[84],"AProVE":[85],"evaluated":[87],"it":[88],"successfully":[89],"with":[90],"extensive":[91],"experiments.":[92]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":8}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2020-11-23T00:00:00"}