{"type":"ScholarlyArticle","title":"Generalizing Problem Reduction: A Logical Analysis","authors":[{"name":"Drew V. McDermott","slug":"drew-v-mcdermott","given":"Drew V.","family":"McDermott","affiliation":""}],"abstract":"Problem reduction is the name given to the problemsolving paradigm in which the problem solver manages a network of \"tasks\" representing its intentions, repeatedly reducing tasks to subtasks and coordinating their execution. This idea needs a lot of generalization for it to be able to ha ndle a realistic range of problems. Even after the model of time is made more realistic (to handle continuity and bra nching), issues remain regarding what it means to have a ta sk or a subtask, how a task can succeed or fail, whether a t,ask is feasib le. A profitable way to study these issues is to attempt to add axioms about tasks to a first-order temporal logic . The result sheds light on what sorts of generalizations of task networks are needed.","doi":null,"url":"https://ijcai.org/proceedings/1983/71","pdf":"https://ijcai.org/proceedings/1983/0071.pdf","markdown":"https://ijcai.org/proceedings/1983/71.md","bibtex":"https://ijcai.org/proceedings/1983/bibtex/71","volume":{"slug":"1983","title":"Proceedings of the Eighth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1983","url":"https://ijcai.org/proceedings/1983/","year":1983,"location":"Karlsruhe, West Germany","dates":"","editors":"Alan Bundy","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Knowledge Representation","track":"Knowledge Representation","number":71,"pages":{"first":302,"last":307},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}