Results 91 to 100 of about 12,229,216 (240)

Satisfiability Problems for Finite Groups

, 2022
Over twenty years ago, Goldmann and Russell initiated the study of the complexity of the equation satisfiability problem (PolSat and the NUDFA program satisfiability problem (ProgramSat) in finite groups. They showed that these problems are in 𝖯 for nilpotent groups while they are NP-complete for non-solvable groups.
Idziak, Paweł M., Kawałek, Piotr, Krzaczkowski, Jacek, Weiß, Armin   +3 more
openaire   +3 more sources

Identification of Missing Knowledge in MBSE System Models Using Graph‐Based Machine Learning

Systems Engineering, Volume 29, Issue 2, Page 133-149, March 2026.
ABSTRACT The design and development of complex aerospace systems pose significant challenges due to their growing complexity. Iterative design processes, guided by formal specifications, strive to refine initially vague characteristics through multiple stages.
Esma Karagoz, Olivia J. Pinon Fischer, Dimitri Mavris   +2 more
wiley   +1 more source

Simplifying Random Satisfiability Problem by Removing Frustrating Interactions

, 2006
How can we remove some interactions in a constraint satisfaction problem (CSP) such that it still remains satisfiable? In this paper we study a modified survey propagation algorithm that enables us to address this question for a prototypical CSP, i.e ...
A. Ramezanpour, C. H. Papadimitriou, F. R. Kschischang, M. Mezard, R. G. Gallager, S. Cook, S. Mertens, S. Moghimi-Araghi, S. Seitz   +8 more
core   +1 more source

Solving the incremental satisfiability problem

The Journal of Logic Programming, 1993
Given a set of clauses in propositional logic that have been found satisfiable, we wish to check whether satisfiability is preserved when the clause set is incremented with a new clause. We describe an efficient implementation of the Davis-Putnam-Loveland algorithm for checking the satisfiability of the original set.
openaire   +1 more source

Solving satisfiability problems with preferences [PDF]

Constraints, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Di Rosa, Emanuele, GIUNCHIGLIA, ENRICO, MARATEA, MARCO   +2 more
openaire   +1 more source

Extending the Wave Telescope Technique to Larger Numbers of Spacecraft Obtaining Robust Spatial Power Spectra

Journal of Geophysical Research: Space Physics, Volume 131, Issue 3, March 2026.
Abstract The wave telescope is an analysis technique for multi‐point spacecraft data that estimates power spectra in reciprocal position space (k $k$‐space). It has been used to reveal the spatial properties of waves and fluctuations in space plasmas. Originally designed as an analysis tool for 4 spacecraft constellations, new multi‐scale missions such
L. Schulz, K.‐H. Glassmeier, L. Turc, F. Plaschke, K. G. Klein, M. Palmroth, O. W. Roberts, Y. Narita   +7 more
wiley   +1 more source

Adaptive Hybrid Chance‐Constrained SOCP‐Based ACOPF for Coordinated Optimisation of Integrated Energy Systems

IET Smart Energy Systems, Volume 2, Issue 1, Page 34-48, March 2026.
An adaptive chance‐constrained hybrid SOCP‐Based ACOPF for coordinated optimisation of integrated source–grid–load–storage systems is presented. The coordinated optimisation of integrated source–grid–load–storage (SGLS) systems is challenged by renewable energy uncertainty, complex industrial load characteristics and stringent policy constraints ...
Mingyue He, Zhengxiang Song, Jun Yang, Shaohua Zhang, Ya Mou, Zhongxia Zhang, Jiaqi Wu   +6 more
wiley   +1 more source

A Special Planar Satisfiability Problem and a Consequence of Its NP-completeness

Discrete Applied Mathematics, 1994
We introduce a weaker but still NP-complete satisfiability problem to prove NP-completeness of recognizing several classes of intersection graphs of geometric objects in the plane, including grid intersection graphs and graphs of boxicity two.
Jan Kratochvíl
semanticscholar   +1 more source

A Case for Contingent Absurdity

European Journal of Philosophy, Volume 34, Issue 1, Page 266-280, March 2026.
Abstract A popular view on existential absurdity holds that if life is absurd, it must be inescapably so. In opposition to this view, I argue that the concept of existential absurdity allows for life to be contingently absurd. In Nausea (1938) and Being and Nothingness (1943), Jean‐Paul Sartre puts forward two distinct conceptions of an absurd life ...
Thom Hamer
wiley   +1 more source

Does Treewidth Help in Modal Satisfiability?

, 2010
Many tractable algorithms for solving the Constraint Satisfaction Problem (CSP) have been developed using the notion of the treewidth of some graph derived from the input CSP instance.
A. Herzig, B. Cate ten, B. Courcelle, E. Fischer, G. Pan, G. Pan, H. Chen, H.L. Bodlaender, H.L. Bodlaender, I. Adler, J. Flum, J.H. Reif, J.Y. Halpern, J.Y. Halpern, M. Fellows, M. Grohe, M. Samer, M.Y. Vardi, P. Blackburn, P. Enjalbert, R. Fagin, R.E. Ladner, V. Dalmau, V.R. Pratt, Y. Kazakov   +24 more
core   +1 more source