How to Build Your Own ASP-based System?!

Answer Set Programming, or ASP for short, has become a popular and sophisticated approach to declarative problem solving. Its popularity is due to its attractive modeling-grounding-solving workflow that provides an easy approach to problem solving, even for laypersons outside computer science. However, in contrast to ASP’s ease of use, the high degree of sophistication of the underlying technology makes it even hard for ASP experts to put ideas into practice whenever this involves modifying ASP’s machinery. For addressing this issue, this tutorial aims at enabling users to build their own ASP-based systems. More precisely, we show how the ASP system clingo can be used for extending ASP and for implementing customized special-purpose systems. To this end, we propose two alternatives. We begin with a traditional AI technique and show how metaprogramming can be used for extending ASP. This is a rather light approach that relies on clingo’s reification feature to use ASP itself for expressing new functionalities. The second part of this tutorial uses traditional programming (in Python) for manipulating clingo via its application programming interface. This approach allows for changing and controlling the entire model-ground-solve workflow of ASP. Central to this is clingo’s new Application class that allows us to draw on clingo’s infrastructure by customizing processes similar to the one in clingo. For instance, we may apply manipulations to programs’ abstract syntax trees, control various forms of multi-shot solving, and set up theory propagators for foreign inferences. A cross-sectional structure, spanning meta as well as application programming, is clingo’s intermediate format, aspif, that specifies the interface among the underlying grounder and solver. We illustrate the aforementioned concepts and techniques throughout this tutorial by means of examples and several nontrivial case studies. In particular, we show how clingo can be extended by difference constraints and how guess-and-check programming can be implemented with both meta and application programming.

k-Submodular maximization with two kinds of constraints

[Formula: see text]-submodular maximization is a generalization of submodular maximization, which requires us to select [Formula: see text] disjoint subsets instead of one subset. Attracted by practical values and applications, we consider [Formula: see text]-submodular maximization with two kinds of constraints. For total size and individual size difference constraints, we present a [Formula: see text]-approximation algorithm for maximizing a nonnegative k-submodular function, running in time [Formula: see text] at worst. Specially, if [Formula: see text] is multiple of [Formula: see text], the approximation ratio can reduce to [Formula: see text], running in time [Formula: see text] at worst. Besides, this algorithm can be applied to [Formula: see text]-bisubmodular achieving [Formula: see text]-approximation running in time [Formula: see text]. Furthermore, if [Formula: see text] is multiple of 2, the approximation ratio can reduce to [Formula: see text], running in time [Formula: see text] at worst. For individual size constraint, there is a [Formula: see text]-approximation algorithm for maximizing a nonnegative [Formula: see text]-submodular function and an nonnegative [Formula: see text]-bisubmodular function, running in time [Formula: see text] and [Formula: see text] respectively, at worst.

Train Scheduling with Hybrid Answer Set Programming

We present a solution to real-world train scheduling problems, involving routing, scheduling, and optimization, based on Answer Set Programming (ASP). To this end, we pursue a hybrid approach that extends ASP with difference constraints to account for a fine-grained timing. More precisely, we exemplarily show how the hybrid ASP system clingo[DL] can be used to tackle demanding planning and scheduling problems. In particular, we investigate how to boost performance by combining distinct ASP solving techniques, such as approximations and heuristics, with preprocessing and encoding techniques for tackling large-scale, real-world train-scheduling instances.

Supercritical CO2 Brayton Cycle Design for Small Modular Reactor with a Thermodynamic Analysis Solver

Coupling supercritical carbon dioxide (S-CO2) Brayton cycle with Gen-IV reactor concepts could bring advantages of high compactness and efficiency. This study aims to design proper simple and recompression S-CO2 Brayton cycles working as the indirect cooling system for a mediate-temperature lead fast reactor and quantify the Brayton cycle performance with different heat rejection temperatures (from 32°C to 55°C) to investigate its potential use in different scenarios, like arid desert areas or areas with abundant water supply. High-efficiency S-CO2 Brayton cycle could offset the power conversion efficiency decrease caused by low core outlet temperature (which is 480°C in this study) and high compressor inlet temperature (which varies from 32°C to 55°C in this study). A thermodynamic analysis solver is developed to provide the analysis tool. The solver includes turbomachinery models for compressor and turbine and heat exchanger models for recuperator and precooler. The optimal design of simple Brayton cycle and recompression Brayton cycle for the lead fast reactor under water-cooled and dry-cooled conditions are carried out with consideration of recuperator temperature difference constraints and cycle efficiency. Optimal cycle efficiencies of 40.48% and 35.9% can be achieved for the recompression Brayton cycle and simple Brayton cycle under water-cooled condition. Optimal cycle efficiencies of 34.36% and 32.6% can be achieved for the recompression Brayton cycle and simple Brayton cycle under dry-cooled condition (compressor inlet temperature equals to 55°C). Increasing the dry cooling flow rate will be helpful to decrease the compressor inlet temperature. Every 5°C decrease in the compressor inlet temperature will bring 1.2% cycle efficiency increase for the recompression Brayton cycle and 0.7% cycle efficiency increase for the simple Brayton cycle. Helpful conclusions and advises are proposed for designing the Brayton cycle for mediate-temperature nuclear applications in this paper.

Description, Implementation, and Evaluation of a Generic Design for Tabled CLP

Logic programming with tabling and constraints (TCLP, tabled constraint logic programming) has been shown to be more expressive and in some cases more efficient than LP, CLP, or LP + tabling. Previous designs of TCLP systems did not fully use entailment to determine call/answer subsumption and did not provide a simple and well-documented interface to facilitate the integration of constraint solvers in existing tabling systems. We study the role of projection and entailment in the termination, soundness, and completeness of TCLP systems and present the design and an experimental evaluation of Mod TCLP, a framework that eases the integration of additional constraint solvers. Mod TCLP views constraint solvers as clients of the tabling system, which is generic w.r.t. the solver and only requires a clear interface from the latter. We validate our design by integrating four constraint solvers: a previously existing constraint solver for difference constraints, written in C; the standard versions of Holzbaur’s and , written in Prolog; and a new constraint solver for equations over finite lattices. We evaluate the performance of our framework in several benchmarks using the aforementioned solvers. Mod TCLP is developed in Ciao Prolog, a robust, mature, next-generation Prolog system.

PENGARUH KUALITAS PELAYANAN DAN PROMOSI TERHADAP PERLUASAN PANGSA PASAR PRODUK DANA TALANGAN HAJI DI BANK SYARIAH MANDIRI KCP UJUNGBERUNG DAN KCP RANCAEKEK BANDUNG

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.