Abstract: Constraint logic programming (CLP) is a new class of declarative programming languages whose primitive operations are based on constraints (e.g. constraint solving and constraint entailment) ...

Abstract: Optimization and relaxation are two important operations that naturally arise in many applications requiring the use of constraints, e.g., engineering design, scheduling, decision support, ...

It is designed as a scalable solver for recursive logic constraints. Suitable but not only for test generation, symbolic execution and program synthesis.

Answer Set Programming (ASP) and Logic Programming represent key paradigms in contemporary computer science, particularly in the field of artificial intelligence. ASP is a form of declarative ...

The best way to describe miniKanren (or more generally, a relational programming language) is by example. You could simply use Grid Search from scikit-learn. Relational programming doesn't provide ...

Picat is a new logic-based programming language. In many ways, Picat is similar to Prolog, especially B-Prolog, but it has functions in addition to predicates, pattern-matching instead of unification ...

In the article, the authors harness recent advances in incremental answer set solving for developing effective algorithms for reasoning tasks in the logic programming fragment of assumption-based ...