{"type":"ScholarlyArticle","title":"Real-Time Problem-Solving with Contract Algorithms","authors":[{"name":"Shlomo Zilberstein","slug":"shlomo-zilberstein","given":"Shlomo","family":"Zilberstein","affiliation":""},{"name":"François Charpillet","slug":"francois-charpillet","given":"François","family":"Charpillet","affiliation":""},{"name":"Philippe Chassaing","slug":"philippe-chassaing","given":"Philippe","family":"Chassaing","affiliation":""}],"abstract":"This paper addresses the problem of building an interruptible real-time system using contract algorithms. Contract algorithms offer a tradeoff between computation time and quality of results, but their run-time must be determined when they are activated. Many AI techniques provide useful contract algorithms that are not interruptible. We show how to optimally sequence co ntract algorithms to create the best interruptible system with or without stochastic information about the deadline. These results extend the foundation of real-time problemsolving and provide useful guidance for embedding contract algorithms in applications.","doi":null,"url":"https://ijcai.org/proceedings/1999/144","pdf":"https://ijcai.org/proceedings/1999/0144.pdf","markdown":"https://ijcai.org/proceedings/1999/144.md","bibtex":"https://ijcai.org/proceedings/1999/bibtex/144","volume":{"slug":"1999","title":"Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1999","url":"https://ijcai.org/proceedings/1999/","year":1999,"location":"Stockholm, Sweden","dates":"","editors":"Thomas Dean","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Planning and Scheduling","track":"Planning and Scheduling","number":144,"pages":{"first":1008,"last":1014},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}