Results 91 to 100 of about 20,200 (225)

(Un)Decidability Results for Word Equations with Length and Regular Expression Constraints [PDF]

, 2013
We prove several decidability and undecidability results for the satisfiability and validity problems for languages that can express solutions to word equations with length constraints.
Ganesh, Vijay, Minnes, Mia, Rinard, Martin, Solar-Lezama, Armando   +3 more
core  

Necessary and Sufficient Condition for Satisfiability of a Boolean Formula in CNF and its Implications on P versus NP problem [PDF]

, 2021
Manoj Kumar
openalex   +1 more source

Enumeration and Construction of Row‐Column Designs

Journal of Combinatorial Designs, Volume 33, Issue 9, Page 357-372, September 2025.
ABSTRACT We computationally completely enumerate a number of types of row‐column designs up to isotopism, including double, sesqui, and triple arrays as known from the literature, and two newly introduced types that we call mono arrays and AO‐arrays. We calculate autotopism group sizes for the designs we generate.
Gerold Jäger, Klas Markström, Denys Shcherbak, Lars‐Daniel Öhman   +3 more
wiley   +1 more source

Solving Linux Upgradeability Problems Using Boolean Optimization

, 2010
Managing the software complexity of package-based systems can be regarded as one of the main challenges in software architectures. Upgrades are required on a short time basis and systems are expected to be reliable and consistent after that.
Chris Tucker, Chu Min Li, Claude Michel, Daniel Le Berre, Daniel Le Berre, Daniel Le Berre, Fabio Mancinelli, Germain Faure, Inês Lynce, Inês Lynce, Joao Marques-Silva, Joao Marques-Silva, Joao Marques-Silva, Josep Argelich, Josep Argelich, Niklas Eén, Olivier Roussel, Pascal Rapicault, Ralf Treinen, S. Cook, Steven David Prestwich, Vasco Manquinho   +21 more
core   +3 more sources

Conformal Hypergraphs: Duality and Implications for the Upper Clique Transversal Problem

Journal of Graph Theory, Volume 109, Issue 4, Page 466-480, August 2025.
ABSTRACT Given a hypergraph ℋ, the dual hypergraph of ℋ is the hypergraph of all minimal transversals of ℋ. The dual hypergraph is always Sperner, that is, no hyperedge contains another. A special case of Sperner hypergraphs are the conformal Sperner hypergraphs, which correspond to the families of maximal cliques of graphs.
Endre Boros, Vladimir Gurvich, Martin Milanič, Yushi Uno   +3 more
wiley   +1 more source

Inference of ecological networks and possibilistic dynamics based on Boolean networks from observations and prior knowledge

Methods in Ecology and Evolution, Volume 16, Issue 8, Page 1851-1867, August 2025.
Abstract Being able to infer the interactions between a set of species from observations of the system is of paramount importance to obtain explanatory and predictive models in ecology. We tackled this challenge by employing qualitative modelling frameworks and logic methods for the synthesis of mathematical models that can integrate both observations ...
Loïc Paulevé, Cédric Gaucherel
wiley   +1 more source

Generalized Satisfiability Problems via Operator Assignments

, 2017
Schaefer introduced a framework for generalized satisfiability problems on the Boolean domain and characterized the computational complexity of such problems. We investigate an algebraization of Schaefer's framework in which the Fourier transform is used
A Acín, A Peres, D Geiger, EL Post, GB Folland, GB Folland, JS Bell, ND Mermin, ND Mermin, PR Halmos, R Cleve, R O’Donnell, VG Bodnarchuk   +12 more
core   +1 more source

Highly durable and energy‐efficient probabilistic bits based on h‐BN/SnS2 interface for integer factorization

InfoMat, Volume 7, Issue 7, July 2025.
This study introduces a novel probabilistic bit (p‐bit) device utilizing advanced materials, hexagonal boron nitride (h‐BN) and tin disulfide (SnS2), to enhance durability and energy efficiency in computational applications. By leveraging the stochastic behavior of electron trapping and detrapping at the h‐BN/SnS2 interface, the device achieves ...
Joon‐Kyu Han, Jun‐Young Park, Shania Rehman, Muhammad Farooq Khan, Moon‐Seok Kim, Sungho Kim   +5 more
wiley   +1 more source

Recursive Online Enumeration of All Minimal Unsatisfiable Subsets

, 2018
In various areas of computer science, we deal with a set of constraints to be satisfied. If the constraints cannot be satisfied simultaneously, it is desirable to identify the core problems among them. Such cores are called minimal unsatisfiable subsets (
Anton Belov, Fahiem Bacchus, J Bailey, J Bendík, MH Liffiton   +4 more
core   +1 more source

To infinity and beyond: A general framework for scaling economic theories

Theoretical Economics, Volume 20, Issue 2, Page 511-542, May 2025.
Many economic models incorporate finiteness assumptions that, while introduced for simplicity, play a real role in the analysis. We provide a principled framework for scaling results from such models by removing these finiteness assumptions. Our sufficient conditions are on the theorem statement only, and not on its proof. This results in short proofs,
Yannai A. Gonczarowski, Scott Duke Kominers, Ran I. Shorrer   +2 more
wiley   +1 more source