{"id":"https://openalex.org/W16892029","doi":null,"title":"Resource temporal networks: definition and complexity","display_name":"Resource temporal networks: definition and complexity","publication_year":2003,"publication_date":"2003-08-09","ids":{"openalex":"https://openalex.org/W16892029","mag":"16892029"},"language":"en","primary_location":{"id":"mag:16892029","doi":null,"is_oa":false,"landing_page_url":"http://ijcai.org/Proceedings/03/Papers/137.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306419999","display_name":"International Joint Conference on Artificial Intelligence","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"International Joint Conference on Artificial Intelligence","raw_type":null},"volume":null,"type":"conference-paper","is_traditional":true,"indexed_in":[],"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/A5035849846","display_name":"Philippe Laborie","orcid":"https://orcid.org/0000-0002-4045-8601","observed_orcids":["https://orcid.org/0000-0002-4045-8601"]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Philippe Laborie","raw_affiliation_strings":["ILOG, Gentilly Cedex, France#TAB#"],"raw_orcid":"https://orcid.org/0000-0002-4045-8601","affiliations":[{"raw_affiliation_string":"ILOG, Gentilly Cedex, France#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5035849846"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.3097,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.78431373,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"948","last_page":"953"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9976000189781189,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9976000189781189,"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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.0010000000474974513,"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.0007999999797903001,"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/constraint-networks","display_name":"constraint networks","score":0.8989999890327454},{"id":"https://openalex.org/keywords/automated-planning","display_name":"automated planning","score":0.7919999957084656},{"id":"https://openalex.org/keywords/scheduling","display_name":"scheduling","score":0.8579999804496765},{"id":"https://openalex.org/keywords/expressiveness","display_name":"expressiveness","score":0.7400000095367432},{"id":"https://openalex.org/keywords/computational-complexity","display_name":"computational complexity","score":0.8690000176429749},{"id":"https://openalex.org/keywords/np-completeness","display_name":"NP-completeness","score":0.9869999885559082},{"id":"https://openalex.org/keywords/polynomial-time-computation","display_name":"polynomial-time computation","score":0.45899999141693115}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7017266750335693},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5643099546432495},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5545340776443481},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5501978993415833},{"id":"https://openalex.org/C195818886","wikidata":"https://www.wikidata.org/wiki/Q5421724","display_name":"Expressive power","level":2,"score":0.5150148868560791},{"id":"https://openalex.org/C3017813396","wikidata":"https://www.wikidata.org/wiki/Q17078173","display_name":"Resource constraints","level":2,"score":0.46476611495018005},{"id":"https://openalex.org/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","level":2,"score":0.4617680609226227},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4519871473312378},{"id":"https://openalex.org/C29202148","wikidata":"https://www.wikidata.org/wiki/Q287260","display_name":"Resource allocation","level":2,"score":0.44051486253738403},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4169454872608185},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.27827978134155273},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2685122489929199},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17155125737190247},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.09598609805107117},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:16892029","doi":null,"is_oa":false,"landing_page_url":"http://ijcai.org/Proceedings/03/Papers/137.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306419999","display_name":"International Joint Conference on Artificial Intelligence","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"International Joint Conference on Artificial Intelligence","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W91846431","https://openalex.org/W106643999","https://openalex.org/W1528419757","https://openalex.org/W1544457345","https://openalex.org/W1550357700","https://openalex.org/W1849320790","https://openalex.org/W1977545325","https://openalex.org/W2010882308","https://openalex.org/W2011039300","https://openalex.org/W2091442648","https://openalex.org/W2095760119","https://openalex.org/W2119709400","https://openalex.org/W2119710578","https://openalex.org/W2143474538","https://openalex.org/W2167925113","https://openalex.org/W2171798962"],"related_works":["https://openalex.org/W124310094","https://openalex.org/W1508879136","https://openalex.org/W73185600","https://openalex.org/W1534961286","https://openalex.org/W2050498298","https://openalex.org/W7099638747","https://openalex.org/W2396651584","https://openalex.org/W7097269798","https://openalex.org/W3205788553","https://openalex.org/W2935711680"],"abstract_inverted_index":{"This":[0,81],"paper":[1],"introduces":[2],"the":[3,48,67,70,85],"concept":[4],"of":[5,34,44,47,69],"Resource":[6],"Temporal":[7],"Network":[8],"(RTN),":[9],"a":[10,31,75],"constraint":[11],"network":[12],"that":[13,53],"subsumes":[14],"both":[15],"classical":[16],"attributes":[17],"used":[18],"in":[19,27,58],"A.I.":[20],"Planning":[21],"and":[22,41],"capacity":[23],"resources":[24],"traditionally":[25],"handled":[26],"Scheduling.":[28],"After":[29],"giving":[30],"formal":[32],"definition":[33],"RTNs,":[35],"we":[36],"analyze":[37],"their":[38],"expressive":[39],"power":[40],"study":[42],"complexities":[43],"several":[45],"fragments":[46],"RTN":[49,56],"framework.":[50],"We":[51],"show":[52],"solving":[54],"an":[55],"is":[57,63,79],"general":[59],"NP-Complete":[60],"-":[61,72],"which":[62],"not":[64],"surprising":[65],"given":[66],"expressivity":[68],"framework":[71],"whereas":[73],"computing":[74],"Necessary":[76],"Truth":[77],"Criterion":[78],"polynomial.":[80],"last":[82],"result":[83],"opens":[84],"door":[86],"for":[87],"promising":[88],"algorithms":[89],"to":[90],"solve":[91],"RTNs.":[92]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":2}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2016-06-24T00:00:00"}