scholarly journals A SAT-Based Decision Procedure for the Boolean Combination of Difference Constraints

Author(s):  
Alessandro Armando ◽  
Claudio Castellini ◽  
Enrico Giunchiglia ◽  
Marco Maratea
10.29007/drll ◽  
2018 ◽  
Author(s):  
Margus Veanes ◽  
Nikolaj Bjorner ◽  
Lev Nachmanson ◽  
Sergey Bereg

Monadic predicates play a prominent role in many decidable cases, including decision procedures for symbolic automata. We are here interested in discovering whether a formula can be rewritten into a Boolean combination of monadic predicates. Our setting is quantifier-free formulas over a decidable background theory, such as arithmetic and we here develop a semi-decision procedure for extracting a monadic decomposition of a formula when it exists.


2018 ◽  
Vol 2 (1) ◽  
pp. 1-15
Author(s):  
Intan Nurrachmi

This study departs from the hajj bailout financing facility which is a booming product because of the customer's interest, but in this case there is a difference in the target achievement between Bank Syariah Mandiri (BSM) Ujungberung KCP which is less successful in improving the hajj bailout products while the Rancaekek KCP is very superior in one consolidation Ahmad Yani Branch Office Bandung. This is what is interesting for researchers to carry out this research, the difference constraints include service quality and promotion factors. This phenomenon raises problems that must be examined, namely how the influence of service quality and promotion of market share expansion products hajj bailouts at Bank Syariah Mandiri KCP Ujungberung and KCP Rancaekek Bandung. This study aims academically to contribute in the study of Islamic economics in worksheets, especially the quality of service and promotion of market share expansion and practically expected to be able to provide input to all employees of BSM KCP Ujungberung regarding the quality of service and promotion of market expansion of bailout products. Hajj that has been successfully carried out by BSM KCP Rancaekek.The conclusion of this study is that there is a significant influence of service quality on the expansion of market share by 53.3% with a strong correlation of 0.730 and through t test, where t counts at 8.245 (> t table), then H_0 is rejected and H_i is accepted. Furthermore, there is a significant influence of promotion on the expansion of market share by 30.3% with a moderate / sufficient correlation of 0.550 through t test, where t counts is 4.219 (> t table), then H_ (0) is rejected and H_i is accepted. Then there is a significant influence of service quality and promotion simultaneously to the expansion of market share by 60.6% and a strong correlation of 0.784 and through Test F, where F count is 67.023 (> F table), then 〖H〗 _ ( 0) rejected and H_i accepted.


1998 ◽  
Author(s):  
Clark W. Barrett ◽  
David L. Dill ◽  
Jeremy R. Levitt

1992 ◽  
Vol 17 (3) ◽  
pp. 271-282
Author(s):  
Y.S. Ramakrishna ◽  
L.E. Moser ◽  
L.K. Dillon ◽  
P.M. Melliar-Smith ◽  
G. Kutty

We present an automata-theoretic decision procedure for Since/Until Temporal Logic (SUTL), a linear-time propositional temporal logic with strong non-strict since and until operators. The logic, which is intended for specifying and reasoning about computer systems, employs neither next nor previous operators. Such operators obstruct the use of hierarchical abstraction and refinement and make reasoning about concurrency difficult. A proof of the soundness and completeness of the decision procedure is given, and its complexity is analyzed.


1993 ◽  
Vol 18 (2-4) ◽  
pp. 163-182
Author(s):  
Alexander Leitsch

It is investigated, how semantic clash resolution can be used to decide some classes of clause sets. Because semantic clash resolution is complete, the termination of the resolution procedure on a class Γ gives a decision procedure for Γ. Besides generalizing earlier results we investigate the relation between termination and clause complexity. For this purpose we define the general concept of atom complexity measure and show some general results about termination in terms of such measures. Moreover, rather than using fixed resolution refinements we define an algorithmic generator for decision procedures, which constructs appropriate semantic refinements out of the syntactical structure of the clause sets. This method is applied to the Bernays – Schönfinkel class, where it gives an efficient (resolution) decision procedure.


2011 ◽  
Vol 20 (4) ◽  
pp. 747-756 ◽  
Author(s):  
J. Golinska-Pilarek ◽  
E. Munoz-Velasco ◽  
A. Mora-Bonilla

Sign in / Sign up

Export Citation Format

Share Document