Department of Information and Communication Technology, University of Agder, Grimstad, Norway. Department of Maritime Technology and Innovation, Vestfold University College, Horten, Norway. The ...

Recent decades have witnessed remarkable progress in the study of Boolean satisfiability – the problem of determining whether a given propositional formula can be satisfied – and its natural extension ...

Abstract: The Boolean Satisfiability Problem (SAT) is a computationally challenging and fundamental problem in computer science, with extensive applications in cryptography, artificial intelligence, ...

The shapes comprising the map of South America (used in Sec. IV-B in the article) were obtained from the CShapes 2.0 Dataset. In addition, we also imported the map of ...

Define the following logic terms and apply them to real-world problems: Describe the simple model checking algorithm and the theorem proving algorithms - forward chaining and resolution, what they ...

Abstract: This paper discusses how satisfiability solvers may be used to verify and synthesize discrete event supervisors as defined in the supervisory control theory. By using the supervisory control ...

NASA/ARLIS/University of Maryland QuICC Phase I Datasets VERSION v2025-07-31.1 This dataset is licensed under the Creative Commons Attribution 4.0 International ...

ABSTRACT: This paper presents an efficient genetic algorithm for solving multiobjective transportation problem, assignment, and transshipment Problems. The proposed approach integrates the merits of ...