JSetL is a Java library that has been developed at the University of Parma (Italy) since 2002. JSetL is released under the GPL 3.0 license. JSetL allows the user to use a declarative style of programming inside the popular Java programming language. Using JSetL the user can create partially specified (or totally unbound) logical objects such as logical variables, logical lists and sets, logical binary relations and maps, restricted intensional sets, logical pairs, … Moreover, JSetL can be used to declare and solve constraints on logical objects. There is a great number of built-in constraints available for the built-in logical object types. Moreover, JSetL enables the user to create their own constraints and define rewrite rules for them. This means that the JSetL solver can be used as a non-deterministic engine for any user-defined constraint.

References in zbMATH (referenced in 7 articles , 1 standard article )

Showing results 1 to 7 of 7.
Sorted by year (citations)

  1. Cristiá, Maximiliano; Rossi, Gianfranco: Automated reasoning with restricted intensional sets (2021)
  2. Cristiá, Maximiliano; Rossi, Gianfranco: An automatically verified prototype of the Tokeneer ID station specification (2021)
  3. Maximiliano Cristiá, Andrea Fois, Gianfranco Rossi: Declarative Programming with Intensional Sets in Java Using JSetL (2020) arXiv
  4. Rossi, Gianfranco; Bergenti, Federico: Nondeterministic programming in Java with JSetL (2015) ioport
  5. Bergenti, F.; Chiarabini, L.; Rossi, G.: Programming with partially specified aggregates in Java (2011) ioport
  6. Bergenti, Federico; Dal Palù, Alessandro; Rossi, Gianfranco: Integrating finite domain and set constraints into a set-based constraint language (2009)
  7. Rossi, G.; Panegai, E.; Poleo, E.: JSetL: a Java library for supporting declarative programming in Java (2007) ioport

Further publications can be found at: http://www.clpset.unipr.it/jsetl/index.php/papers/