Results 41 to 50 of about 1,567 (182)
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
Energy Based Logic Mining Analysis with Hopfield Neural Network for Recruitment Evaluation
Entropy, 2020 An effective recruitment evaluation plays an important role in the success of companies, industries and institutions. In order to obtain insight on the relationship between factors contributing to systematic recruitment, the artificial neural network and
Siti Zulaikha Mohd Jamaludin +4 more
doaj +1 more source
LTL satisfiability checking [PDF]
International Journal on Software Tools for Technology Transfer, 2007 We report here on an experimental investigation of LTL satisfiability checking via a reduction to model checking. By using large LTL formulas, we offer challenging model-checking benchmarks to both explicit and symbolic model checkers. For symbolic model checking, we use CadenceSMV, NuSMV, and SAL-SMC.
Kristin Y. Rozier, Moshe Y. Vardi
openaire +1 more source
International Journal of Apllied Mathematics, 2016 We define a satisfiability tree in the context of classical propositional logic. Satisfiability tree is a structure inspired by the Beth’s semantic tableau, later refined into its modern variant by Lis and Smullyan and by the notion that tableau is a tree-like representation of a formula.
openaire +3 more sources
Satisfiability of CTL* with Constraints [PDF]
, 2013 We show that satisfiability for CTL* with equality-, order-, and modulo-constraints over Z is decidable. Previously, decidability was only known for certain fragments of CTL*, e.g., the existential and positive fragments and EF.
Claudia Carapelle +2 more
openaire +2 more sources
The Complexity of Generalized Satisfiability for Linear Temporal Logic [PDF]
Logical Methods in Computer Science, 2009 In a seminal paper from 1985, Sistla and Clarke showed that satisfiability for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the set of temporal operators used.
Michael Bauland +4 more
doaj +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
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
Advanced Electronic Materials, EarlyView.Ising machines are emerging as specialized hardware solvers for computationally hard optimization problems. This review examines five major platforms—digital CMOS, analog CMOS, emerging devices, coherent optics, and quantum systems—highlighting physics‐rooted advantages and shared bottlenecks in scalability and connectivity.
Hyunjun Lee, Joon Pyo Kim, Sanghyeon Kim
wiley +1 more source