Polynomial hierarchy graph properties in hybrid logic
نویسندگان
چکیده
منابع مشابه
Polynomial hierarchy graph properties in hybrid logic
In this article, we show that for each property of graphs G in the Polynomial Hierarchy (PH) there is a sequence φ1, φ2, . . . of formulas of the full hybrid logic which are satisfied exactly by the frames in G. Moreover, the size of φn is bounded by a polynomial in n. These results lead to the definition of syntactically defined fragments of hybrid logic whose model checking problem is complet...
متن کاملSoft Linear Logic and the Polynomial Hierarchy
In this paper we argue that Lafont’s system of Soft Linear Logic [3] is expressive enough to characterize any level of the Polynomial Hierarchy. This characterization is obtained using the existing additive connectives and does not require the introduction of new rules to SLL.
متن کاملCombinatorial Properties of a Rooted Graph Polynomial
For a rooted graph G, let EV (G; p) be the expected number of vertices reachable from the root when each edge has an independent probability p of operating successfully. We examine combinatorial properties of this polynomial, proving that G is k-edge connected iff EV ′(G; 1) = · · · = EV k−1(G; 1) = 0. We find bounds on the first and second derivatives of EV (G; p); applications yield character...
متن کاملRecognizing Graph Theoretic Properties with Polynomial Ideals
Many hard combinatorial problems can be modeled by a system of polynomial equations. N. Alon coined the term polynomial method to describe the use of nonlinear polynomials when solving combinatorial problems. We continue the exploration of the polynomial method and show how the algorithmic theory of polynomial ideals can be used to detect k-colorability, unique Hamiltonicity, and automorphism r...
متن کاملMinimal Polynomial Logic: Properties and Extensions
Minimal Polynomial Logic (MPL) is a generalisation of classical propositional logic which allows truth values in the continuous interval 0; 1] and in which propositions are represented by multi-variate polynomials. In previous work 7] we have introduced some properties of MPL and shown that it has two possible semantics: a) it can be considered as a logic for expressing, handling and computing ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2014
ISSN: 0022-0000
DOI: 10.1016/j.jcss.2014.04.003