{"type":"ScholarlyArticle","title":"A Problem Reduction Model for Non-Independent Subproblems","authors":[{"name":"Giorgio Levi","slug":"giorgio-levi","given":"Giorgio","family":"Levi","affiliation":""},{"name":"Franco Sirovich","slug":"franco-sirovich","given":"Franco","family":"Sirovich","affiliation":""}],"abstract":"A hypergraph model is introduced, which besides including the AND/OR graph and state space graph models as particulars, is adequate for problem solving tasks involving non independent subproblems. The hypergraph model is shown to be grounded on a nonstandard notion of conjunction such that the truth of a conjunction does not necessarily imply the truth of the conjuncts. A hypergraph search algorithm is given and shown to be equivalent to a resolution-based theorem prowr in a first order logic augmented with the special conjunction. A characterization is given of the class of problems requiring the full descriptive power of our model. The class includes problems involving resources, plan formation, simplification of predicate logic programs.","doi":null,"url":"https://ijcai.org/proceedings/1975/52","pdf":"https://ijcai.org/proceedings/1975/0052.pdf","markdown":"https://ijcai.org/proceedings/1975/52.md","bibtex":"https://ijcai.org/proceedings/1975/bibtex/52","volume":{"slug":"1975","title":"Proceedings of the Fourth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1975","url":"https://ijcai.org/proceedings/1975/","year":1975,"location":"Tbilisi, Georgia, USSR","dates":"","editors":"Patrick Winston and Carl Hewitt","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Search Techniques","track":"Search Techniques","number":52,"pages":{"first":340,"last":343},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}