DeepAI AI Chat
Log In Sign Up

Quantaloidal approach to constraint satisfaction

by   Soichiro Fujii, et al.

The constraint satisfaction problem (CSP) is a computational problem that includes a range of important problems in computer science. We point out that fundamental concepts of the CSP, such as the solution set of an instance and polymorphisms, can be formulated abstractly inside the 2-category 𝒫𝐅𝐢𝐧𝐒𝐞𝐭 of finite sets and sets of functions between them. The 2-category 𝒫𝐅𝐢𝐧𝐒𝐞𝐭 is a quantaloid, and the formulation relies mainly on structure available in any quantaloid. This observation suggests a formal development of generalisations of the CSP and concomitant notions of polymorphism in a large class of quantaloids. We extract a class of optimisation problems as a special case, and show that their computational complexity can be classified by the associated notion of polymorphism.


page 1

page 2

page 3

page 4


Submodular Functions and Valued Constraint Satisfaction Problems over Infinite Domains

Valued constraint satisfaction problems (VCSPs) are a large class of com...

Piecewise Linear Valued CSPs Solvable by Linear Programming Relaxation

Valued constraint satisfaction problems (VCSPs) are a large class of com...

On the complexity of the approximate hypergraph homomorphism problem

Understanding the computational complexity of fragments of the Constrain...

Constraint Propagation as Information Maximization

This paper draws on diverse areas of computer science to develop a unifi...

The replica symmetric phase of random constraint satisfaction problems

Random constraint satisfaction problems play an important role in comput...

A Unifying Framework for Structural Properties of CSPs: Definitions, Complexity, Tractability

Literature on Constraint Satisfaction exhibits the definition of several...