Skip to main content
Scour
Browse
Getting Started
Login
Sign Up
You are offline. Trying to reconnect...
Close
Copied to clipboard
Close
Unable to share or copy to clipboard
Close
π― Constraint Programming
Satisfiability, Logic Programming, Optimization, Search
Filter Results
Timeframe
Fresh
Past Hour
Today
This Week
This Month
Feeds to Scour
Subscribed
All
Scoured
2648
posts in
8.6
ms
Toward a
Uniform
Algorithm and
Uniform
Reduction for
Constraint
Problems
Β
π―
Randomized Algorithms
arxiv.org
Β·
1d
SMT with
Uninterpreted
Functions and
Monotonicity
Constraints in Systems Biology
Β
β
Functional Programming
arxiv.org
Β·
6h
Differentiable
Symbolic Planning: A Neural Architecture for Constraint Reasoning with Learned
Feasibility
Β
π
Complexity Theory
arxiv.org
Β·
4d
Exploration of
Pareto-preserving
Search Space
Transformations
in Multi-objective Test Functions
Β
β
Functional Programming
arxiv.org
Β·
6h
SMB algebras II: On the Constraint Satisfaction Problem over
Semilattices
of Mal'
cev
Blocks
Β
π’
Mathematical Logic
arxiv.org
Β·
2d
Differentiable
SpaTiaL:
Symbolic
Learning and Reasoning with Geometric Temporal Logic for Manipulation Tasks
Β
π’
Mathematical Logic
arxiv.org
Β·
4d
On the
Decompositionality
of Neural Networks
Β
π’
Mathematical Logic
arxiv.org
Β·
6h
Select-then-Solve:
Paradigm
Routing
as Inference-Time Optimization for LLM Agents
Β
π²
Probabilistic Programming
arxiv.org
Β·
1d
When
Switching
Algorithms Helps: A
Theoretical
Study of Online Algorithm Selection
Β
π
Algorithms
arxiv.org
Β·
6h
Algebraic Structure Discovery for Real World Combinatorial
Optimisation
Problems: A General Framework from Abstract Algebra to
Quotient
Space Learning
Β
π―
Randomized Algorithms
arxiv.org
Β·
2d
PyVRP
$^+$: LLM-Driven
Metacognitive
Heuristic Evolution for Hybrid Genetic Search in Vehicle Routing Problems
Β
π
Complexity Theory
arxiv.org
Β·
6h
Domain-Contextualized
Inference: A
Computable
Graph Architecture for Explicit-Domain Reasoning
Β
π’
Mathematical Logic
arxiv.org
Β·
3d
Explaining
Neural Networks in Preference Learning: a Post-hoc
Inductive
Logic Programming Approach
Β
π²
Probabilistic Programming
arxiv.org
Β·
1d
Analysis of Search
Heuristics
in the Multi-Armed
Bandit
Setting
Β
π
Algorithms
arxiv.org
Β·
6h
Logical Robots:
Declarative
Multi-Agent Programming in
Logica
Β
β‘
Concurrency
arxiv.org
Β·
1d
Unified and Efficient Approach for
Multi-Vector
Similarity
Search
Β
πΈοΈ
Graph Theory
arxiv.org
Β·
4d
QaRL
: Rollout-Aligned Quantization-Aware RL for Fast and Stable Training under Training--Inference
Mismatch
Β
π²
Probabilistic Programming
arxiv.org
Β·
6h
A First Guess is
Rarely
the Final Answer: Learning to Search in the Travelling
Salesperson
Problem
Β
π²
Probabilistic Programming
arxiv.org
Β·
1d
Tree-of-Evidence: Efficient "System 2" Search for
Faithful
Multimodal
Grounding
Β
π²
Probabilistic Programming
arxiv.org
Β·
6h
Let's Have a Conversation:
Designing
and
Evaluating
LLM Agents for Interactive Optimization
Β
β
Algorithmic Game Theory
arxiv.org
Β·
4d
Loading...
Loading more...
Page 2 »
Keyboard Shortcuts
Navigation
Next / previous item
j
/
k
Open post
o
or
Enter
Preview post
v
Post Actions
Love post
a
Like post
l
Dislike post
d
Undo reaction
u
Save / unsave
s
Recommendations
Add interest / feed
Enter
Not interested
x
Go to
Home
g
h
Interests
g
i
Feeds
g
f
Likes
g
l
History
g
y
Changelog
g
c
Settings
g
s
Browse
g
b
Search
/
Pagination
Next page
n
Previous page
p
General
Show this help
?
Submit feedback
!
Close modal / unfocus
Esc
Press
?
anytime to show this help