An ASP based method for subassembly identification

Subassembly identification is a key technique in mechanical assembly sequence planning (MASP). Declarative methods for MASP admit highly efficient and understandable problem description. This paper proposes an answer set programming (ASP) based subassembly identification technique, which can be viewed as a part of the declarative solution to MASP. Given the liaison and interference relation of an assembly, all assembly knowledge and necessary constraints are produced automatically. It is shown that the space complexity of our representation method is polynomial. With the answer set solver DLV, feasible subassemblies could be generated. And thanks to the declarativeness of our approach, its representation efficiency and time efficiency can be improved separately.