Symbol Elimination and Applications to Parametric Entailment Problems

Peuter, Dennis; Sofronie-Stokkermans, Viorica

doi:10.1007/978-3-030-86205-3_3

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2021

Publication Types

Select...

Other1

Book1

Relationship

Self Cite1

Independent1

Authors

Journals

Cited by 2 publications

(1 citation statement)

References 34 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This paper is an extended version of [37] which contains full proofs of the results, a more detailed description of the examples, a description of the systems we used for testing and several examples illustrating how these systems were used.…”

Section: Introductionmentioning

confidence: 99%

Symbol Elimination for Parametric Second-Order Entailment Problems (with Applications to Problems in Wireless Network Theory)

Peuter¹,

Marohn²,

Sofronie-Stokkermans³

2021

Preprint

Self Cite

View full text Add to dashboard Cite

We analyze possibilities of second-order quantifier elimination for formulae containing parameters -constants or functions. For this, we use a constraint resolution calculus obtained from specializing the hierarchical superposition calculus. If saturation terminates, we analyze possibilities of obtaining weakest constraints on parameters which guarantee satisfiability. If the saturation does not terminate, we identify situations in which finite representations of infinite saturated sets exist. We identify situations in which entailment between formulae expressed using second-order quantification can be effectively checked. We illustrate the ideas on a series of examples from wireless network research.

show abstract

Section: Introductionmentioning

confidence: 99%