scholarly journals Framework for Generating Configurable SAT Solvers

2011 ◽  
Vol 6 (1) ◽  
pp. 50-59
Author(s):  
Bernardo C. Vieira ◽  
Fabrício V. Andrade ◽  
Antônio O. Fernandes

The state-of-the-art SAT solvers usually share the same core techniques, for instance: the watched literals structure, conflict clause recording and non-chronological backtracking. Nevertheless, they might differ in the elimination of learnt clauses, as well as in the decision heuristic. This article presents a framework for generating configurable SAT solvers. The proposed framework is composed of the following components: a Base SAT Solver, a Perl Preprocessor, XML files (Solver Description and Heuristics Description files) to describe each heuristic as well as the set of heuristics that the generated solver uses. This solvers may use several techniques and heuristics such as those implemented in BerkMin, and in Equivalence Checking of Dissimilar Circuits, and also in Minisat. In order to demonstrate the effectiveness of the proposed framework, this article also presents three distinct SAT solver instances generated by the framework to address a complex and challenging industry problem: the Combinational Equivalence Checking problem (CEC).The first instance is a SAT solver that uses BerkMin and Dissimilar Circuits core techniques except the learnt clause elimination heuristic that has been adapted from Minisat; the second is another solver that combines BerkMin and Minisat decision heuristics at run-time; and the third is yet another SAT solver that changes the database reducing heuristic at run-time. The experiments demonstrate that the first SAT solver generated is a faster solver than state-of-the-art SAT solver BerkMin for several instances as well as for Minisat in almost every instance.

1989 ◽  
Vol 28 (04) ◽  
pp. 270-272 ◽  
Author(s):  
O. Rienhoff

Abstract:The state of the art is summarized showing many efforts but only few results which can serve as demonstration examples for developing countries. Education in health informatics in developing countries is still mainly dealing with the type of health informatics known from the industrialized world. Educational tools or curricula geared to the matter of development are rarely to be found. Some WHO activities suggest that it is time for a collaboration network to derive tools and curricula within the next decade.


10.29007/hvqt ◽  
2018 ◽  
Author(s):  
Gilles Audemard ◽  
Benoît Hoessen ◽  
Saïd Jabbour ◽  
Cédric Piette

Over the years, parallel SAT solving becomes more and more important. However, most of state-of-the-art parallel SAT solvers are portfolio-based ones. They aim at running several times the same solver with different parameters. In this paper, we propose a tool called Dolius, mainly based on the divide and conquer paradigm. In contrast to most current parallel efficient engines, Dolius does not need shared memory, can be distributed, and scales well when a large number of computing units is available. Furthermore, our tool contains an API allowing to plug any SAT solver in a simple way.


2020 ◽  
Vol 34 (07) ◽  
pp. 11612-11619
Author(s):  
Qinying Liu ◽  
Zilei Wang

Temporal action detection is a challenging task due to vagueness of action boundaries. To tackle this issue, we propose an end-to-end progressive boundary refinement network (PBRNet) in this paper. PBRNet belongs to the family of one-stage detectors and is equipped with three cascaded detection modules for localizing action boundary more and more precisely. Specifically, PBRNet mainly consists of coarse pyramidal detection, refined pyramidal detection, and fine-grained detection. The first two modules build two feature pyramids to perform the anchor-based detection, and the third one explores the frame-level features to refine the boundaries of each action instance. In the fined-grained detection module, three frame-level classification branches are proposed to augment the frame-level features and update the confidence scores of action instances. Evidently, PBRNet integrates the anchor-based and frame-level methods. We experimentally evaluate the proposed PBRNet and comprehensively investigate the effect of the main components. The results show PBRNet achieves the state-of-the-art detection performances on two popular benchmarks: THUMOS'14 and ActivityNet, and meanwhile possesses a high inference speed.


2022 ◽  
Vol 12 ◽  
Author(s):  
Marié P. Wissing

The positive psychology (PP) landscape is changing, and its initial identity is being challenged. Moving beyond the “third wave of PP,” two roads for future research and practice in well-being studies are discerned: The first is the state of the art PP trajectory that will (for the near future) continue as a scientific (sub)discipline in/next to psychology (because of its popular brand name). The second trajectory (main focus of this manuscript) links to pointers described as part of the so-called third wave of PP, which will be argued as actually being the beginning of a new domain of inter- or transdisciplinary well-being studies in its own right. It has a broader scope than the state of the art in PP, but is more delineated than in planetary well-being studies. It is in particular suitable to understand the complex nature of bio-psycho-social-ecological well-being, and to promote health and wellness in times of enormous challenges and changes. A unique cohering focus for this post-disciplinary well-being research domain is proposed. In both trajectories, future research will have to increase cognizance of metatheoretical assumptions, develop more encompassing theories to bridge the conceptual fragmentation in the field, and implement methodological reforms, while keeping context and the interwovenness of the various levels of the scientific text in mind. Opportunities are indicated to contribute to the discourse on the identity and development of scientific knowledge in mainstream positive psychology and the evolving post-disciplinary domain of well-being studies.


2015 ◽  
Vol 10 (S318) ◽  
pp. 16-27 ◽  
Author(s):  
Zoran Knežević

AbstractThe history of asteroid families, from their discovery back in 1918, until the present time, is briefly reviewed. Two threads have been followed: on the development of the theories of asteroid motion and the computation of proper elements, and on the methods of classification themselves. Three distinct periods can be distinguished: the first one until mid-1930s, devoted to discovery and first attempts towards understanding of the properties of families; the second one, until early 1980s, characterized by a growing understanding of their importance as key evidence of the collisional evolution; the third one, characterized by an explosion of work and results, comprises the contemporary era. An assessment is given of the state-of-the-art and possible directions for the future effort, focusing on the dynamical studies, and on improvements of classification methods to cope with ever increasing data set.


1999 ◽  
Vol 24 (3) ◽  
pp. 28-33 ◽  
Author(s):  
Jennifer J. Luntz

This paper provides an overview of the state of the art in consultation at the close of the third decade of its existence as a major form of delivering mental health services in the United States of America, and its somewhat later introduction in Victoria, Australia. Gallessich’s framework for consultation (1983, 1985), amongst others, is compared with the Victorian model. Issues raised include the need for consultants to understand the boundaries of consultation, its limitations, the state of its knowledge base and the uniquely Victorian contribution of a framework of several levels which enables an integration of the knowledge borrowed from a range of sources to assist in the improvement of its practice. A later paper to be published in ‘Children Australia’ looks at the steps in the consultation process.


2014 ◽  
Vol 50 ◽  
pp. 265-319 ◽  
Author(s):  
M. Suda

Property Directed Reachability (PDR) is a very promising recent method for deciding reachability in symbolically represented transition systems. While originally conceived as a model checking algorithm for hardware circuits, it has already been successfully applied in several other areas. This paper is the first investigation of PDR from the perspective of automated planning. Similarly to the planning as satisfiability paradigm, PDR draws its strength from internally employing an efficient SAT-solver. We show that most standard encoding schemes of planning into SAT can be directly used to turn PDR into a planning algorithm. As a non-obvious alternative, we propose to replace the SAT-solver inside PDR by a planning-specific procedure implementing the same interface. This SAT-solver free variant is not only more efficient, but offers additional insights and opportunities for further improvements. An experimental comparison to the state of the art planners finds it highly competitive, solving most problems on several domains.


Sign in / Sign up

Export Citation Format

Share Document