Abstract
Given a finite set of vectors over a finite totally ordered domain, we study the problem of computing a constraint in conjunctive normal form such that the set of solutions for the produced constraint is identical to the original set. We develop an efficient polynomial-time algorithm for the general case, followed by specific polynomial-time algorithms producing Horn, dual Horn, and bijunctive constraints for sets of vectors closed under the operations of conjunction, disjunction, and median, respectively. We also consider the affine constraints, analyzing them by means of computer algebra. Our results generalize the work of Dechter and Pearl on relational data, as well as the papers by Hébrard and Zanuttini. They also complete the results of Hähnle et al. on multi-valued logics and Jeavons et al. on the algebraic approach to constraints. We view our work as a step toward a complete complexity classification of constraint satisfaction problems over finite domains.
Dedicated to the memory of Peter Ružička (1947 – 2003).
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Ansótegui, C., Manyà, F.: New logical and complexity results for signed-SAT. In: Proc. 33rd ISMVL 2003, Tokyo, Japan, pp. 181–187 (2003)
Beckert, B., Hähnle, R., Manyà, F.: The 2-SAT problem of regular signed CNF formulas. In: Proc. 30th ISMVL, Portland, OR, USA, pp. 331–336 (2000)
Béjar, R., Hähnle, R., Manyà, F.: A modular reduction of regular logic to classical logic. In: Proc. 31st ISMVL, Warsaw, Poland, pp. 221–226 (2001)
Bulatov, A.A.: A dichotomy theorem for constraints on a three-element set. In: Proc. 43rd FOCS, Vancouver, BC, Canada, pp. 649–658 (2002)
Cooper, M.C., Cohen, D.A., Jeavons, P.: Characterising tractable constraints. Artificial Intelligence 65(2), 347–361 (1994)
Creignou, N., Khanna, S., Sudan, M.: Complexity Classifications of Boolean Constraint Satisfaction Problems. SIAM Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia (2001)
Dechter, R., Pearl, J.: Structure identification in relational data. Artificial Intelligence 58(1-3), 237–270 (1992)
Feder, T., Vardi, M.Y.: The computational structure of monotone monadic SNP and constraint satisfaction: a study through Datalog and group theory. SIAM Journal on Computing 28(1), 57–104 (1998)
Hähnle, R.: Exploiting data dependencies in many-valued logics. Journal of Applied Non-Classical Logics 6(1) (1996)
Hähnle, R.: Complexity of many-valued logics. In: Proc. 31st ISMVL, Warsaw, Poland, pp. 137–148 (2001)
Hébrard, J.-J., Zanuttini, B.: An efficient algorithm for Horn description. Information Processing Letters 88(4), 177–182 (2003)
Hell, P., Nešetřil, J.: On the complexity of H-coloring. Journal of Combinatorial Theory, Series B 48, 92–110 (1990)
Jeavons, P.: On the algebraic structure of combinatorial problems. Theoretical Computer Science 200(1-2), 185–204 (1998)
Jeavons, P., Cohen, D., Gyssens, M.: Closure properties of constraints. Journal of the Association for Computing Machinery 44(4), 527–548 (1997)
Jeavons, P., Cooper, M.C.: Tractable constraints on ordered domains. Artificial Intelligence 79(2), 327–339 (1995)
Kolaitis, P.G., Vardi, M.Y.: Conjunctive-query containment and constraint satisfaction. Journal of Computer and System Science 61(2), 302–332 (2000)
Schaefer, T.J.: The complexity of satisfiability problems. In: Proc. 10th STOC, San Diego CA, USA, pp. 216–226 (1978)
von zur Gathen, J., Gerhard, J.: Modern Computer Algebra. Cambridge University Press, Cambridge (1999)
Zanuttini, B., Hébrard, J.-J.: A unified framework for structure identification. Information Processing Letters 81(6), 335–339 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gil, Á.J., Hermann, M., Salzer, G., Zanuttini, B. (2004). Efficient Algorithms for Constraint Description Problems over Finite Totally Ordered Domains. In: Basin, D., Rusinowitch, M. (eds) Automated Reasoning. IJCAR 2004. Lecture Notes in Computer Science(), vol 3097. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25984-8_17
Download citation
DOI: https://doi.org/10.1007/978-3-540-25984-8_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22345-0
Online ISBN: 978-3-540-25984-8
eBook Packages: Springer Book Archive