{"id":"https://openalex.org/W2049435809","doi":"https://doi.org/10.1017/s0269888910000184","title":"Efficient variable elimination for semi-structured simple temporal networks with continuous domains","display_name":"Efficient variable elimination for semi-structured simple temporal networks with continuous domains","publication_year":2010,"publication_date":"2010-08-23","ids":{"openalex":"https://openalex.org/W2049435809","doi":"https://doi.org/10.1017/s0269888910000184","mag":"2049435809"},"language":"en","primary_location":{"id":"doi:10.1017/s0269888910000184","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0269888910000184","pdf_url":null,"source":{"id":"https://openalex.org/S137506714","display_name":"The Knowledge Engineering Review","issn_l":"0269-8889","issn":["0269-8889","1469-8005"],"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":"The Knowledge Engineering Review","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/A5006046553","display_name":"Neil Yorke\u2010Smith","orcid":"https://orcid.org/0000-0002-1814-3515"},"institutions":[{"id":"https://openalex.org/I1298353152","display_name":"SRI International","ror":"https://ror.org/05s570m15","country_code":"US","type":"nonprofit","lineage":["https://openalex.org/I1298353152"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Neil Yorke-Smith","raw_affiliation_strings":["SRI International, 333 Ravenswood Ave., Menlo Park, CA 94025, USA; e-mail:","SRI, International;"],"affiliations":[{"raw_affiliation_string":"SRI International, 333 Ravenswood Ave., Menlo Park, CA 94025, USA; e-mail:","institution_ids":["https://openalex.org/I1298353152"]},{"raw_affiliation_string":"SRI, International;","institution_ids":["https://openalex.org/I1298353152"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101391750","display_name":"Hung Bui","orcid":"https://orcid.org/0009-0003-1886-8457"},"institutions":[{"id":"https://openalex.org/I1298353152","display_name":"SRI International","ror":"https://ror.org/05s570m15","country_code":"US","type":"nonprofit","lineage":["https://openalex.org/I1298353152"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Hung H. Bui","raw_affiliation_strings":["SRI International, 333 Ravenswood Ave., Menlo Park, CA 94025, USA; e-mail:","SRI, International;"],"affiliations":[{"raw_affiliation_string":"SRI International, 333 Ravenswood Ave., Menlo Park, CA 94025, USA; e-mail:","institution_ids":["https://openalex.org/I1298353152"]},{"raw_affiliation_string":"SRI, International;","institution_ids":["https://openalex.org/I1298353152"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5006046553","https://openalex.org/A5101391750"],"corresponding_institution_ids":["https://openalex.org/I1298353152"],"apc_list":null,"apc_paid":null,"fwci":0.7122,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.72392968,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"25","issue":"3","first_page":"337","last_page":"351"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9995999932289124,"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.9995999932289124,"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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.9785000085830688,"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/T11106","display_name":"Data Management and Algorithms","score":0.9703999757766724,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.7350506782531738},{"id":"https://openalex.org/keywords/variable-elimination","display_name":"Variable elimination","score":0.6773892045021057},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.627662181854248},{"id":"https://openalex.org/keywords/inference","display_name":"Inference","score":0.5695003271102905},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5662152767181396},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5197229385375977},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.514798104763031},{"id":"https://openalex.org/keywords/consistency","display_name":"Consistency (knowledge bases)","score":0.48470425605773926},{"id":"https://openalex.org/keywords/local-consistency","display_name":"Local consistency","score":0.48155882954597473},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.48146477341651917},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.4805903434753418},{"id":"https://openalex.org/keywords/constraint-graph","display_name":"Constraint graph","score":0.47914499044418335},{"id":"https://openalex.org/keywords/variable","display_name":"Variable (mathematics)","score":0.4737587571144104},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4534800052642822},{"id":"https://openalex.org/keywords/decomposition-method","display_name":"Decomposition method (queueing theory)","score":0.43245425820350647},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32513728737831116},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21612560749053955},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.20841029286384583},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.15640661120414734},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.11169925332069397}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7350506782531738},{"id":"https://openalex.org/C169272836","wikidata":"https://www.wikidata.org/wiki/Q5668307","display_name":"Variable elimination","level":3,"score":0.6773892045021057},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.627662181854248},{"id":"https://openalex.org/C2776214188","wikidata":"https://www.wikidata.org/wiki/Q408386","display_name":"Inference","level":2,"score":0.5695003271102905},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5662152767181396},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5197229385375977},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.514798104763031},{"id":"https://openalex.org/C2776436953","wikidata":"https://www.wikidata.org/wiki/Q5163215","display_name":"Consistency (knowledge bases)","level":2,"score":0.48470425605773926},{"id":"https://openalex.org/C137105694","wikidata":"https://www.wikidata.org/wiki/Q3407510","display_name":"Local consistency","level":4,"score":0.48155882954597473},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.48146477341651917},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.4805903434753418},{"id":"https://openalex.org/C178481205","wikidata":"https://www.wikidata.org/wiki/Q5164372","display_name":"Constraint graph","level":5,"score":0.47914499044418335},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.4737587571144104},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4534800052642822},{"id":"https://openalex.org/C2778258933","wikidata":"https://www.wikidata.org/wiki/Q16918986","display_name":"Decomposition method (queueing theory)","level":2,"score":0.43245425820350647},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32513728737831116},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21612560749053955},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.20841029286384583},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.15640661120414734},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.11169925332069397},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"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/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1017/s0269888910000184","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0269888910000184","pdf_url":null,"source":{"id":"https://openalex.org/S137506714","display_name":"The Knowledge Engineering Review","issn_l":"0269-8889","issn":["0269-8889","1469-8005"],"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":"The Knowledge Engineering Review","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":28,"referenced_works":["https://openalex.org/W65909600","https://openalex.org/W108408365","https://openalex.org/W1512327467","https://openalex.org/W1513065906","https://openalex.org/W1573304844","https://openalex.org/W1582866771","https://openalex.org/W1587479942","https://openalex.org/W1608327189","https://openalex.org/W1883479550","https://openalex.org/W1999038767","https://openalex.org/W2106975367","https://openalex.org/W2113678384","https://openalex.org/W2113918283","https://openalex.org/W2130182605","https://openalex.org/W2130660558","https://openalex.org/W2132753073","https://openalex.org/W2138319640","https://openalex.org/W2187194074","https://openalex.org/W2255409074","https://openalex.org/W2337098149","https://openalex.org/W2396595190","https://openalex.org/W2426452510","https://openalex.org/W2752885492","https://openalex.org/W6608028435","https://openalex.org/W6630798032","https://openalex.org/W6635036405","https://openalex.org/W6687005797","https://openalex.org/W7002538706"],"related_works":["https://openalex.org/W3035232911","https://openalex.org/W2032348095","https://openalex.org/W115413730","https://openalex.org/W2175175400","https://openalex.org/W2952340783","https://openalex.org/W4298270231","https://openalex.org/W1490262345","https://openalex.org/W1598652458","https://openalex.org/W2610525591","https://openalex.org/W1504425306"],"abstract_inverted_index":{"Abstract":[0],"The":[1,24],"Simple":[2],"Temporal":[3],"Network":[4,189],"(STN)":[5],"is":[6,96,174],"a":[7],"widely":[8],"used":[9],"framework":[10],"for":[11,110,128],"reasoning":[12],"about":[13],"quantitative":[14],"temporal":[15],"constraints":[16,132],"over":[17,104],"variables":[18],"with":[19],"continuous":[20,105],"or":[21,44],"discrete":[22],"domains.":[23,106],"inference":[25],"tasks":[26],"of":[27,47,53,61,65,133,137,145,148,161],"determining":[28],"consistency":[29],"and":[30,154],"deriving":[31],"the":[32,58,62,102,130,146,149,159,171],"minimal":[33,131],"network":[34],"are":[35],"traditionally":[36],"achieved":[37],"by":[38,45],"graph":[39,64,173],"algorithms":[40],"(e.g.":[41,50,73],"Floyd-Warshall,":[42],"Johnson)":[43],"iteration":[46],"narrowing":[48],"operators":[49],"\u0394STP).":[51],"None":[52],"these":[54,113],"methods":[55],"exploits":[56],"effectively":[57],"tree-decomposition":[59],"structure":[60],"constraint":[63,172],"an":[66,111,124,134],"STN.":[67,135],"Methods":[68],"based":[69],"on":[70],"variable":[71],"elimination":[72],"adaptive":[74],"consistency)":[75],"can":[76,115],"exploit":[77],"this":[78,138],"structure,":[79],"but":[80],"have":[81,177],"not":[82],"been":[83],"applied":[84],"to":[85,99,166,176],"STNs":[86],"as":[87,89,119,182],"far":[88],"they":[90],"could,":[91],"in":[92,168],"part":[93],"because":[94],"it":[95],"unclear":[97],"how":[98],"efficiently":[100],"pass":[101],"\u2018messages\u2019":[103],"We":[107,121],"show":[108],"that":[109,184],"STN,":[112],"messages":[114],"be":[116],"represented":[117],"compactly":[118],"sub-STNs.":[120],"then":[122],"present":[123],"efficient":[125],"message-passing":[126],"scheme":[127],"computing":[129],"Analysis":[136],"algorithm,":[139],"Prop-STP":[140],",":[141],"brings":[142],"formal":[143],"explanation":[144],"performance":[147,164],"existing":[150],"STN":[151],"solvers":[152],"\u0394STP":[153],"SR-PC.":[155],"Empirical":[156],"results":[157],"validate":[158],"efficiency":[160],"Prop-STP,":[162],"demonstrating":[163],"comparable":[165],"\u0394STP,":[167],"cases":[169],"where":[170],"known":[175],"small":[178],"tree":[179],"width,":[180],"such":[181],"those":[183],"arise":[185],"during":[186],"Hierarchical":[187],"Task":[188],"planning.":[190]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-01-08T20:05:33.558190","created_date":"2025-10-10T00:00:00"}