On Models for Quantified Boolean Formulas

Büning, Hans Kleine; Zhao, Xiaoning

doi:10.1007/978-3-540-25967-1_3

Cited by 17 publications

(24 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Solving 2QBF formulas is intrinsically more complex than SAT formulas (Σ P 2 -complete [15] instead of NP-complete) and 2QBF solvers are usually far from being as efficient as SAT solvers.…”

Section: Anti-alignments Between Two Netsmentioning

confidence: 99%

Anti-alignments in Conformance Checking – The Dark Side of Process Models

Chatain

Carmona

2016

Application and Theory of Petri Nets and Concurrency

View full text Add to dashboard Cite

Abstract. Conformance checking techniques asses the suitability of a process model in representing an underlying process, observed through a collection of real executions. These techniques suffer from the wellknown state space explosion problem, hence handling process models exhibiting large or even infinite state spaces remains a challenge. One important metric in conformance checking is to asses the precision of the model with respect to the observed executions, i.e., characterize the ability of the model to produce behavior unrelated to the one observed. By avoiding the computation of the full state space of a model, current techniques only provide estimations of the precision metric, which in some situations tend to be very optimistic, thus hiding real problems a process model may have. In this paper we present the notion of antialignment as a concept to help unveiling traces in the model that may deviate significantly from the observed behavior. Using anti-alignments, current estimations can be improved, e.g., in precision checking. We show how to express the problem of finding anti-alignments as the satisfiability of a Boolean formula, and provide a tool which can deal with large models efficiently.

show abstract

Section: Anti-alignments Between Two Netsmentioning

confidence: 99%

Anti-alignments in Conformance Checking – The Dark Side of Process Models

Chatain

Carmona

2016

Application and Theory of Petri Nets and Concurrency

View full text Add to dashboard Cite

show abstract

“…We recall the necessary background of Boolean logic and QBFs: for further details see also the survey of the theory of QBFs by Büning & Bubeck (2009).…”

Section: Background 21 Quantified Boolean Formulasmentioning

confidence: 99%

Reasoning in abstract dialectical frameworks using quantified Boolean formulas

Diller¹,

Wallner²,

Woltran³

2015

Argument & Computation

View full text Add to dashboard Cite

dialectical frameworks (ADFs) constitute a recent and powerful generalisation of Dung's argumentation frameworks (AFs), where the relationship between the arguments can be specified via Boolean formulas. Recent results have shown that this enhancement comes with the price of higher complexity compared to AFs. In fact, acceptance problems in the world of ADFs can be hard even for the third level of the polynomial hierarchy. In order to implement reasoning problems on ADFs, systems for quantified Boolean formulas (QBFs) thus are suitable engines to be employed. In this paper we give complexity sensitive QBF encodings of ADF problems generalising recent work on QBFs for AF labellings. Our encodings provide a uniform and modular way of translating reasoning in ADFs to QBFs, that can be used as the basis for novel systems for ADF reasoning.

show abstract

“…If Φ τ is true, however, then the formula (2) must be satisfiable for any such interpretations (cf. [17]). …”

Section: Abstraction Refinementmentioning

confidence: 99%

On Conflicts and Strategies in QBF

Bjørner¹,

Janota²,

Klieber³

EPiC Series in Computing

View full text Add to dashboard Cite

QBF solving techniques can be divided into the DPLL-based and expansion-based. In this paper we look at how these two techniques can be combined while using strategy extraction as a means of interaction between the two. Once propagation derives a conflict for one of the players, we analyse the proof of such and devise a strategy for the opponent. Subsequently, this strategy is used to constrain the losing player. The implemented prototype shows feasibility of the approach. A number of avenues for future research can be envisioned. Can strategies be employed in a different fashion? Can better strategy be constructed? Do the presented techniques generalize beyond QBF?

show abstract

On Models for Quantified Boolean Formulas

Cited by 17 publications

References 7 publications

Anti-alignments in Conformance Checking – The Dark Side of Process Models

Anti-alignments in Conformance Checking – The Dark Side of Process Models

Reasoning in abstract dialectical frameworks using quantified Boolean formulas

On Conflicts and Strategies in QBF

Contact Info

Product

Resources

About