{"id":"https://openalex.org/W1979010687","doi":"https://doi.org/10.1017/s1471068401001235","title":"On redundancy elimination tolerant scheduling rules","display_name":"On redundancy elimination tolerant scheduling rules","publication_year":2001,"publication_date":"2001-09-01","ids":{"openalex":"https://openalex.org/W1979010687","doi":"https://doi.org/10.1017/s1471068401001235","mag":"1979010687"},"language":"en","primary_location":{"id":"doi:10.1017/s1471068401001235","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068401001235","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":["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/A5053084752","display_name":"Filomena Ferrucci","orcid":"https://orcid.org/0000-0002-0975-8972"},"institutions":[{"id":"https://openalex.org/I131729948","display_name":"University of Salerno","ror":"https://ror.org/0192m2k53","country_code":"IT","type":"education","lineage":["https://openalex.org/I131729948"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"FILOMENA FERRUCCI","raw_affiliation_strings":["DMI Universita' di Salerno - via S. Allende, 84081 Baronissi (SA), Italy (e-mail:","DMI Universita' di Salerno - via S. Allende, 84081 Baronissi (SA), Italy (e-mail: filfer@unisa.it, mis@unisa.it)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"DMI Universita' di Salerno - via S. Allende, 84081 Baronissi (SA), Italy (e-mail:","institution_ids":["https://openalex.org/I131729948"]},{"raw_affiliation_string":"DMI Universita' di Salerno - via S. Allende, 84081 Baronissi (SA), Italy (e-mail: filfer@unisa.it, mis@unisa.it)","institution_ids":["https://openalex.org/I131729948"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5089460689","display_name":"Mar\u00eda I. Sessa","orcid":null},"institutions":[{"id":"https://openalex.org/I131729948","display_name":"University of Salerno","ror":"https://ror.org/0192m2k53","country_code":"IT","type":"education","lineage":["https://openalex.org/I131729948"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"MARIA I. SESSA","raw_affiliation_strings":["DMI Universita' di Salerno - via S. Allende, 84081 Baronissi (SA), Italy (e-mail:","DMI Universita' di Salerno - via S. Allende, 84081 Baronissi (SA), Italy (e-mail: filfer@unisa.it, mis@unisa.it)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"DMI Universita' di Salerno - via S. Allende, 84081 Baronissi (SA), Italy (e-mail:","institution_ids":["https://openalex.org/I131729948"]},{"raw_affiliation_string":"DMI Universita' di Salerno - via S. Allende, 84081 Baronissi (SA), Italy (e-mail: filfer@unisa.it, mis@unisa.it)","institution_ids":["https://openalex.org/I131729948"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086467812","display_name":"G. Pacini","orcid":null},"institutions":[{"id":"https://openalex.org/I205887594","display_name":"Rina Services (Italy)","ror":"https://ror.org/0562tzd79","country_code":"IT","type":"company","lineage":["https://openalex.org/I205887594"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"GIULIANO PACINI","raw_affiliation_strings":["Accademia Navale, Viale Italia 72, 57100 Livorno, Italy (e-mail:","Accademia Navale, Viale Italia 72, 57100 Livorno, Italy (e-mail: pacini@di.unipi.it)#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Accademia Navale, Viale Italia 72, 57100 Livorno, Italy (e-mail:","institution_ids":["https://openalex.org/I205887594"]},{"raw_affiliation_string":"Accademia Navale, Viale Italia 72, 57100 Livorno, Italy (e-mail: pacini@di.unipi.it)#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.09330478,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"1","issue":"5","first_page":"539","last_page":"590"},"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.9988999962806702,"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.9988999962806702,"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.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"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9909999966621399,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8344091176986694},{"id":"https://openalex.org/keywords/redundancy","display_name":"Redundancy (engineering)","score":0.5981762409210205},{"id":"https://openalex.org/keywords/rewriting","display_name":"Rewriting","score":0.5707545280456543},{"id":"https://openalex.org/keywords/resolvent","display_name":"Resolvent","score":0.506578803062439},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4962170720100403},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.42573580145835876},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3794448673725128},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.33230745792388916},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.23410934209823608},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14123421907424927}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8344091176986694},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.5981762409210205},{"id":"https://openalex.org/C154690210","wikidata":"https://www.wikidata.org/wiki/Q1668499","display_name":"Rewriting","level":2,"score":0.5707545280456543},{"id":"https://openalex.org/C196267783","wikidata":"https://www.wikidata.org/wiki/Q4392490","display_name":"Resolvent","level":2,"score":0.506578803062439},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4962170720100403},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.42573580145835876},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3794448673725128},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.33230745792388916},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.23410934209823608},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14123421907424927},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1017/s1471068401001235","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068401001235","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:CiteSeerX.psu:10.1.1.342.6905","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.342.6905","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/cs/0004006v1.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.6299999952316284}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W31561947","https://openalex.org/W1522225310","https://openalex.org/W1528738961","https://openalex.org/W1541434994","https://openalex.org/W1597918680","https://openalex.org/W1968592673","https://openalex.org/W2002555248","https://openalex.org/W2009286786","https://openalex.org/W2011306767","https://openalex.org/W2023204491","https://openalex.org/W2039099537","https://openalex.org/W2055093184","https://openalex.org/W2069453418","https://openalex.org/W2075222975","https://openalex.org/W2091478774","https://openalex.org/W2100264125","https://openalex.org/W2120869002","https://openalex.org/W2120913343","https://openalex.org/W2123319860","https://openalex.org/W2612793397","https://openalex.org/W2615155304","https://openalex.org/W2752853835"],"related_works":["https://openalex.org/W2350866827","https://openalex.org/W2120204135","https://openalex.org/W2963600173","https://openalex.org/W2951761543","https://openalex.org/W174435416","https://openalex.org/W4327812601","https://openalex.org/W1796293478","https://openalex.org/W2795788140","https://openalex.org/W2168276503","https://openalex.org/W2139396251"],"abstract_inverted_index":{"In":[0,18,58],"Ferrucci,":[1],"Pacini":[2],"and":[3,138],"Sessa":[4],"(1995)":[5],"an":[6,20,24,92,234],"extended":[7],"form":[8],"of":[9,71,85,94,111,116,146,148,154,171,185,191,195,230,262],"resolution,":[10],"called":[11],"Reduced":[12],"SLD":[13,25,270],"resolution":[14],"(RSLD),":[15],"is":[16,23,33,40,125,130,141,203,266],"introduced.":[17],"essence,":[19],"RSLD":[21],"derivation":[22,26,50],"such":[27,86,245],"that":[28,42,100,244,256],"redundancy":[29,43,172,251],"elimination":[30,44,173],"from":[31,109,151,269],"resolvents":[32],"performed":[34],"after":[35],"each":[36,133],"rewriting":[37,159],"step.":[38],"It":[39],"intuitive":[41],"may":[45,80],"have":[46,102,233],"positive":[47],"effects":[48,54,87],"on":[49],"process.":[51],"However,":[52],"undesiderable":[53],"are":[55,248],"also":[56],"possible.":[57],"particular,":[59],"as":[60,67,69],"shown":[61],"in":[62,135,205,253],"this":[63],"paper,":[64],"program":[65,258],"termination":[66,259],"well":[68],"completeness":[70,261],"loop":[72,264],"checking":[73],"mechanisms":[74],"via":[75],"a":[76,128,136,189,193,215,228],"given":[77,142],"selection":[78,95,113,186],"rule":[79,96],"be":[81],"lost.":[82],"The":[83],"study":[84,170],"has":[88],"led":[89],"us":[90],"to":[91,105,114,132,143,167,225,250,271],"analysis":[93],"basic":[97],"concepts,":[98],"so":[99],"we":[101,242],"found":[103],"convenient":[104],"move":[106],"the":[107,144,152,155,169,177,199,206,254],"attention":[108],"rules":[110,115,222,231,247],"atom":[112,117,123,134],"scheduling.":[118],"A":[119],"priority":[120,129],"mechanism":[121],"for":[122],"scheduling":[124,196,221,246],"built,":[126],"where":[127],"assigned":[131],"resolvent,":[137],"primary":[139],"importance":[140],"event":[145],"arrival":[147],"new":[149,162],"atoms":[150],"body":[153],"applied":[156],"clause":[157],"at":[158,176],"time.":[160],"This":[161],"computational":[163],"model":[164],"proves":[165],"able":[166],"address":[168],"effects,":[174],"giving":[175],"same":[178],"time":[179],"interesting":[180],"insights":[181],"into":[182],"general":[183],"properties":[184],"rules.":[187],"As":[188,214],"matter":[190],"fact,":[192],"class":[194,229],"rules,":[197],"namely":[198],"specialisation":[200,219],"independent":[201,220],"ones,":[202],"defined":[204],"paper":[207],"by":[208],"using":[209],"not":[210],"trivial":[211],"semantic":[212],"arguments.":[213],"quite":[216],"surprising":[217],"result,":[218],"turn":[223],"out":[224],"coincide":[226],"with":[227],"which":[232],"immediate":[235],"structural":[236],"characterisation":[237],"(named":[238],"stack-queue":[239],"rules).":[240],"Then":[241],"prove":[243],"tolerant":[249],"elimination,":[252],"sense":[255],"neither":[257],"nor":[260],"equality":[263],"check":[265],"lost":[267],"passing":[268],"RSLD.":[272]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}