Heyting Domains for Constraint Abduction

Abstract. We investigate constraint domains in which answers to constraint abduction problems can be represented compactly by a most general answer. We demonstrate several classes of domains which have this property, but show that the property is not compositional.

• Type: Conference
• Year: 2006
• Where: AUSAI
• Authors: Michael J. Maher
• Keywords: Abduction Problems, Artificial Intelligence, AUSAI 2006, Constraint Domains