Results 51 to 60 of about 62,255 (228)
Satisfiability-unsatisfiability transition in the adversarial satisfiability problem [PDF]
Physical Review E, 2014 Adversarial satisfiability (AdSAT) is a generalization of the satisfiability (SAT) problem in which two players try to make a Boolean formula true (resp. false) by controlling their respective sets of variables. AdSAT belongs to a higher complexity class in the polynomial hierarchy than SAT, and therefore the nature of the critical region and the ...
Bardoscia, Marco +2 more
openaire +3 more sources
Algorithmic Problems for Computation Trees
LogicsIn this paper, we study three algorithmic problems involving computation trees: the optimization, solvability, and satisfiability problems. The solvability problem is concerned with recognizing computation trees that solve problems.
Mikhail Moshkov
doaj +1 more source
Assessment of Quantum Annealing for the Construction of Satisfiability Filters
SciPost Physics, 2017 Satisfiability filters, introduced by S. A. Weaver et al. in 2014, are a new and promising type of filters to address set membership testing. In order to construct satisfiability filters, it is necessary to find disparate solutions to hard random $k ...
Marlon Azinović, Daniel Herr, Bettina Heim, Ethan Brown, Matthias Troyer
doaj +1 more source
Generalized modal satisfiability
Journal of Computer and System Sciences, 2010 32 pages, 3 figures.
Hemaspaandra, Edith +2 more
openaire +3 more sources
Matrices Satisfying Regular Minimality [PDF]
Frontiers in Psychology, 2010 A matrix of discrimination measures (discrimination probabilities, numerical estimates of dissimilarity, etc.) satisfies Regular Minimality (RM) if every row and every column of the matrix contains a single minimal entry, and an entry minimal in its row is minimal in its column.
Trendtel, Matthias +2 more
openaire +3 more sources
IET Smart Energy Systems, EarlyView.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 +6 more
wiley +1 more source
Satisfiability Threshold of Random Propositional S5 Theories
AxiomsModal logic S5, which isan important knowledge representation and reasoning paradigm, has been successfully applied in various artificial-intelligence-related domains.
Zaihang Su +3 more
doaj +1 more source
A Case for Contingent Absurdity
European Journal of Philosophy, EarlyView.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
Predicting Propositional Satisfiability Based on Graph Attention Networks
International Journal of Computational Intelligence Systems, 2022 Boolean satisfiability problems (SAT) have very rich generic and domain-specific structures. How to capture these structural features in the embedding space and feed them to deep learning models is an important factor influencing the use of neural ...
Wenjing Chang, Hengkai Zhang, Junwei Luo
doaj +1 more source
SMC: Satisfiability Modulo Convex Programming
Proceedings of the IEEE, 2018 The design of cyber–physical systems (CPSs) requires methods and tools that can efficiently reason about the interaction between discrete models, e.g., representing the behaviors of “cyber” components, and continuous models of physical processes. Boolean
Yasser Shoukry +5 more
semanticscholar +1 more source