{"type":"ScholarlyArticle","title":"SEM: a System for Enumerating Models","authors":[{"name":"Jian Zhang","slug":"jian-zhang","given":"Jian","family":"Zhang","affiliation":""},{"name":"Hantao Zhang","slug":"hantao-zhang","given":"Hantao","family":"Zhang","affiliation":""}],"abstract":"Model generation can be regarded as a special case of the Constraint Satisfaction Problem (CSP). It has many app lications in AI, computer science and mathematics. In this paper, we describe SEM , a System for Enumerating finite Models of first-order many-sorted theories. To the best of our knowledge , SEM outperforms any other finite model generation system on many test problems. The high performance of SEM relies on the following two techniques: (a) an efficient implementation of constraint propagation which requires little dynamic allocation of storage; (b) a powerful heuristic which eliminates many isomorphic partial models during the search. We will present the basic algorithm of SEM along with these two techniques. Our experimental results show that general purpose finite model generators are indeed useful in many applications.","doi":null,"url":"https://ijcai.org/proceedings/1995/39","pdf":"https://ijcai.org/proceedings/1995/0039.pdf","markdown":"https://ijcai.org/proceedings/1995/39.md","bibtex":"https://ijcai.org/proceedings/1995/bibtex/39","volume":{"slug":"1995","title":"Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1995","url":"https://ijcai.org/proceedings/1995/","year":1995,"location":"Montréal, Québec, Canada","dates":"","editors":"Chris S. Mellish","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Automated Reasoning","track":"Automated Reasoning","number":39,"pages":{"first":298,"last":302},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}