{"id":"https://openalex.org/W2031435353","doi":"https://doi.org/10.1016/0304-3975(94)90015-9","title":"A linear algorithm for renaming a set of clauses as a Horn set","display_name":"A linear algorithm for renaming a set of clauses as a Horn set","publication_year":1994,"publication_date":"1994-02-01","ids":{"openalex":"https://openalex.org/W2031435353","doi":"https://doi.org/10.1016/0304-3975(94)90015-9","mag":"2031435353"},"language":"en","primary_location":{"id":"doi:10.1016/0304-3975(94)90015-9","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0304-3975(94)90015-9","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","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/A5043908552","display_name":"Jean-Jacques H\u00e9brard","orcid":null},"institutions":[{"id":"https://openalex.org/I98702875","display_name":"Universit\u00e9 de Caen Normandie","ror":"https://ror.org/051kpcy16","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210105918","https://openalex.org/I98702875"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Jean-Jacques H\u00e9brard","raw_affiliation_strings":["Laboratoire d'Informatique, Universit\u00e9 de Caen, F-14032 Caen Cedex, France","Univ. de Caen, Caen Cedex, France#TAB#"],"affiliations":[{"raw_affiliation_string":"Laboratoire d'Informatique, Universit\u00e9 de Caen, F-14032 Caen Cedex, France","institution_ids":[]},{"raw_affiliation_string":"Univ. de Caen, Caen Cedex, France#TAB#","institution_ids":["https://openalex.org/I98702875"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5043908552"],"corresponding_institution_ids":["https://openalex.org/I98702875"],"apc_list":{"value":2690,"currency":"USD","value_usd":2690},"apc_paid":null,"fwci":1.6156,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.84803922,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"124","issue":"2","first_page":"343","last_page":"350"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11567","display_name":"semigroups and automata theory","score":0.9977999925613403,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9973000288009644,"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/horn-clause","display_name":"Horn clause","score":0.8001464605331421},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6960781812667847},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.6414567828178406},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.622221052646637},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.48799577355384827},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4797305166721344},{"id":"https://openalex.org/keywords/french-horn","display_name":"French horn","score":0.43537938594818115},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.42567962408065796},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3303599953651428},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3016253411769867},{"id":"https://openalex.org/keywords/logic-programming","display_name":"Logic programming","score":0.11739650368690491},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.10723951458930969}],"concepts":[{"id":"https://openalex.org/C189790780","wikidata":"https://www.wikidata.org/wiki/Q933932","display_name":"Horn clause","level":3,"score":0.8001464605331421},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6960781812667847},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.6414567828178406},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.622221052646637},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.48799577355384827},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4797305166721344},{"id":"https://openalex.org/C152076505","wikidata":"https://www.wikidata.org/wiki/Q1126540","display_name":"French horn","level":2,"score":0.43537938594818115},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.42567962408065796},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3303599953651428},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3016253411769867},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.11739650368690491},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.10723951458930969},{"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/C19417346","wikidata":"https://www.wikidata.org/wiki/Q7922","display_name":"Pedagogy","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0304-3975(94)90015-9","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0304-3975(94)90015-9","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1970750671","https://openalex.org/W1978253773","https://openalex.org/W1981549588","https://openalex.org/W2003160050","https://openalex.org/W2011992362","https://openalex.org/W2069304919","https://openalex.org/W2084656180","https://openalex.org/W2091664441","https://openalex.org/W2109964311","https://openalex.org/W6642833478"],"related_works":["https://openalex.org/W2372612917","https://openalex.org/W1991403408","https://openalex.org/W1521840795","https://openalex.org/W2404351495","https://openalex.org/W2600034178","https://openalex.org/W328089188","https://openalex.org/W2542670467","https://openalex.org/W1808107509","https://openalex.org/W2064560955","https://openalex.org/W1599544148"],"abstract_inverted_index":null,"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-03-10T14:07:55.174380","created_date":"2025-10-10T00:00:00"}