Abstract
We address the problem of computing and representing answers of constraint abduction problems over the Herbrand domain. This problem is of interest when performing type inference involving generalized algebraic data types. We show that simply recognizing a maximally general answer or fully maximal answer is co-NP complete. However we present an algorithm that computes the (finite) set of fully maximal answers of an abduction problem. The maximally general answers are generally infinite in number but we show how to generate a finite representation of them when only unary function symbols are present.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Diekert, V., Gutierrez, C., Hagenah, C.: The existential theory of equations with rational constraints in free groups is PSPACE-complete. Information and Computation 202(2), 105–140 (2005)
Lassez, J.-L., Maher, M.J., Marriott, K.G.: Unification Revisited. In: Minker, J. (ed.) Foundations of Deductive Databases and Logic Programming, pp. 587–625. Kauffman, San Francisco (1987)
Maher, M.J.: Herbrand Constraint Abduction. In: Proc. Symp. on Logic in Computer Science, pp. 397–406 (2005)
Maher, M.: Heyting Domains for Constraint Abduction. In: Sattar, A., Kang, B.-h. (eds.) AI 2006. LNCS (LNAI), vol. 4304, pp. 9–18. Springer, Heidelberg (2006)
Martelli, A., Montanari, U.: An Efficient Unification Algorithm. ACM Trans. Program. Lang. Syst. 4(2), 258–282 (1982)
Nelson, G., Oppen, D.C.: Fast Decision Procedures Based on Congruence Closure. JACM 27(2), 356–364 (1980)
Paterson, M., Wegman, M.N.: Linear Unification. J. Comput. Syst. Sci. 16(2), 158–167 (1978)
Peyton Jones, S., Vytiniotis, D., Weirich, S., Washburn, G.: Simple Unification-based Type Inference for GADTs. In: Proc. Int. Conf. Functional Programming, pp. 50–61. ACM Press, New York (2006)
Pottier, F., Régis-Gianas, Y.: Stratified type inference for generalized algebraic data types. In: Proc. POPL, pp. 232–244. ACM Press, New York (2006)
Robinson, J.A.: A Machine-Oriented Logic Based on the Resolution Principle. JACM 12(1), 23–41 (1965)
Simonet, V., Pottier, F.: Constraint-based type inference with guarded algebraic data types. ACM Transactions on Programming Languages and Systems 29(1) (2007)
Schrijvers, T.: Personal communication
Stuckey, P.J., Sulzmann, M., Wazny, J.: Type Processing by Constraint Reasoning. In: Kobayashi, N. (ed.) APLAS 2006. LNCS, vol. 4279, pp. 1–25. Springer, Heidelberg (2006)
Sulzmann, M., Schrijvers, T., Stuckey, P.J.: Type inference for GADTs via Herbrand constraint abduction, Report CW 507, K.U.Leuven, Dept. of Computer Science (2008)
Xi, H., Chen, C., Chen, G.: Guarded recursive datatype constructors. In: Proc. POPL, pp. 224–235 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Maher, M., Huang, G. (2008). On Computing Constraint Abduction Answers. In: Cervesato, I., Veith, H., Voronkov, A. (eds) Logic for Programming, Artificial Intelligence, and Reasoning. LPAR 2008. Lecture Notes in Computer Science(), vol 5330. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89439-1_30
Download citation
DOI: https://doi.org/10.1007/978-3-540-89439-1_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-89438-4
Online ISBN: 978-3-540-89439-1
eBook Packages: Computer ScienceComputer Science (R0)