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 ...

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 ...

Abstract: The emergence of quantum computing provides us the possibility of solving tasks that might take years classically in just a few minutes. For certain problems, quantum computing exhibits ...

Quantum annealing device has shown a great potential in solving discrete problems that are theoretically and empirically hard. Boolean Satisfiability (SAT) problem, determining if there is an ...

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 ...

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 ...

An illustration of a magnifying glass. An illustration of a magnifying glass.

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 ...