arXiv:2607. 20022v1 Announce Type: new Abstract: Difference constraints of the form $x - y \leq d$ are well studied, with efficient algorithms for satisfaction and implication, because of their connection to shortest paths.
arXiv:2608. 15143v1 Announce Type: new Abstract: Constraint solving is a declarative approach for solving combinatorial satisfaction and optimization problems.
arXiv:2607. 13344v1 Announce Type: new Abstract: Constraint Answer Set Programming (CASP) is a hybrid reasoning paradigm that combines Answer Set Programming (ASP) with Constraint Processing and Satisfiability Modulo Theories (SMT), enabling powerful declarative encodings of complex combinatorial search problems.
arXiv:2607. 23785v1 Announce Type: cross Abstract: The Simple Temporal Problem (STP) is a core framework for quantitative temporal constraints.
The Simple Temporal Problem (STP) is a core framework for quantitative temporal constraints. As STP data can be inconsistent, we study MAXSTP: compute a maximum-cardinality consistent subset of constraints.
arXiv:2607. 21201v1 Announce Type: new Abstract: While the integration of linear constraints has significantly expanded the reach of Answer Set Programming (ASP), existing hybrid solvers often rely on disparate semantic underpinnings that lack a unified logical foundation.
arXiv:2002. 11508v3 Announce Type: replace Abstract: TCSPs (Temporal Constraint Satisfaction Problems) [Dechter et al.
arXiv:2606. 04816v1 Announce Type: new Abstract: Large language models (LLMs) increasingly translate natural-language optimization problems into executable solver code.
arXiv:2607. 07026v1 Announce Type: new Abstract: Constrained decoding is essential for serving LLMs, ensuring that generated outputs follow specific structures such as JSON schema-formatted function calls.
arXiv:2607. 16523v1 Announce Type: new Abstract: One of the main strengths of Constraint Programming is the ability to reduce the search space via propagation.
arXiv:2507. 22876v2 Announce Type: replace Abstract: The Satisfiability problem (SAT) is fundamental in computational complexity theory and has a wide range of industrial applications.
arXiv:2608. 10881v1 Announce Type: new Abstract: The Traveling Salesperson Problem (TSP) is one of the best-known problems in computer science and arises in many engineering applications, such as smart vehicles and intelligent transportation systems.
arXiv:2601. 09097v3 Announce Type: replace Abstract: Multi-constraint planning involves identifying, evaluating, and refining candidate plans while satisfying multiple, potentially conflicting constraints.