Dependency Schemes in QBF Calculi: Semantics and Soundness

We study the parametrisation of QBF resolution calculi by dependency schemes. One of the main problems in this area is to understand for which dependency schemes the resulting calculi are sound. Towards this end we propose a semantic framework for variable independence based on ‘exhibition’ by QBF models, and use it to express a property of dependency schemes called full exhibition that is known to be sufficient for soundness in Q-resolution. Introducing a generalised form of the long-distance resolution rule, we propose a complete parametrisation of classical long-distance Q-resolution, and show that full exhibition remains sufficient for soundness. We demonstrate that our approach applies to the current research frontiers by proving that the reflexive resolution path dependency scheme is fully exhibited

Predictors of non-pharmacological intervention in patients with paroxysmal atrial fibrillation:Value of neuroticism

Background: Non-pharmacological intervention is gaining increasing popularity in the treatment of patients with paroxysmal atrial fibrillation. We sought to investigate which factors play a role in the choice for non-pharmacological intervention with a particular focus on neuroticism. Methods: The study group comprised 73 patients with paroxysmal atrial fibrillation (mean age 55 13 years, 50 males). On average, patients had a 3-year-history of one symptomatic paroxysm per week lasting 2 It. The degree of neuroticism was assessed using the short scale Eysenck Personality Questionnaire. Results: During a mean follow-up period of 7.0 +/- 0.6 years, 20 patients (27%) underwent a non-pharmacological intervention for atria] fibrillation including His bundle ablation (n=1), maze operation (n=4), DDDR-pacemaker (n=10), pulmonary vein ablation (n=5). Multivariate regression analysis showed that age <55 years (odds ratio 5.3, 95% CI 1.1-24.5), frequency of paroxysms of atrial fibrillation > 1 per week (odds ratio 5.9, 95% CI 1.2-28.5) and total number of anti-arrhythmic drugs (class I and III) used > 2 (odds ratio 3.4, 95% CI 1.6-6.9) were predictive of non-pharmacological intervention (all p <0.05). In contrast, the degree of neuroticism was similar in patients who underwent non-pharmacological intervention as opposed to patients who did not undergo non-pharmacological intervention (4.5 +/- 3.3 vs. 4.0 +/- 2.9, p = NS). Conclusions: On the basis of this small study, neuroticism would not appear to play an important role in the decision to perform a nonpharmacological intervention. Instead, the data indicate that younger patients with pharmacologically refractory atrial fibrillation more often undergo non-pharmacological intervention. (c) 2005 Elsevier Ireland Ltd. All rights reserved

Exploiting Resolution-based Representations for MaxSAT Solving

Most recent MaxSAT algorithms rely on a succession of calls to a SAT solver in order to find an optimal solution. In particular, several algorithms take advantage of the ability of SAT solvers to identify unsatisfiable subformulas. Usually, these MaxSAT algorithms perform better when small unsatisfiable subformulas are found early. However, this is not the case in many problem instances, since the whole formula is given to the SAT solver in each call. In this paper, we propose to partition the MaxSAT formula using a resolution-based graph representation. Partitions are then iteratively joined by using a proximity measure extracted from the graph representation of the formula. The algorithm ends when only one partition remains and the optimal solution is found. Experimental results show that this new approach further enhances a state of the art MaxSAT solver to optimally solve a larger set of industrial problem instances

DepQBF 6.0: A Search-Based QBF Solver Beyond Traditional QCDCL

We present the latest major release version 6.0 of the quantified Boolean formula (QBF) solver DepQBF, which is based on QCDCL. QCDCL is an extension of the conflict-driven clause learning (CDCL) paradigm implemented in state of the art propositional satisfiability (SAT) solvers. The Q-resolution calculus (QRES) is a QBF proof system which underlies QCDCL. QCDCL solvers can produce QRES proofs of QBFs in prenex conjunctive normal form (PCNF) as a byproduct of the solving process. In contrast to traditional QCDCL based on QRES, DepQBF 6.0 implements a variant of QCDCL which is based on a generalization of QRES. This generalization is due to a set of additional axioms and leaves the original Q-resolution rules unchanged. The generalization of QRES enables QCDCL to potentially produce exponentially shorter proofs than the traditional variant. We present an overview of the features implemented in DepQBF and report on experimental results which demonstrate the effectiveness of generalized QRES in QCDCL.Comment: 12 pages + appendix; to appear in the proceedings of CADE-26, LNCS, Springer, 201

Linking Ground, Space and Knowledge: The Role of Weather Forecasting in Pastoralists\u27 Decision-Making

Changing weather patterns and decreasing land availability continue to challenge the livelihood of the pastoralists in northern Tanzania. The increasing variability of expected rains has complicated livestock management, often jeopardizing household resilience. Drought Early Warning Systems are being set up to contribute to decision-making processes at national and international levels. Nevertheless, due to the large spatial- and temporal resolution of these systems and their high uncertainties, these systems have limited value at a pastoral household level. Therefore, this paper explores what type of weather and climate information is deemed valuable for pastoral households in Longido District, Tanzania. It is based on an ethnographic study, conducted over a period of four months. It explores what weather information would be useful, the necessary scale of desired information, the required lead time of communication and, lastly, the most effective method of communicating forecast information. Following on this data, the study assessed the status of remote sensing and weather forecast modelling, exploring the question, the desired weather information can be forecast with enough skill and at a scale that is relevant to pastoral households in Longido? The ECMWF weather model was used in the assessment, revealing some optimism and scepticism concerning the status of existing information and technologies. Technological recommendations include verification of rainfall data, further research on the rainfall threshold concept, and exploring the model skill of embedded models in Tanzania. At the level of implementation , recommendations include discussing the adverse impacts of actions taken based on the forecasts and forming an implementation advisory group, which includes a comprehensive breadth of stakeholders, such as knowledgeable community members, village leaders, traditional leaders and also professionals from the field of climate sciences, rangeland ecology and anthropology

QRAT+: Generalizing QRAT by a More Powerful QBF Redundancy Property

The QRAT (quantified resolution asymmetric tautology) proof system simulates virtually all inference rules applied in state of the art quantified Boolean formula (QBF) reasoning tools. It consists of rules to rewrite a QBF by adding and deleting clauses and universal literals that have a certain redundancy property. To check for this redundancy property in QRAT, propositional unit propagation (UP) is applied to the quantifier free, i.e., propositional part of the QBF. We generalize the redundancy property in the QRAT system by QBF specific UP (QUP). QUP extends UP by the universal reduction operation to eliminate universal literals from clauses. We apply QUP to an abstraction of the QBF where certain universal quantifiers are converted into existential ones. This way, we obtain a generalization of QRAT we call QRAT+. The redundancy property in QRAT+ based on QUP is more powerful than the one in QRAT based on UP. We report on proof theoretical improvements and experimental results to illustrate the benefits of QRAT+ for QBF preprocessing.Comment: preprint of a paper to be published at IJCAR 2018, LNCS, Springer, including appendi

Lifting QBF Resolution Calculi to DQBF

We examine the existing resolution systems for quantified Boolean formulas (QBF) and answer the question which of these calculi can be lifted to the more powerful Dependency QBFs (DQBF). An interesting picture emerges: While for QBF we have the strict chain of proof systems Q-Res < IR-calc < IRM-calc, the situation is quite different in DQBF. Q-Res and likewise universal resolution are too weak: they are not complete. IR-calc has the right strength: it is sound and complete. IRM-calc is too strong: it is not sound any more, and the same applies to long-distance resolution. Conceptually, we use the relation of DQBF to EPR and explain our new DQBF calculus based on IR-calc as a subsystem of first-order resolutio