Results 41 to 50 of about 44,520 (208)

On product, generic and random generic quantum satisfiability

, 2010
We report a cluster of results on k-QSAT, the problem of quantum satisfiability for k-qubit projectors which generalizes classical satisfiability with k-bit clauses to the quantum setting. First we define the NP-complete problem of product satisfiability
Laumann, C. R., Läuchli, A. M., Moessner, R., Scardicchio, A., Sondhi, S. L.   +4 more
core   +1 more source

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, Alexander Kartzow, Markus Lohrey   +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, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer   +4 more
doaj   +1 more source

Modal Logics with Hard Diamond-free Fragments [PDF]

, 2015
We investigate the complexity of modal satisfiability for certain combinations of modal logics. In particular we examine four examples of multimodal logics with dependencies and demonstrate that even if we restrict our inputs to diamond-free formulas (in
A Kurucz, E Hemaspaandra, E Hemaspaandra, JY Halpern, JY Halpern, LA Nguyen, M Marx, R Fagin, RE Ladner, S Artemov, S Demri, S Demri, S Demri   +12 more
core   +1 more source

Satisfiability Threshold of Random Propositional S5 Theories

Axioms
Modal logic S5, which isan important knowledge representation and reasoning paradigm, has been successfully applied in various artificial-intelligence-related domains.
Zaihang Su, Yisong Wang, Renyan Feng, Chan Zhou   +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

Fuzzy Maximum Satisfiability

, 2016
In this paper, we extend the Maximum Satisfiability (MaxSAT) problem to {\L}ukasiewicz logic. The MaxSAT problem for a set of formulae {\Phi} is the problem of finding an assignment to the variables in {\Phi} that satisfies the maximum number of formulae.
Abdalla, Areeg, Halaby, Mohamed El
core   +1 more source

R ( 5 , 5 ) ≤ 46 $R(5,5)\le 46$

Journal of Graph Theory, EarlyView.
ABSTRACT We prove that the Ramsey number R ( 5 , 5 ) $R(5,5)$ is less than or equal to 46. The proof uses a combination of linear programming and checking a large number of cases by computer. All of the computational parts of the proof were independently implemented by both authors, with consistent results.
Vigleik Angeltveit, Brendan D. McKay
wiley   +1 more source

ON SATISFIABILITY TREES [PDF]

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

Algorithmic Problems for Computation Trees

Logics
In 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