Efficient SAT encoding scheme for schedulability analysis of non-preemptive tasks on multiple computational resources

Mayank, Jaishree; Mondal, Arijit

doi:10.1016/j.sysarc.2020.101818

Cited by 2 publications

(1 citation statement)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The SAT problem is an interesting problem in computer science which is NP-complete ( Biere et al, 2009 ). Many studies concerning this area have been conducted ( Sohanghpurwala, Hassan & Athanas, 2017 ) where some of the studies do not only concern in the theoretical aspect but also in implementation and application ( Ojeda, 2023 ; Zha, Chang & Noda, 2022 ; Alonso, Sánchez & Sánchez-Rubio, 2022 ; Ramamoorthy & Jayagowri, 2021 ; Mayank & Mondal, 2020 ). Some algorithms and some SAT solvers have been developed to solve the SAT problem ( Fu et al, 2022 ; Berend, Golan & Twitto, 2022 ; Bian et al, 2020 ; Li et al, 2020 ; Molnár et al, 2020 ).…”

Section: Introductionmentioning

confidence: 99%

Non-redundant implicational base of formal context with constraints using SAT

Hidayat,

Ahmad,

Ngo

2024

PeerJ Computer Science

View full text Add to dashboard Cite

An implicational base is knowledge extracted from a formal context. The implicational base of a formal context consists of attribute implications which are sound, complete, and non-redundant regarding to the formal context. Non-redundant means that each attribute implication in the implication base cannot be inferred from the others. However, sometimes some attribute implications in the implication base can be inferred from the others together with a prior knowledge. Regarding knowledge discovery, such attribute implications should be not considered as new knowledge and ignored from the implicational base. In other words, such attribute implications are redundant based on prior knowledge. One sort of prior knowledge is a set of constraints that restricts some attributes in data. In formal context, constraints restrict some attributes of objects in the formal context. This article proposes a method to generate non-redundant implication base of a formal context with some constraints which restricting the formal context. In this case, non-redundant implicational base means that the implicational base does not contain all attribute implications which can be inferred from the others together with information of the constraints. This article also proposes a formulation to check the redundant attribute implications and encoding the problem into satisfiability (SAT) problem such that the problem can be solved by SAT Solver, a software which can solve a SAT problem. After implementation, an experiment shows that the proposed method is able to check the redundant attribute implication and generates a non-redundant implicational base of formal context with constraints.

show abstract