Computational Hardness of Validity in Probability Logic

Kuyper, Rutger

doi:10.1007/978-3-642-35722-0_18

Cited by 1 publication

(2 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For both X = E and X = F, finite ǫX-satisfiability is Σ 0 1 -definable for rational ǫ ∈ (0, 1) and any first order language. Proposition 3.5.5 (Kuyper inter-reduction [12]). Let…”

Section: Irrational ǫmentioning

confidence: 99%

“…Again, the proof for this theorem and the construction of the reduction function given in [12] carry over almost identically when we restrict our attention from "normally ǫE-valid" (validity over all probability models) to "finitely ǫE-valid" (validity over all finite probability models -which is equivalent to the validity over all finite models by (2.3.4)): the method of proof is the duplication of a given model a finite number of times, and this procedure preserves finiteness of ǫ-models. This observation remains true in considering countable ǫ-models.…”

Section: Irrational ǫmentioning

confidence: 99%

See 1 more Smart Citation

Computability of validity and satisfiability in probability logics over finite and countable models

Yang

2015

Journal of Applied Non-Classical Logics

View full text Add to dashboard Cite

The -logic (which is called E-logic in this paper) of Terwijn is a variant of first-order logic (FOL) with the same syntax in which the models are equipped with probability measures and the ∀x quantifier is interpreted as 'there exists a set A of measure ≥ 1 − such that for each x ∈ A, …'. Previously, Kuyper and Terwijn proved that the general satisfiability and validity problems for this logic are, i) for rational ∈ (0, 1), respectively 1 1 -complete and 1 1 -hard, and ii) for = 0, respectively decidable and 0 1 -complete. The adjective 'general' here means 'uniformly over all languages'. We extend these results in the scenario of finite models. In particular, we show that the problems of satisfiability and validity with respect to finite models in E-logic are, i) for rational ∈ (0, 1), respectively 0 1 -complete and 0 1 -complete, and ii) for = 0, respectively decidable and 0 1 -complete. Although partial results toward the countable case are also achieved, the computability of E-logic over countable models still remains largely unsolved. In addition, most of the results here and of Kuyper and Terwijn do not apply to individual languages with a finite number of unary predicates. Reducing this requirement continues to be a major point of research. On the positive side, we derive the decidability of the corresponding problems for monadic relational languages -equality-and function-free languages with finitely-many unary and arbitrarily-many nullary predicates. This result holds for all three of the unrestricted, countable, and finitemodel cases. Applications in computational learning theory (CLT), weighted graphs, and artificial neural networks (ANNs) are discussed in the context of these decidability and undecidability results.

show abstract

“…For both X = E and X = F, finite ǫX-satisfiability is Σ 0 1 -definable for rational ǫ ∈ (0, 1) and any first order language. Proposition 3.5.5 (Kuyper inter-reduction [12]). Let…”

Section: Irrational ǫmentioning

confidence: 99%

Section: Irrational ǫmentioning

confidence: 99%