{"id":"https://openalex.org/W2029227958","doi":"https://doi.org/10.1080/713827103","title":"Temporal constraint satisfaction in matrix method","display_name":"Temporal constraint satisfaction in matrix method","publication_year":2003,"publication_date":"2003-02-01","ids":{"openalex":"https://openalex.org/W2029227958","doi":"https://doi.org/10.1080/713827103","mag":"2029227958"},"language":"en","primary_location":{"id":"doi:10.1080/713827103","is_oa":true,"landing_page_url":"https://doi.org/10.1080/713827103","pdf_url":"https://www.tandfonline.com/doi/pdf/10.1080/713827103?download=true","source":{"id":"https://openalex.org/S125501549","display_name":"Applied Artificial Intelligence","issn_l":"0883-9514","issn":["0883-9514","1087-6545"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Applied Artificial Intelligence","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://www.tandfonline.com/doi/pdf/10.1080/713827103?download=true","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5100438525","display_name":"Chengqi Zhang","orcid":"https://orcid.org/0000-0001-5715-7154"},"institutions":[{"id":"https://openalex.org/I114017466","display_name":"University of Technology Sydney","ror":"https://ror.org/03f0f6041","country_code":"AU","type":"education","lineage":["https://openalex.org/I114017466"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"Chengqi Zhang","raw_affiliation_strings":["\n Faculty of Information Technology, University of Technology, Sydney, Australia","Faculty of Information Technology, University of Technology, Sydney, Australia"],"affiliations":[{"raw_affiliation_string":"\n Faculty of Information Technology, University of Technology, Sydney, Australia","institution_ids":["https://openalex.org/I114017466"]},{"raw_affiliation_string":"Faculty of Information Technology, University of Technology, Sydney, Australia","institution_ids":["https://openalex.org/I114017466"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100764178","display_name":"Shichao Zhang","orcid":"https://orcid.org/0000-0001-9981-2970"},"institutions":[{"id":"https://openalex.org/I114017466","display_name":"University of Technology Sydney","ror":"https://ror.org/03f0f6041","country_code":"AU","type":"education","lineage":["https://openalex.org/I114017466"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Shichao Zhang","raw_affiliation_strings":["\n Faculty of Information Technology, University of Technology, Sydney, Australia","Faculty of Information Technology, University of Technology, Sydney, Australia"],"affiliations":[{"raw_affiliation_string":"\n Faculty of Information Technology, University of Technology, Sydney, Australia","institution_ids":["https://openalex.org/I114017466"]},{"raw_affiliation_string":"Faculty of Information Technology, University of Technology, Sydney, Australia","institution_ids":["https://openalex.org/I114017466"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100603108","display_name":"Zili Zhang","orcid":"https://orcid.org/0000-0003-4209-9451"},"institutions":[{"id":"https://openalex.org/I149704539","display_name":"Deakin University","ror":"https://ror.org/02czsnj07","country_code":"AU","type":"education","lineage":["https://openalex.org/I149704539"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Zili Zhang","raw_affiliation_strings":["\n School of Computing and Mathematics, Deakin University, Geelong, Australia","School of Computing and Mathematics, Deakin University, Geelong, Australia"],"affiliations":[{"raw_affiliation_string":"\n School of Computing and Mathematics, Deakin University, Geelong, Australia","institution_ids":["https://openalex.org/I149704539"]},{"raw_affiliation_string":"School of Computing and Mathematics, Deakin University, Geelong, Australia","institution_ids":["https://openalex.org/I149704539"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5100438525"],"corresponding_institution_ids":["https://openalex.org/I114017466"],"apc_list":{"value":2195,"currency":"USD","value_usd":2195},"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.16049059,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"17","issue":"2","first_page":"135","last_page":"154"},"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/T11063","display_name":"Rough Sets and Fuzzy Logic","score":0.9950000047683716,"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/T11106","display_name":"Data Management and Algorithms","score":0.9916999936103821,"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/local-consistency","display_name":"Local consistency","score":0.8965176343917847},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.8260680437088013},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.790925920009613},{"id":"https://openalex.org/keywords/constraint-satisfaction-dual-problem","display_name":"Constraint satisfaction dual problem","score":0.768155574798584},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7163587212562561},{"id":"https://openalex.org/keywords/constraint-logic-programming","display_name":"Constraint logic programming","score":0.6266205310821533},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.619645893573761},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.5885122418403625},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5750229358673096},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5602411031723022},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.4978756904602051},{"id":"https://openalex.org/keywords/backtracking","display_name":"Backtracking","score":0.47700050473213196},{"id":"https://openalex.org/keywords/consistency","display_name":"Consistency (knowledge bases)","score":0.45891818404197693},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4218769669532776},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3907257914543152},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.23265117406845093},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19435182213783264},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.08084788918495178}],"concepts":[{"id":"https://openalex.org/C137105694","wikidata":"https://www.wikidata.org/wiki/Q3407510","display_name":"Local consistency","level":4,"score":0.8965176343917847},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.8260680437088013},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.790925920009613},{"id":"https://openalex.org/C183046576","wikidata":"https://www.wikidata.org/wiki/Q5164380","display_name":"Constraint satisfaction dual problem","level":5,"score":0.768155574798584},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7163587212562561},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.6266205310821533},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.619645893573761},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.5885122418403625},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5750229358673096},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5602411031723022},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.4978756904602051},{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.47700050473213196},{"id":"https://openalex.org/C2776436953","wikidata":"https://www.wikidata.org/wiki/Q5163215","display_name":"Consistency (knowledge bases)","level":2,"score":0.45891818404197693},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4218769669532776},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3907257914543152},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.23265117406845093},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19435182213783264},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.08084788918495178},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1080/713827103","is_oa":true,"landing_page_url":"https://doi.org/10.1080/713827103","pdf_url":"https://www.tandfonline.com/doi/pdf/10.1080/713827103?download=true","source":{"id":"https://openalex.org/S125501549","display_name":"Applied Artificial Intelligence","issn_l":"0883-9514","issn":["0883-9514","1087-6545"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Applied Artificial Intelligence","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.92.1756","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.92.1756","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www-staff.it.uts.edu.au/~zhangsc/scpaper/AAIzzz03t.pdf","raw_type":"text"},{"id":"pmh:oai:dro.deakin.edu.au:DU:30008572","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306402457","display_name":"Deakin Research Online (Deakin University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I149704539","host_organization_name":"Deakin University","host_organization_lineage":["https://openalex.org/I149704539"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Journal Article"},{"id":"pmh:oai:opus.lib.uts.edu.au:10453/4059","is_oa":false,"landing_page_url":"http://hdl.handle.net/10453/4059","pdf_url":null,"source":{"id":"https://openalex.org/S4306401357","display_name":"UTS ePRESS (University of Technology Sydney)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I114017466","host_organization_name":"University of Technology Sydney","host_organization_lineage":["https://openalex.org/I114017466"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Journal Article"}],"best_oa_location":{"id":"doi:10.1080/713827103","is_oa":true,"landing_page_url":"https://doi.org/10.1080/713827103","pdf_url":"https://www.tandfonline.com/doi/pdf/10.1080/713827103?download=true","source":{"id":"https://openalex.org/S125501549","display_name":"Applied Artificial Intelligence","issn_l":"0883-9514","issn":["0883-9514","1087-6545"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Applied Artificial Intelligence","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2029227958.pdf","grobid_xml":"https://content.openalex.org/works/W2029227958.grobid-xml"},"referenced_works_count":39,"referenced_works":["https://openalex.org/W48297022","https://openalex.org/W160902222","https://openalex.org/W166266902","https://openalex.org/W182649387","https://openalex.org/W206405905","https://openalex.org/W1480862739","https://openalex.org/W1528419757","https://openalex.org/W1576560203","https://openalex.org/W1589552839","https://openalex.org/W1607354042","https://openalex.org/W1832952332","https://openalex.org/W1968449321","https://openalex.org/W1978654873","https://openalex.org/W1996011776","https://openalex.org/W2004246448","https://openalex.org/W2008276941","https://openalex.org/W2009092207","https://openalex.org/W2015892285","https://openalex.org/W2022716165","https://openalex.org/W2025456831","https://openalex.org/W2029381856","https://openalex.org/W2034377322","https://openalex.org/W2068379155","https://openalex.org/W2078733202","https://openalex.org/W2085882354","https://openalex.org/W2086619822","https://openalex.org/W2090310951","https://openalex.org/W2091148241","https://openalex.org/W2098260426","https://openalex.org/W2115007598","https://openalex.org/W2115540797","https://openalex.org/W2120701054","https://openalex.org/W2143649141","https://openalex.org/W2161484642","https://openalex.org/W6631451553","https://openalex.org/W6642095256","https://openalex.org/W6667431150","https://openalex.org/W6674769474","https://openalex.org/W6677645574"],"related_works":["https://openalex.org/W2569549435","https://openalex.org/W2091348864","https://openalex.org/W2784687883","https://openalex.org/W2141935412","https://openalex.org/W1486916474","https://openalex.org/W2495408185","https://openalex.org/W2096689540","https://openalex.org/W6366331","https://openalex.org/W1519282274","https://openalex.org/W2017710358"],"abstract_inverted_index":{"Constraint":[0],"satisfaction":[1,39,63],"is":[2,57],"a":[3,19,69,81],"challenging":[4],"problem":[5,64,70],"in":[6,40],"Interval":[7],"Algebra":[8],"(IA).So":[9],"there":[10,79],"are":[11,52,96],"many":[12],"efforts":[13],"to":[14,22,37],"attack":[15],"this":[16,41],"problem.After":[17],"building":[18],"matrix":[20,35,55],"method":[21,36,56],"deal":[23],"with":[24],"temporal":[25,61],"reasoning":[26],"problems,":[27],"we":[28],"develop":[29],"basic":[30],"techniques":[31],"for":[32],"applying":[33],"the":[34,43,47,60,85,89,94],"constraint":[38,62],"paper.Thus,":[42],"propagating":[44],"rules":[45],"and":[46],"algorithms":[48],"of":[49],"3-and":[50],"path-consistency":[51],"studied.If":[53],"our":[54],"used,":[58],"then":[59],"can":[65,72],"be":[66,73],"transformed":[67],"into":[68],"that":[71,83],"effectively":[74],"solved.1.":[75],"To":[76,87],"decide":[77],"whether":[78],"exists":[80],"solution":[82],"satisfies":[84],"constraints.2.":[86],"find":[88],"corresponding":[90],"minimal":[91],"network":[92],"where":[93],"constraints":[95],"as":[97,99],"explicit":[98],"possible.":[100]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}