References

  1. Farhad Arbab & Francesco Santini (2012): Preference and Similarity-Based Behavioral Discovery of Services. In: Proc. Web Services and Formal Methods (WS-FM), pp. 118–133. Available at http://dx.doi.org/10.1007/978-3-642-38230-7_8.
  2. Christel Baier, Tobias Blechmann, Joachim Klein, Sascha Klüppelholz & Wolfgang Leister (2010): Design and Verification of Systems with Exogenous Coordination Using Vereofy. In: Proc. International Symposium on Leveraging Applications, ISoLA 2010, pp. 97–111. Available at http://dx.doi.org/10.1007/978-3-642-16561-0_15.
  3. Christel Baier, Marjan Sirjani, Farhad Arbab & Jan Rutten (2006): Modeling component connectors in Reo by constraint automata. Science of Computer Programming 61, pp. 75–113. Available at http://dx.doi.org/10.1016/j.scico.2005.10.008.
  4. Lenz Belzner, Rolf Hennicker & Martin Wirsing (2015): OnPlan: A Framework for Simulation-Based Online Planning. In: Proc. Formal Aspects of Component Software, pp. 1–30. Available at http://dx.doi.org/10.1007/978-3-319-28934-2_1.
  5. Stefano Bistarelli (2004): Semirings for Soft Constraint Solving and Programming. Lecture Notes in Computer Science 2962. Springer. Available at http://dx.doi.org/10.1007/b95712.
  6. Stefano Bistarelli, Ugo Montanari & Francesca Rossi (1995): Constraint Solving over Semirings. In: Proc. International Joint Conference on Artificial Intelligence, IJCAI 95, pp. 624–630. Available at http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.212.6733&rep=rep1&type=pdf.
  7. Stefano Bistarelli, Ugo Montanari & Francesca Rossi (1997): Semiring-based constraint satisfaction and optimization. J. ACM 44(2), pp. 201–236. Available at http://dx.doi.org/10.1145/256303.256306.
  8. Rance Cleaveland & Matthew Hennessy (1990): Priorities in Process Algebras. Inf. Comput. 87(1/2), pp. 58–77. Available at http://dx.doi.org/10.1016/0890-5401(90)90059-Q.
  9. Fabio Gadducci, Matthias M. Hölzl, Giacoma Valentina Monreale & Martin Wirsing (2013): Soft Constraints for Lexicographic Orders. In: Advances in Artificial Intelligence and Its Applications, Mexican International Conference on Artificial Intelligence, MICAI, pp. 68–79. Available at http://dx.doi.org/10.1007/978-3-642-45114-0_6.
  10. Sung-Shik T.Q. Jongmans, Tobias Kappé & Farhad Arbab (2015): Composing Constraint Automata, State-by-State. In: Proc. Formal Aspects of Component Software, pp. 263–280. Available at http://dx.doi.org/10.1007/978-3-319-28934-2_12.
  11. Tobias Kappé, Farhad Arbab & Carolyn Talcott (2016): A Compositional Framework For Preference-Aware Agents. CWI Technical Report FM-1603. Available at https://repository.cwi.nl/noauth/search/fullrecord.php?publnr=24625.
  12. Sanjiang Li & Mingsheng Ying (2008): Soft constraint abstraction based on semiring homomorphism. Theor. Comput. Sci. 403(2-3), pp. 192–201. Available at http://dx.doi.org/10.1016/j.tcs.2008.03.029.
  13. Jan J. M. M. Rutten (2005): A coinductive calculus of streams. Mathematical Structures in Computer Science 15(1), pp. 93–147. Available at http://dx.doi.org/10.1017/S0960129504004517.
  14. Martin Sachenbacher & Brian C. Williams (2006): Conflict-Directed A* Search for Soft Constraints. In: Proc. Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR, pp. 182–196. Available at http://dx.doi.org/10.1007/11757375_16.
  15. Carolyn L. Talcott, Farhad Arbab & Maneesh Yadav (2015): Soft Agents: Exploring Soft Constraints to Model Robust Adaptive Distributed Cyber-Physical Agent Systems. In: Software, Services, and Systems — Essays Dedicated to Martin Wirsing on the Occasion of His Retirement from the Chair of Programming and Software Engineering, pp. 273–290. Available at http://dx.doi.org/10.1007/978-3-319-15545-6_18.
  16. Martin Wirsing, Grit Denker, Carolyn L. Talcott, Andy Poggio & Linda Briesemeister (2007): A Rewriting Logic Framework for Soft Constraints. Electr. Notes Theor. Comput. Sci. 176(4), pp. 181–197. Available at http://dx.doi.org/10.1016/j.entcs.2007.06.015.

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org