article

Free access

Semiring-based constraint satisfaction and optimization

Authors:

Stefano Bistarelli,

Francesca RossiAuthors Info & Claims

Journal of the ACM (JACM), Volume 44, Issue 2

Pages 201 - 236

https://doi.org/10.1145/256303.256306

Published: 01 March 1997 Publication History

Abstract

We introduce a general framework for constraint satisfaction and optimization where classical CSPs, fuzzy CSPs, weighted CSPs, partial constraint satisfaction, and others can be easily cast. The framework is based on a semiring structure, where the set of the semiring specifies the values to be associated with each tuple of values of the variable domain, and the two semiring operations (+ and X) model constraint projection and combination respectively. Local consistency algorithms, as usually used for classical CSPs, can be exploited in this general framework as well, provided that certain conditions on the semiring operations are satisfied. We then show how this framework can be used to model both old and new constraint solving and optimization schemes, thus allowing one to both formally justify many informally taken choices in existing schemes, and to prove that local consistency techniques can be used also in newly defined schemes.

References

[1]

BELLMAN, R.E. 1957. Dynamic Programming. Princeton University Press, Princeton, N.J.

[2]

BELLMAN, R. E., AND DREYFUS, S.E. 1962. Applied Dynamic Programming. Princeton University Press, Princeton, N.J.

[3]

BEa#LE, U., AND BRIOSCHI, F. 1972. Nonserial Dynamic Programming. Academic Press, Orlando, Fla.

[4]

BISTARELLI, S. 1994. Programmazione con vincoli pesati e ottimizzazione (in Italian). Tech. Rep. ipartmento di Informatica, Universita di Pisa, Pisa, Italy.

[5]

BISTARELLI, S., FARGmR, H., MONTANARI, U., ROSSI, F., SCHmX, T., AND VERFAmLE, G. 1996. Semiring-based CSPs and valued CSPs: Basic properties and comparison. In Over-Constrained Systems, M. Jampel, ed. Lecture Notes in Computer Science, Vol. 1106. Springer-Verlag, New York.

[6]

BISTARELLI, S., MONTANARI, U., AND ROSSI, F. 1995. Constraint solving over semirings. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI95). Morgan- Kaufmann, San Mateo, Calif., pp. 624-630.

[7]

BORNING, A., MAHER, M., MARTINDALE, A., AND WILSON, M. 1989. Constraint hierarchies and logic programming. In Proceeding of the 6th International Conference on Logic Programming. MIT Press, Cambridge, Mass., pp. 149-164.

[8]

COUSOT, P. 1977. Asynchronous iterative methods for solving a fixed point system of monotone equations in a complete lattice. Tech. Rep. R.R.88. Institut National Polytechnique de Grenoble, Grenoble, Switzerland.

[9]

DAVEY, B. A., AND PRIESTLY, H. A. 1990. Introductions to Lattices and Order. Cambridge University Press, Cambridge, England. pp. 37-42.

[10]

DECHTER R., AND DECHTER, A. 1988. Brief maintenance in dynamic constraint networks. In Proceedings of the AA/tI88. Morgan-Kaufmann, San Mateo, Calif., pp. 37-42.

[11]

DECHTER, R., DECHTER, A., AND PEARL, J. 1990. Optimization in constraint networks. In Influence Diagrams, Belief Nets and Decision Analysis, R. M. Oliver and J. Q. Smith, eds. Wiley, New York, pp. 411-425.

[12]

DECHTER, R., AND PEARL, J. 1988a. Network-based heuristics for constraint-satisfaction problems. In Search in Artificial Intelligence, Kanal and Kumar, eds. Springer-Verlag, New York, pp. 370-425.

[13]

DECHTER, R., AND PEARL, J. 1988b. Tree-clustering schemes for constraint processing. In Proceedings of the AA/tI88. Morgan-Kaufmann, San Mateo, Calif., pp. 150-154.

[14]

DUBOIS, D., FARGIER, n., AND PRADE, n. 1993. The calculus of fuzzy restrictions as a basis for flexible constraint satisfaction. In Proceedings of the IEEE International Conference on Fuzzy Systems. IEEE, New York, pp. 1131-1136.

[15]

FARGIER, n., AND LANG, J. 1993. Uncertainty in constraint satisfaction problems: A probabilistic approach. In Proceedings of the European Conference on Symbolic and Qualitative Approaches to Reasoning and Uncertainty (ESQUARU). Lecture Notes in Computer Science, vol. 747. Springer- Verlag, New York, pp. 97-104.

[16]

FREUDER, E.C. 1978. Synthesizing constraint expressions. Commun. ACM21, 11 (Nov.), 958-965.

[17]

FREUDER, E. C. 1988. Backtrack-free and backtrack-bounded search. In Search in Artificial Intelligence, Kanal and Kumar, eds. Springer-Verlag, New York, pp. 343-369.

[18]

FREUDER, E. C., AND WALLACE, R.J. 1992. Partial constraint satisfaction. AI J. 58, 21-70.

[19]

GIACOBAZZI, R., DEBRAY, S. K., AND LEVI, G. 1992. A generalized semantics for constraint logic programs. In Proceedings of Fifth Generation Computer Systems (FGCS92). ICOT, Tokyo, Japan, pp. 581-591.

[20]

GNESI, S., MONTANARI, U., AND MARTELLI, A. 1981. Dynamic programming as graph searching: An algebraic approach. J. ACM 28, 4 (Oct.), 737-751.

[21]

GYSSENS, M., JEAVONS, P. G., AND COHEN, D. A. 1994. Decomposing constraint satisfaction problems using database techniques. Artif. Int. 66, 1, 57-89.

[22]

JAFFAR, J., AND LASSEZ, J.L. 1987. Constraint logic programming. In Proceedings of Principles of Programming Languages (Munich, West Germany, Jan. 21-23). ACM, New York, pp. 111-119.

[23]

KUMAR, V. 1992. Algorithms for constraint satisfaction problems: A survey. AI Mag. 13, 1, 32-44.

[24]

MACKWORTH, A.K. 1977. Consistency in networks of relations. Artif. Int. 8, 1, 99-118.

[25]

MACKWORTH, A. K. 1992. Constraint satisfaction. In Encyclopedia of AI, 2nd ed., vol. 1, S. C. Shapiro, ed. Wiley, New York, pp. 285-293.

[26]

MACKWORTH, A. K., AND FREUDER, E. C. 1984. The complexity of some polynomial network consistency algorithms for constraint satisfaction problems./trtif. Int. 25, 65-74.

[27]

MARTELLI, A., AND MONTANARI, U. 1972. Nonserial dynamic programming: On the optimal strategy of variable elimination for the rectangular lattice. J. Math. Anal./tppl. 40, 226-242.

[28]

MONTANARI, U. 1974. Networks of constraints: Fundamental properties and application to picture processing. Inf. Sci. 7, 95-132.

[29]

MONTANARI, U., AND ROSSI, F. 1986. An efficient algorithm for the solution of hierarchical networks of constraints. In Proceedings of the International Workshop on Graph Grammars and Their Application to Computer Science. Lecture Notes in Computer Science, vol. 291. Springer-Verlag, New York, pp. 440-457.

[30]

MONTANARI, U., AND ROSSI, F. 1991. Constraint relaxation may be perfect. AI J. 48, 143-170.

[31]

MOULIN, H. 1988. Axioms for Cooperative Decision Making. Cambridge University Press, Cambridge, Mass.

[32]

ROSENFELD, A., HUMMEL, R. A., AND ZUCKER, S.W. 1976. Scene labelling by relaxation operations. IEEE Trans. Syst., Man, Cyber 6, 6, 420-433.

[33]

RUTTKAY, ZS. 1994. Fuzzy constraint satisfaction. In Proceedings of the IEEE 3rd International Conference on Fuzzy Systems. IEEE, New York, pp. 1263-1268.

[34]

RossI, F., AND SPERDUTI, A. 1996. Learning solution preferences in constraint problems. In Proceedings of the International Workshop on Non-Standard Constraint Processing at EC/tI96. Taylor and Francis publishers. (A longer version will appear in J. Exp. Theor. Artif Int.)

[35]

SCHIEX, f. 1992. Possibilistic constraint satisfaction problems or "how to handle soft constraints?" In Proceedings of the 8th Conference of Uncertainty in Artificial Intelligence. pp. 269-275.

[36]

SCHIEX, T., FARGIER, H., AND VERFAILLE, G. 1995. Valued constraint satisfaction problems: Hard and easy problems. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI95). Morgan-Kaufmann, San Mateo, Calif., pp. 631-637.

[37]

SHENOY, P. 1991. Valuation-based systems for discrete optimization. In Uncertainty in Artificial Intelligence, L. N. Kanal, P. P. Bonissone, M. Henrion, and J. F. Lemayer, eds. Elsevier Science, Amsterdam, The Netherlands.

[38]

SHENOY, P. 1994. Valuation-based systems: A framework for managing uncertainty in expert systems. In Fuzzy Logic for the Management of Uncertainty, L. Zadeh and J. Kacprzyk, eds. Wiley, New York, pp. 83-104.

[39]

VAN HENTENRYCK, P. 1989. Constraint Satisfaction in Logic Programming. MIT Press, Cambridge, Mass.

[40]

ZADEH, L.A. 1965. Fuzzy sets. Inf. Control 8, 338-353.

Cited By

Colorni ATsoukiàs A(2024)What is a decision problem?European Journal of Operational Research10.1016/j.ejor.2023.10.025314:1(255-267)Online publication date: Apr-2024
https://doi.org/10.1016/j.ejor.2023.10.025
Bistarelli SSantini F(2024)Local Spaces in Soft Concurrent Constraint Programming Oriented to SecurityLeveraging Applications of Formal Methods, Verification and Validation. REoCAS Colloquium in Honor of Rocco De Nicola10.1007/978-3-031-73709-1_23(373-391)Online publication date: 27-Oct-2024
https://dl.acm.org/doi/10.1007/978-3-031-73709-1_23
Qayyum OYu W(2024)Coordination-Free Replicated Datalog Streams with Application-Specific AvailabilityAdvances in Databases and Information Systems10.1007/978-3-031-70626-4_11(155-169)Online publication date: 28-Aug-2024
https://dl.acm.org/doi/10.1007/978-3-031-70626-4_11
Show More Cited By

Index Terms

Semiring-based constraint satisfaction and optimization
1. Computing methodologies
  1. Artificial intelligence
    1. Knowledge representation and reasoning
      1. Probabilistic reasoning
      2. Vagueness and fuzzy logic
  2. Symbolic and algebraic manipulation
    1. Symbolic and algebraic algorithms
2. Theory of computation
  1. Design and analysis of algorithms
  2. Logic

Recommendations

Relaxations of semiring constraint satisfaction problems

The Semiring Constraint Satisfaction Problem (SCSP) framework is a popular approach for the representation of partial constraint satisfaction problems. In this framework preferences can be associated with tuples of values of the variable domains. ...
Soft constraint abstraction based on semiring homomorphism

The semiring-based constraint satisfaction problems (semiring CSPs), proposed by Bistarelli, Montanari and Rossi [S. Bistarelli, U. Montanari, F. Rossi, Semiring-based constraints solving and optimization, Journal of the ACM 44 (2) (1997) 201-236], is a ...
Constraint Hierarchies as Semiring-Based CSPs
ICTAI '09: Proceedings of the 2009 21st IEEE International Conference on Tools with Artificial Intelligence

Constraints provide an effective means for the high-level modeling and reasoning of various problems. In particular, soft constraints are useful since they treat over-constrained problems that naturally arise in real-life applications. Therefore, ...

Comments

Information & Contributors

Information

Published In

cover image Journal of the ACM

Journal of the ACM Volume 44, Issue 2

March 1997

161 pages

ISSN:0004-5411

EISSN:1557-735X

DOI:10.1145/256303

Issue’s Table of Contents

Copyright © 1997 ACM.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 March 1997

Published in JACM Volume 44, Issue 2

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

529
Total Citations
View Citations
1,995
Total Downloads

Downloads (Last 12 months)187
Downloads (Last 6 weeks)25

Reflects downloads up to 30 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Colorni ATsoukiàs A(2024)What is a decision problem?European Journal of Operational Research10.1016/j.ejor.2023.10.025314:1(255-267)Online publication date: Apr-2024
https://doi.org/10.1016/j.ejor.2023.10.025
Bistarelli SSantini F(2024)Local Spaces in Soft Concurrent Constraint Programming Oriented to SecurityLeveraging Applications of Formal Methods, Verification and Validation. REoCAS Colloquium in Honor of Rocco De Nicola10.1007/978-3-031-73709-1_23(373-391)Online publication date: 27-Oct-2024
https://dl.acm.org/doi/10.1007/978-3-031-73709-1_23
Qayyum OYu W(2024)Coordination-Free Replicated Datalog Streams with Application-Specific AvailabilityAdvances in Databases and Information Systems10.1007/978-3-031-70626-4_11(155-169)Online publication date: 28-Aug-2024
https://dl.acm.org/doi/10.1007/978-3-031-70626-4_11
Pavan AMeel KVinodchandran NBhattacharyya AWilliams BChen YNeville J(2023)Constraint optimization over semiringsProceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence and Thirty-Fifth Conference on Innovative Applications of Artificial Intelligence and Thirteenth Symposium on Educational Advances in Artificial Intelligence10.1609/aaai.v37i4.25522(4070-4077)Online publication date: 7-Feb-2023
https://dl.acm.org/doi/10.1609/aaai.v37i4.25522
Bistarelli STaticchi C(2023)On the study of acceptability in weighted argumentation frameworks through four-state labelling semanticsJournal of Logic and Computation10.1093/logcom/exad03933:8(1872-1897)Online publication date: 8-Jun-2023
https://doi.org/10.1093/logcom/exad039
Fujii SIwamasa YKimura K(2022)Quantaloidal Approach to Constraint SatisfactionElectronic Proceedings in Theoretical Computer Science10.4204/EPTCS.372.21372(289-305)Online publication date: 3-Nov-2022
https://doi.org/10.4204/EPTCS.372.21
Cornelio CGoldsmith JGrandi UMattei NRossi FVenable K(2022)Reasoning with PCP-NetsJournal of Artificial Intelligence Research10.1613/jair.1.1300972(1103-1161)Online publication date: 4-Jan-2022
https://dl.acm.org/doi/10.1613/jair.1.13009
Qayyum OYu WHong JBures MPark JCerny T(2022)Toward replicated and asynchronous data streams for edge-cloud applicationsProceedings of the 37th ACM/SIGAPP Symposium on Applied Computing10.1145/3477314.3507687(339-346)Online publication date: 25-Apr-2022
https://dl.acm.org/doi/10.1145/3477314.3507687
Gottardi ATortora STosello EMenegatti E(2022)Shared Control in Robot Teleoperation With Improved Potential FieldsIEEE Transactions on Human-Machine Systems10.1109/THMS.2022.315571652:3(410-422)Online publication date: Jun-2022
https://doi.org/10.1109/THMS.2022.3155716
Tziavelis NGatterbauer WRiedewald M(2022)Toward Responsive DBMS: Optimal Join Algorithms, Enumeration, Factorization, Ranking, and Dynamic Programming2022 IEEE 38th International Conference on Data Engineering (ICDE)10.1109/ICDE53745.2022.00299(3205-3208)Online publication date: May-2022
https://doi.org/10.1109/ICDE53745.2022.00299
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

Figures

Tables

Media

View Issue’s Table of Contents