Constraint satisfaction problem
View article: Constraint and Redistribution Dynamics
Constraint and Redistribution Dynamics Open
Constraint and Redistribution Dynamics This post shares an early draft of Constraint and Redistribution Dynamics (CRD). CRD is a descriptive structural lens, not a dynamics or causal theory. It explores how patterns appear to change throug…
View article: Constraint and Redistribution Dynamics
Constraint and Redistribution Dynamics Open
Constraint and Redistribution Dynamics This post shares an early draft of Constraint and Redistribution Dynamics (CRD). CRD is a descriptive structural lens, not a dynamics or causal theory. It explores how patterns appear to change throug…
View article: CAT'S THEORY: Topological Closure and the Architecture of Self-Monitoring: Hierarchical Satisfaction of the P×I×Pr Invariant in Computational and Physical Systems
CAT'S THEORY: Topological Closure and the Architecture of Self-Monitoring: Hierarchical Satisfaction of the P×I×Pr Invariant in Computational and Physical Systems Open
We present a hierarchical framework for understanding the relationship between intelligence, self-monitoring, and consciousness based on nested satisfaction of the P×I×Pr (Pattern × Intent × Presence) invariant. While prior work establishe…
View article: CAT'S THEORY: Topological Closure and the Architecture of Self-Monitoring: Hierarchical Satisfaction of the P×I×Pr Invariant in Computational and Physical Systems
CAT'S THEORY: Topological Closure and the Architecture of Self-Monitoring: Hierarchical Satisfaction of the P×I×Pr Invariant in Computational and Physical Systems Open
We present a hierarchical framework for understanding the relationship between intelligence, self-monitoring, and consciousness based on nested satisfaction of the P×I×Pr (Pattern × Intent × Presence) invariant. While prior work establishe…
View article: Constraint-oriented biased quantum search for general constrained combinatorial optimization problems
Constraint-oriented biased quantum search for general constrained combinatorial optimization problems Open
We present a quantum algorithmic routine that extends the realm of Grover-based heuristics for tackling combinatorial optimization problems with arbitrary efficiently computable objective and constraint functions. Building on previously de…
View article: Constraint-oriented biased quantum search for general constrained combinatorial optimization problems
Constraint-oriented biased quantum search for general constrained combinatorial optimization problems Open
We present a quantum algorithmic routine that extends the realm of Grover-based heuristics for tackling combinatorial optimization problems with arbitrary efficiently computable objective and constraint functions. Building on previously de…
View article: Constraint Decomposition for Multi-Objective Instruction-Following in Large Language Models
Constraint Decomposition for Multi-Objective Instruction-Following in Large Language Models Open
Large language models (LLMs) trained with reinforcement learning from human feed- back (RLHF) struggle with complex instructions that bundle multiple, potentially con- icting requirements. We introduce constraint decomposition, a framework…
View article: Context-Adaptive Color Optimization for Web Accessibility: Balancing Perceptual Fidelity and Functional Requirements
Context-Adaptive Color Optimization for Web Accessibility: Balancing Perceptual Fidelity and Functional Requirements Open
We extend our OKLCH-based accessibility optimization with context-adaptive constraint strategies that achieve near-universal success rates across diverse use cases. Our original strict algorithm reached 66-77% success by prioritizing minim…
View article: Chromatic Feature Vectors for 2-Trees: Exact Formulas for Partition Enumeration with Network Applications
Chromatic Feature Vectors for 2-Trees: Exact Formulas for Partition Enumeration with Network Applications Open
We establish closed-form enumeration formulas for chromatic feature vectors of 2-trees under the bichromatic triangle constraint. These efficiently computable structural features derive from constrained graph colorings where each triangle …
View article: Pilot: Power-Aware Hybrid Fault Tolerance in Multi-core Embedded Systems
Pilot: Power-Aware Hybrid Fault Tolerance in Multi-core Embedded Systems Open
With the advancement of technology size and theintegration of multiple cores on a single chip, the probability offault occurrence has increased. These faults can be transient orpermanent, requiring techniques to manage both types. Hybridfa…
View article: Constraint Decomposition for Multi-Objective Instruction-Following in Large Language Models
Constraint Decomposition for Multi-Objective Instruction-Following in Large Language Models Open
Large language models (LLMs) trained with reinforcement learning from human feed- back (RLHF) struggle with complex instructions that bundle multiple, potentially con- icting requirements. We introduce constraint decomposition, a framework…
View article: Context-Adaptive Color Optimization for Web Accessibility: Balancing Perceptual Fidelity and Functional Requirements
Context-Adaptive Color Optimization for Web Accessibility: Balancing Perceptual Fidelity and Functional Requirements Open
We extend our OKLCH-based accessibility optimization with context-adaptive constraint strategies that achieve near-universal success rates across diverse use cases. Our original strict algorithm reached 66-77% success by prioritizing minim…
View article: Pilot: Power-Aware Hybrid Fault Tolerance in Multi-core Embedded Systems
Pilot: Power-Aware Hybrid Fault Tolerance in Multi-core Embedded Systems Open
With the advancement of technology size and theintegration of multiple cores on a single chip, the probability offault occurrence has increased. These faults can be transient orpermanent, requiring techniques to manage both types. Hybridfa…
View article: Chromatic Feature Vectors for 2-Trees: Exact Formulas for Partition Enumeration with Network Applications
Chromatic Feature Vectors for 2-Trees: Exact Formulas for Partition Enumeration with Network Applications Open
We establish closed-form enumeration formulas for chromatic feature vectors of 2-trees under the bichromatic triangle constraint. These efficiently computable structural features derive from constrained graph colorings where each triangle …
View article: Network-Aware Path Planning for Autonomous MobileRobots in Industrial Environments
Network-Aware Path Planning for Autonomous MobileRobots in Industrial Environments Open
Autonomous Mobile Robots (AMRs) in industrial environments require reliable wireless connectivity for coordination,control, and safety operations. Traditional path planning algorithms focus solely on geometric constraints, often leadingrob…
View article: Network-Aware Path Planning for Autonomous MobileRobots in Industrial Environments
Network-Aware Path Planning for Autonomous MobileRobots in Industrial Environments Open
Autonomous Mobile Robots (AMRs) in industrial environments require reliable wireless connectivity for coordination,control, and safety operations. Traditional path planning algorithms focus solely on geometric constraints, often leadingrob…
View article: Guiding the Muse: Differentiable Constraint Satisfaction for Creative AI
Guiding the Muse: Differentiable Constraint Satisfaction for Creative AI Open
This paper explores the application of differentiable constraint satisfaction (DCS) techniques to enhance creative artificial intelligence (AI) systems. DCS provides a framework for integrating soft and hard constraints within neural netwo…
View article: Local equations describe unreasonably efficient stochastic algorithms in random K-SAT
Local equations describe unreasonably efficient stochastic algorithms in random K-SAT Open
Despite significant advances in characterizing the highly nonconvex landscapes of constraint satisfaction problems, the good performance of certain algorithms in solving hard combinatorial optimization tasks remains poorly understood. This…
View article: Guiding the Muse: Differentiable Constraint Satisfaction for Creative AI
Guiding the Muse: Differentiable Constraint Satisfaction for Creative AI Open
This paper explores the application of differentiable constraint satisfaction (DCS) techniques to enhance creative artificial intelligence (AI) systems. DCS provides a framework for integrating soft and hard constraints within neural netwo…
View article: DCP-Bench-Open
DCP-Bench-Open Open
Here is the GitHub repository: https://github.com/DCP-Bench/DCP-Bench-OpenDCP-Bench-Open is a collaborative benchmark of Discrete Combinatorial Problems, with only involving integer and Boolean decision variables. Many problem formulations…
View article: DCP-Bench-Open
DCP-Bench-Open Open
Here is the GitHub repository: https://github.com/DCP-Bench/DCP-Bench-OpenDCP-Bench-Open is a collaborative benchmark of Discrete Combinatorial Problems, with only involving integer and Boolean decision variables. Many problem formulations…
View article: An efficient SAT encoding for solving the Social Golfer Problem
An efficient SAT encoding for solving the Social Golfer Problem Open
The Social Golfer Problem (SGP), a classic NP-complete combinatorial optimization challenge, poses significant scalability issues for automated solvers. To address these limitations, this paper introduces a novel and efficient SAT encoding…
View article: New Perspectives on Semiring Applications to Dynamic Programming
New Perspectives on Semiring Applications to Dynamic Programming Open
Semiring algebras have been shown to provide a suitable language to formalize many noteworthy combinatorial problems. For instance, the Shortest-Path problem can be seen as a special case of the Algebraic-Path problem when applied to the t…
View article: Thermo-Logic Attention Dynamics (TLAD): Differentiable Hard Logic via Disentangled Lagrangian Mechanics
Thermo-Logic Attention Dynamics (TLAD): Differentiable Hard Logic via Disentangled Lagrangian Mechanics Open
Neuro-symbolic (NeSy) AI faces a long-standing trilemma: no method simultaneously achieves end-to-end differentiability, strict hard constraint satisfaction, and data efficiency. We propose Thermo-Logic Attention Dynamics (TLAD), a framewo…
View article: The Problem of Multi-Element Relations: A Tentative Theory of Multi-Element Constraint Structures (MECS)
The Problem of Multi-Element Relations: A Tentative Theory of Multi-Element Constraint Structures (MECS) Open
This paper proposes a mathematical and philosophical foundation for Multi-Element ConstraintStructures (MECS), a framework designed to model irreducible n-ary relations. Standardmathematical practice reduces n-ary relations to sets of tupl…
View article: The Problem of Multi-Element Relations: A Tentative Theory of Multi-Element Constraint Structures (MECS)
The Problem of Multi-Element Relations: A Tentative Theory of Multi-Element Constraint Structures (MECS) Open
This paper proposes a mathematical and philosophical foundation for Multi-Element ConstraintStructures (MECS), a framework designed to model irreducible n-ary relations. Standardmathematical practice reduces n-ary relations to sets of tupl…
View article: The Curvature–Packing–Dynamics (CPD) Framework: Paper 4 — C-Dominated Systems
The Curvature–Packing–Dynamics (CPD) Framework: Paper 4 — C-Dominated Systems Open
This paper examines systems whose behavior is dominated by geometric capacity C, correspondingto the C-dominated universality class of the CPD framework ( Paper 3). In these systems, geometrycontrols motion, constraint effects are mild, an…
View article: The Curvature–Packing–Dynamics (CPD) Framework: Paper 5 — P-Dominated Systems
The Curvature–Packing–Dynamics (CPD) Framework: Paper 5 — P-Dominated Systems Open
This paper develops the second universality class of the CPD framework: systems in which packing,compression, or constraint pressure (P) dominates the effective evolution. P-dominated systemsoccur when free geometric capacity (C) collapses…
View article: The Curvature–Packing–Dynamics (CPD) Framework: Paper 4 — C-Dominated Systems
The Curvature–Packing–Dynamics (CPD) Framework: Paper 4 — C-Dominated Systems Open
This paper examines systems whose behavior is dominated by geometric capacity C, correspondingto the C-dominated universality class of the CPD framework ( Paper 3). In these systems, geometrycontrols motion, constraint effects are mild, an…
View article: The Curvature–Packing–Dynamics (CPD) Framework: Paper 5 — P-Dominated Systems
The Curvature–Packing–Dynamics (CPD) Framework: Paper 5 — P-Dominated Systems Open
This paper develops the second universality class of the CPD framework: systems in which packing,compression, or constraint pressure (P) dominates the effective evolution. P-dominated systemsoccur when free geometric capacity (C) collapses…