{"id":"https://openalex.org/W7098717161","doi":null,"title":"International Conference on Tools with Artificial Intelligence","display_name":"International Conference on Tools with Artificial Intelligence","alternate_titles":[],"publication_year":null,"publication_date":null,"ids":{"openalex":"https://openalex.org/W7098717161"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.76.6841","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.76.6841","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.uwm.edu/faculty/mali/conferences/temporal-ictai.pdf","raw_type":"text"},"parent_works":[],"lineage":["https://openalex.org/W7098717161"],"child_works_count":0,"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":[],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T10906","display_name":"AI-based Problem Solving and Planning","score":0.9365000128746033,"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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.9365000128746033,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.05959999933838844,"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.0017000000225380063,"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/temporal-planning","display_name":"temporal planning","score":0.9860000014305115},{"id":"https://openalex.org/keywords/sat-encoding","display_name":"SAT encoding","score":0.8880000114440918},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"constraint satisfaction","score":0.828000009059906},{"id":"https://openalex.org/keywords/metric-time","display_name":"metric time","score":0.7229999899864197},{"id":"https://openalex.org/keywords/resource-quantity","display_name":"resource quantity","score":0.6169999837875366},{"id":"https://openalex.org/keywords/quantifiers","display_name":"quantifiers","score":0.7450000047683716},{"id":"https://openalex.org/keywords/integer-linear-programming","display_name":"integer linear programming","score":0.6769999861717224}],"concepts":[{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.7095000147819519},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6448000073432922},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5224999785423279},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.5210000276565552},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5199000239372253},{"id":"https://openalex.org/C114073186","wikidata":"https://www.wikidata.org/wiki/Q2631895","display_name":"Automated planning and scheduling","level":2,"score":0.5123000144958496},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.4648999869823456},{"id":"https://openalex.org/C2776505523","wikidata":"https://www.wikidata.org/wiki/Q4785468","display_name":"Plan (archaeology)","level":2,"score":0.45089998841285706},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.4465999901294708},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4361000061035156},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.4260999858379364},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.41440001130104065},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3732999861240387},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.3693999946117401},{"id":"https://openalex.org/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","level":2,"score":0.3625999987125397},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.3531000018119812},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33640000224113464},{"id":"https://openalex.org/C29202148","wikidata":"https://www.wikidata.org/wiki/Q287260","display_name":"Resource allocation","level":2,"score":0.323199987411499},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.3050000071525574},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.2872999906539917},{"id":"https://openalex.org/C116834253","wikidata":"https://www.wikidata.org/wiki/Q2039217","display_name":"Identification (biology)","level":2,"score":0.2858999967575073},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.25369998812675476}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.76.6841","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.76.6841","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.uwm.edu/faculty/mali/conferences/temporal-ictai.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2142798783","https://openalex.org/W2151236065","https://openalex.org/W1530282628","https://openalex.org/W1007963672","https://openalex.org/W2295316582","https://openalex.org/W1494468936","https://openalex.org/W2407103960","https://openalex.org/W7095190031","https://openalex.org/W12713029","https://openalex.org/W7100876386"],"abstract_inverted_index":{"Recent":[0],"advances":[1,29],"in":[2,84,206,243],"constraint":[3,77,178],"satisfaction":[4,78,179],"and":[5,41,58,104,210,245],"heuristic":[6],"search":[7,57],"have":[8],"made":[9],"it":[10,168,238],"possible":[11],"to":[12,30,170,196,240,248],"solve":[13,249],"classical":[14,48],"planning":[15,34,73,90,175,202,251],"problems":[16,35],"significantly":[17],"faster.":[18],"There":[19],"is":[20,95,108,116],"an":[21,213],"increasing":[22],"amount":[23],"of":[24,65,87,98,111,151,163,200,212,231],"work":[25],"on":[26],"extending":[27],"these":[28],"solving":[31,247],"more":[32,118,197],"expressive":[33],"which":[36,100,207],"contain":[37],"metric":[38,123],"time,":[39],"quantifiers":[40],"resource":[42,126],"quantities.":[43],"One":[44,81],"can":[45,140,158,192],"broadly":[46],"classify":[47],"planners":[49,54,60,88,121,173],"into":[50],"two":[51,227],"categories:":[52],"(i)":[53],"doing":[55],"refinement":[56],"(ii)":[59],"iteratively":[61],"processing":[62],"a":[63,69,76,109,137,177],"representation":[64],"finite":[66],"size":[67],"like":[68,184,203],"SAT":[70,92,138,190,229,244],"encoding":[71,139,147,157,191,235],"or":[72,75,93],"graph":[74],"problem":[79,180],"(CSP).":[80],"key":[82],"challenge":[83],"the":[85,96,204],"development":[86],"casting":[89,174],"as":[91,176],"CSP":[94,246],"identification":[97],"constraints":[99,164],"are":[101],"satisfied":[102],"if":[103,106],"only":[105],"there":[107],"plan":[110],"\ufffd":[112],"steps.":[113],"This":[114,146],"task":[115],"even":[117],"complex":[119,198],"for":[120,143],"handling":[122],"time":[124],"and/or":[125,128],"quantities":[127],"quantifiers.":[129],"In":[130],"this":[131,156],"paper":[132],"we":[133,165],"show":[134,154],"how":[135,155],"such":[136],"be":[141,159,193,216],"synthesized":[142],"temporal":[144,172,201,232,250],"planning.":[145,233],"contains":[148],"twenty":[149],"kinds":[150],"constraints.":[152],"We":[153,224],"simplified.":[160],"The":[161,189,234],"set":[162],"identify":[166],"makes":[167],"easier":[169,239],"develop":[171],"other":[181],"than":[182],"SAT,":[183],"integer":[185],"linear":[186],"programming":[187],"(ILP).":[188],"easily":[194],"adapted":[195],"cases":[199],"one":[205],"different":[208,219],"preconditions":[209],"effects":[211],"action":[214],"may":[215],"true":[217],"at":[218],"times":[220],"during":[221],"its":[222],"execution.":[223],"also":[225],"discuss":[226],"additional":[228],"encodings":[230],"schemes":[236],"make":[237],"exploit":[241],"progress":[242],"problems.":[252]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W7098717161","counts_by_year":[],"updated_date":"2026-11-14T11:04:58.165337","created_date":"2025-10-27T00:00:00"}
