{"id":"https://openalex.org/W2108205915","doi":"https://doi.org/10.1145/2629337","title":"Terminating Evaluation of Logic Programs with Finite Three-Valued Models","display_name":"Terminating Evaluation of Logic Programs with Finite Three-Valued Models","publication_year":2014,"publication_date":"2014-08-01","ids":{"openalex":"https://openalex.org/W2108205915","doi":"https://doi.org/10.1145/2629337","mag":"2108205915"},"language":"en","primary_location":{"id":"doi:10.1145/2629337","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2629337","pdf_url":null,"source":{"id":"https://openalex.org/S117153874","display_name":"ACM Transactions on Computational Logic","issn_l":"1529-3785","issn":["1529-3785","1557-945X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computational Logic","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5086909487","display_name":"Fabrizio Riguzzi","orcid":"https://orcid.org/0000-0003-1654-9703"},"institutions":[{"id":"https://openalex.org/I201324441","display_name":"University of Ferrara","ror":"https://ror.org/041zkgm14","country_code":"IT","type":"education","lineage":["https://openalex.org/I201324441"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Fabrizio Riguzzi","raw_affiliation_strings":["University of Ferrara, Ferrara, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Ferrara, Ferrara, Italy","institution_ids":["https://openalex.org/I201324441"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113464756","display_name":"Terrance Swift","orcid":null},"institutions":[{"id":"https://openalex.org/I83558840","display_name":"Universidade Nova de Lisboa","ror":"https://ror.org/02xankh89","country_code":"PT","type":"education","lineage":["https://openalex.org/I83558840"]}],"countries":["PT"],"is_corresponding":false,"raw_author_name":"Terrance Swift","raw_affiliation_strings":["Coherent Knowledge Systems, Inc. and NOVALincs, Universidade Nova de Lisboa, Portugal"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Coherent Knowledge Systems, Inc. and NOVALincs, Universidade Nova de Lisboa, Portugal","institution_ids":["https://openalex.org/I83558840"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.4851,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.91085038,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"15","issue":"4","first_page":"1","last_page":"38"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9998000264167786,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9998000264167786,"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/T10456","display_name":"Multi-Agent Systems and Negotiation","score":0.995199978351593,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9948999881744385,"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/bounded-function","display_name":"Bounded function","score":0.6731920838356018},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5661061406135559},{"id":"https://openalex.org/keywords/logic-program","display_name":"Logic program","score":0.5568608641624451},{"id":"https://openalex.org/keywords/answer-set-programming","display_name":"Answer set programming","score":0.53572016954422},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.5196153521537781},{"id":"https://openalex.org/keywords/abstraction","display_name":"Abstraction","score":0.4947490394115448},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4689001142978668},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4649566113948822},{"id":"https://openalex.org/keywords/term","display_name":"Term (time)","score":0.459800660610199},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4253511428833008},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.41262906789779663},{"id":"https://openalex.org/keywords/logic-programming","display_name":"Logic programming","score":0.39922913908958435},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3972945213317871},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3789675533771515},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33777886629104614},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1270734667778015}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6731920838356018},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5661061406135559},{"id":"https://openalex.org/C2987117450","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic program","level":3,"score":0.5568608641624451},{"id":"https://openalex.org/C182620335","wikidata":"https://www.wikidata.org/wiki/Q2852531","display_name":"Answer set programming","level":3,"score":0.53572016954422},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5196153521537781},{"id":"https://openalex.org/C124304363","wikidata":"https://www.wikidata.org/wiki/Q673661","display_name":"Abstraction","level":2,"score":0.4947490394115448},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4689001142978668},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4649566113948822},{"id":"https://openalex.org/C61797465","wikidata":"https://www.wikidata.org/wiki/Q1188986","display_name":"Term (time)","level":2,"score":0.459800660610199},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4253511428833008},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.41262906789779663},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.39922913908958435},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3972945213317871},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3789675533771515},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33777886629104614},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1270734667778015},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"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/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},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/2629337","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2629337","pdf_url":null,"source":{"id":"https://openalex.org/S117153874","display_name":"ACM Transactions on Computational Logic","issn_l":"1529-3785","issn":["1529-3785","1557-945X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computational Logic","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.294.8587","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.294.8587","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.sunysb.edu/~tswift/webpapers/sbts.pdf","raw_type":"text"},{"id":"pmh:oai:iris.unife.it:11392/2204212","is_oa":false,"landing_page_url":"http://hdl.handle.net/11392/2204212","pdf_url":null,"source":{"id":"https://openalex.org/S4306400369","display_name":"Institutional Research Information System University of Ferrara (University of Ferrara)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I201324441","host_organization_name":"University of Ferrara","host_organization_lineage":["https://openalex.org/I201324441"],"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":null,"sustainable_development_goals":[{"display_name":"Partnerships for the goals","id":"https://metadata.un.org/sdg/17","score":0.44999998807907104}],"awards":[],"funders":[{"id":"https://openalex.org/F4320334779","display_name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","ror":"https://ror.org/00snfqn58"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":53,"referenced_works":["https://openalex.org/W26772505","https://openalex.org/W31561947","https://openalex.org/W649907208","https://openalex.org/W1484110122","https://openalex.org/W1488953560","https://openalex.org/W1522225310","https://openalex.org/W1552168992","https://openalex.org/W1566656731","https://openalex.org/W1579524364","https://openalex.org/W1590284853","https://openalex.org/W1658739789","https://openalex.org/W1672891595","https://openalex.org/W1681333182","https://openalex.org/W1821679657","https://openalex.org/W1965483956","https://openalex.org/W1968513265","https://openalex.org/W1985455954","https://openalex.org/W1997210046","https://openalex.org/W2009286786","https://openalex.org/W2011889853","https://openalex.org/W2011958646","https://openalex.org/W2013096722","https://openalex.org/W2013130775","https://openalex.org/W2029399717","https://openalex.org/W2031868932","https://openalex.org/W2035046277","https://openalex.org/W2051564255","https://openalex.org/W2051741066","https://openalex.org/W2057035741","https://openalex.org/W2057069578","https://openalex.org/W2070546615","https://openalex.org/W2070598037","https://openalex.org/W2091478774","https://openalex.org/W2102729564","https://openalex.org/W2111739714","https://openalex.org/W2114898754","https://openalex.org/W2120056071","https://openalex.org/W2124061668","https://openalex.org/W2129825950","https://openalex.org/W2132745831","https://openalex.org/W2136233667","https://openalex.org/W2137327104","https://openalex.org/W2140466857","https://openalex.org/W2165876990","https://openalex.org/W2184105893","https://openalex.org/W2199182687","https://openalex.org/W2290835149","https://openalex.org/W2397971081","https://openalex.org/W2561675875","https://openalex.org/W2963676309","https://openalex.org/W3098606030","https://openalex.org/W3099640838","https://openalex.org/W3103070746"],"related_works":["https://openalex.org/W1511336005","https://openalex.org/W4231236017","https://openalex.org/W3088092049","https://openalex.org/W2076569795","https://openalex.org/W1575307414","https://openalex.org/W3215639365","https://openalex.org/W1556363336","https://openalex.org/W3048361371","https://openalex.org/W1756530980","https://openalex.org/W2611359631"],"abstract_inverted_index":{"As":[0],"evaluation":[1],"methods":[2],"for":[3,14,38,82,139],"logic":[4],"programs":[5,13,28,84,97,104,138,151,157,168,174,190],"have":[6,20],"become":[7],"more":[8],"sophisticated,":[9],"the":[10,23,46,62,99,124,135,171,193,214,220],"classes":[11,37],"of":[12,25,64,101,117,134,175,216,222],"which":[15,39,140],"termination":[16,80],"can":[17,42,202],"be":[18,203],"guaranteed":[19],"expanded.":[21],"From":[22,61],"perspective":[24,63],"ar":[26],"set":[27,208],"that":[29,71,201],"include":[30],"function":[31],"symbols,":[32],"recent":[33],"work":[34],"has":[35,67,182],"identified":[36],"grounding":[40],"routines":[41],"terminate":[43],"either":[44],"on":[45,54,186],"entire":[47],"program":[48,200],"[Calimeri":[49],"et":[50,58,177],"al.":[51,59,178],"2008]":[52],"or":[53],"suitable":[55],"queries":[56,136],"[Baselice":[57],"2009].":[60],"tabling,":[65],"it":[66],"long":[68],"been":[69],"known":[70,195],"a":[72,114,131,198],"tabling":[73,118],"technique":[74],"called":[75],"subgoal":[76,120,217],"abstraction":[77,121,218],"provides":[78],"good":[79],"properties":[81],"definite":[83],"[Tamaki":[85],"and":[86,89,106,137,152,196,224],"Sato":[87],"1986],":[88],"this":[90,110,146],"result":[91],"was":[92],"recently":[93],"extended":[94],"to":[95,156,192,205],"stratified":[96],"via":[98],"class":[100,147],"bounded":[102,149,166,188],"term-size":[103,150,167,189],"[Riguzzi":[105],"Swift":[107],"2013].":[108],"In":[109],"article,":[111],"we":[112,129,212],"provide":[113,225],"formal":[115],"definition":[116],"with":[119,158],"resulting":[122],"in":[123],"SLG":[125,141,180],"SA":[126,142,181],"algorithm.":[127],"Moreover,":[128],"discuss":[130],"declarative":[132],"characterization":[133],"terminates.":[143],"We":[144],"call":[145],"strongly":[148,165,187],"show":[153],"its":[154],"equivalence":[155],"finite":[159],"well-founded":[160],"models.":[161],"For":[162],"normal":[163],"programs,":[164],"strictly":[169],"includes":[170],"finitely":[172],"ground":[173],"Calimeri":[176],"[2008].":[179],"an":[183,206],"asymptotic":[184],"complexity":[185],"equal":[191],"best":[194],"produces":[197],"residual":[199],"sent":[204],"answer":[207],"programming":[209],"system.":[210],"Finally,":[211],"describe":[213],"implementation":[215],"within":[219],"SLG-WAM":[221],"XSB":[223],"performance":[226],"results.":[227]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}