CLAIRE: Combining sets, search and rules to better express algorithms, programming language. This paper presents a programming language which includes paradigms that are usually associated with declarative languages, such as sets, rules and search, into an imperative (functional) language. Although these paradigms are separately well known and are available under various programming environments, the originality of the CLAIRE language comes from the tight integration, which yields interesting run-time performances, and from the richness of this combination, which yields new ways in which to express complex algorithmic patterns with few elegant lines. To achieve the opposite goals of a high abstraction level (conciseness and readability) and run-time performance (CLAIRE is used as a C++ pre-processor), we have developed two kinds of compiler: first, a pattern pre-processor handles iterations over both concrete and abstract sets (data types and program fragments), in a completely user-extensible manner; secondly, an inference compiler transforms a set of logical rules into a set of functions (demons that are used through procedural attachment).

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

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

1 2 next

  1. Maximiliano Cristiá, Andrea Fois, Gianfranco Rossi: Declarative Programming with Intensional Sets in Java Using JSetL (2020) arXiv
  2. Maher, Michael J.: Local consistency for extended CSPs (2009)
  3. Azevedo, Francisco: Cardinal: a finite sets constraint solver (2007)
  4. Caseau, Yves: Combining constraint propagation and meta-heuristics for searching a maximum weight Hamiltonian chain (2006)
  5. de Givry, Simon; Jeannin, Laurent: A unified framework for partial and hybrid search methods in constraint programming (2006)
  6. Loudni, Samir; Boizumault, Patrice; David, Philippe: On-line resources allocation for ATM networks with rerouting (2006)
  7. Vidal, Vincent; Geffner, Héctor: Branching and pruning: An optimal temporal POCL planner based on constraint programming (2006)
  8. Bousonville, Thomas; Focacci, Filippo; Le Pape, Claude; Nuijten, Wim; Paulin, Frederic; Puget, Jean-Francois; Robert, Anna; Sadeghin, Alireza: Integration of rules and optimization in Plant PowerOps (2005)
  9. Trandac, Huy; Baptiste, Philippe; Duong, Vu: Airspace sectorization with constraints (2005)
  10. Caseau, Yves; Josset, François-Xavier; Laburthe, François: CLAIRE: Combining sets, search and rules to better express algorithms (2004) ioport
  11. Carlier, J.; Néron, E.: On linear lower bounds for the resource constrained project scheduling problem. (2003)
  12. de Moura, Francisco; de Azevedo, Castro Ascensão: Constraint solving over multi-valued logics -- application to digital circuits. (2003)
  13. Van Roy, Peter; Brand, Per; Duchier, Denys; Haridi, Seif; Schulte, Christian; Henz, Martin: Logic programming in the context of multiparadigm programming: The Oz experience (2003)
  14. Abdennadher, Slim; Krämer, Ekkerhard; Saft, Matthias; Schmauss, Matthias: JACK: a Java constraint kit (2002) ioport
  15. Caseau, Yves; Josset, François-Xavier; Laburthe, François: CLAIRE: Combining sets, search and rules to better express algorithms (2002)
  16. Schulte, Christian: Programming constraint services. High-level programming of standard and new constraint services (2002)
  17. Apt, Krzysztof R.; Monfroy, Eric: Constraint programming viewed as rule-based programming (2001)
  18. Baptiste, Philippe; Le Pape, Claude; Nuijten, Wim: Constraint-based scheduling: Applying constraint programming to scheduling problems. (2001)
  19. Caseau, Yves; Laburthe, François; Le Pape, Claude; Rottembourg, Benoît: Combining local and global search in a constraint programming environment (2001)
  20. Choi, Chiu Wo; Henz, Martin; Ng, Ka Boon: Components for state restoration in tree search (2001)

1 2 next