Results 41 to 50 of about 18,622 (181)

A New General Method to Generate Random Modal Formulae for Testing Decision Procedures

, 2011
The recent emergence of heavily-optimized modal decision procedures has highlighted the key role of empirical testing in this domain. Unfortunately, the introduction of extensive empirical tests for modal logics is recent, and so far none of the proposed
Patel-Schneider, P. F., Sebastiani, R.
core   +1 more source

Orientations of Graphs With at Most One Directed Path Between Every Pair of Vertices

Journal of Graph Theory, EarlyView.
ABSTRACT Given a graph G $G$, we say that an orientation D $D$ of G $G$ is a KT orientation if, for all u , v ∈ V ( D ) $u,v\in V(D)$, there is at most one directed path (in any direction) between u $u$ and v $v$. Graphs that admit such orientations have been used to construct graphs with large chromatic number and small clique number that served as ...
Barbora Dohnalová, Jiří Kalvoda, Gaurav Kucheriya, Sophie Spirkl   +3 more
wiley   +1 more source

Is a More‐Than‐Minimal State the Meta‐Utopia?

Philosophy &Public Affairs, EarlyView.
ABSTRACT Part III of Anarchy, State, and Utopia defends the minimal state as a framework for utopia. On Bader's reconstruction, this defense contains two justificatory strands: a common ground argument, which shows the minimal state to be compatible with the widest range of utopian associations, and an approximation argument, which holds it to be the ...
Carlo Ludovico Cordasco
wiley   +1 more source

Finding Minimum‐Cost Explanations for Predictions Made by Tree Ensembles

Software: Practice and Experience, Volume 56, Issue 6, Page 615-642, June 2026.
ABSTRACT The ability to reliably explain why a machine learning model arrives at a particular prediction is crucial when used as decision support by human operators of critical systems. The provided explanations must be provably correct, and preferably without redundant information, called minimal explanations.
John Törnblom, Emil Karlsson, Simin Nadjm‐Tehrani   +2 more
wiley   +1 more source

Engineering Binary Metal Oxide Nano‐Oscillators for Deterministic and Probabilistic Computing: From Material Physics to Emerging Paradigms

Advanced Physics Research, Volume 5, Issue 5, May 2026.
This study demonstrates a versatile hardware platform using nano‐oscillators based on binary oxides for deterministic and probabilistic computing. By tailoring material physics, NbOx enables energy‐efficient synchronization for pattern recognition, while enhanced stochasticity in engineered SiOx provides robust entropy for p‐bits to solve complex ...
Jihyun Kim, Jaehyun Moon, Seung‐Youl Kang, Jiyong Woo   +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

Anytime Lexicographic Enumeration of the Pareto Front in Multi‐Objective Combinatorial Optimisation

Journal of Multi-Criteria Decision Analysis, Volume 33, Issue 1, April 2026.
ABSTRACT Multi‐objective combinatorial optimisation problems are widespread in real‐world scenarios, including resource allocation, scheduling and logistics, where multiple competing objectives need to be optimised simultaneously. In industrial contexts, lexicographic optimisation is often used to solve these problems, requiring the decision‐maker (DM)
Marco Foschini, Dimos Tsouros, Bistra Dilkina, Tias Guns   +3 more
wiley   +1 more source

Exact Synthesis of ESOP Forms

, 2018
We present an exact synthesis approach for computing Exclusive-or Sum-of-Products (ESOP) forms with a minimum number of product terms using Boolean satisfiability. Our approach finds one or more ESOP forms for a given Boolean function.
De Micheli, Giovanni, Ehlers, Rüdiger, Riener, Heinz, Schmitt, Bruno   +3 more
core   +1 more source

Efficient Mechanisms for Multi‐Asset Bilateral Trading

Journal of Public Economic Theory, Volume 28, Issue 2, April 2026.
ABSTRACT We study when ex‐post efficient bilateral trade is possible under two‐sided asymmetric information with two agents and two assets, subject to balanced budget and voluntary participation constraints. We characterize how the interaction between asset characteristics and ownership structure determines the possibility of efficiency.
Nicolás Figueroa, Vasiliki Skreta
wiley   +1 more source

A New General Method to Generate Random Modal Formulae for Testing Decision Procedures [PDF]

, 2003
The recent emergence of heavily-optimized modal decision procedures has highlighted the key role of empirical testing in this domain. Unfortunately, the introduction of extensive empirical tests for modal logics is recent, and so far none of the proposed
Patel-Schneider, Peter F., Sebastiani, Roberto   +1 more
core   +3 more sources