boolean satisfiability problem
PulseAugur coverage of boolean satisfiability problem — every cluster mentioning boolean satisfiability problem across labs, papers, and developer communities, ranked by signal.
2 day(s) with sentiment data
-
New method generates hard instances for NP-hard problems
Researchers have developed a novel method for generating challenging instances for optimization problems, treating instance creation as an optimization task itself. This approach uses a black-box optimizer to search for…
-
New neuro-symbolic NLI system improves proposition linking accuracy
Researchers have developed a novel neuro-symbolic approach for Natural Language Inference (NLI) that improves the accuracy of linking propositions between premise and hypothesis sentences. This new system introduces a t…
-
Tiny Recursive Message Passing boosts AI reasoning with parameter-efficient models
Researchers have developed a novel approach called Tiny Recursive Message Passing (TRMP) that combines message passing neural networks with recursive transformers. This method enhances performance on complex reasoning t…
-
New SAT-based framework tackles graph labeling problems
Researchers have introduced a new framework for solving Minimum Span Antibandwidth and Cyclic Antibandwidth Labeling (MSABL/MSCABL) problems. These problems are variations of graph labeling tasks that focus on minimizin…
-
Formal verification of Romanov's Triplet Logic achieved in Rocq proof assistant
Researchers have formally verified Romanov's Triplet Logic (TLS) using the Rocq proof assistant, marking the first mechanized formalization of this combinatorial framework. The work details the formalization of core TLS…
-
Paper argues nature inspires math innovation, justifying LLM scale
A new paper proposes that human mathematical innovation stems from pattern matching with the natural world, rather than solely from pure reasoning. The authors argue that the complexity and intractability of logical sys…
-
AI needs nature's patterns for math creativity, not just logic
A new hypothesis suggests that human mathematical reasoning, beyond pure deduction, fundamentally relies on pattern matching from external domains, particularly the natural world. This is because pure reasoning faces li…
-
BNN Robustness Verification Complexity Analyzed in New Paper
This paper investigates the computational complexity of verification problems for Binarized Neural Networks (BNNs). Researchers demonstrated that BNN satisfiability is NP-complete by reducing it from the Boolean satisfi…
-
Reasoning LLMs show distinct internal trajectories beyond generation length
Researchers have developed a method to analyze the internal trajectories of reasoning-trained language models, distinguishing between simply taking more steps and following different computational paths. By adjusting fo…