Results 61 to 70 of about 1,182 (134)

Identification of Missing Knowledge in MBSE System Models Using Graph‐Based Machine Learning

Systems Engineering, Volume 29, Issue 2, Page 133-149, March 2026.
ABSTRACT The design and development of complex aerospace systems pose significant challenges due to their growing complexity. Iterative design processes, guided by formal specifications, strive to refine initially vague characteristics through multiple stages.
Esma Karagoz, Olivia J. Pinon Fischer, Dimitri Mavris   +2 more
wiley   +1 more source

On Relaxation Polytope of 3-satisfiability Problem

Моделирование и анализ информационных систем, 2007
The properties of a polytope associated with the 3-satisfiability problem are investigated. Particularly, we prove that values of its vertice coordinates can be represented by fractions with arbitrarily large denominators.
B. V. Uryvaev
doaj  

MAX-SAT Problem using Hybrid Harmony Search Algorithm

Journal of Intelligent Systems, 2018
Maximum Satisfiability problem is an optimization variant of the Satisfiability problem (SAT) denoted as MAX-SAT. The aim of this problem is to find Boolean variable assignment that maximizes the number of satisfied clauses in the Boolean formula.
Abu Doush Iyad, Quran Amal Lutfi, Al-Betar Mohammed Azmi, Awadallah Mohammed A.   +3 more
doaj   +1 more source

Runtime–Coherence Tradeoffs for Hybrid Satisfiability Solvers

IEEE Transactions on Quantum Engineering
Many search-based quantum algorithms that achieve a theoretical speedup are not practically relevant since they require extraordinarily long coherence times, or lack the parallelizability of their classical counterparts.
Vahideh Eshaghian, Soren Wilkening, Johan Aberg, David Gross   +3 more
doaj   +1 more source

Optimised ExpTime Tableaux for 𝒮ℋℐ𝒩 over Finite Residuated Lattices

Journal of Applied Mathematics, 2014
This study proposes to adopt a novel tableau reasoning algorithm for the description logic 𝒮ℋℐ𝒩 with semantics based on a finite residuated De Morgan lattice.
Jian Huang, Xinye Zhao, Jianxing Gong
doaj   +1 more source

Coalgebraic Satisfiability Checking for Arithmetic $\mu$-Calculi [PDF]

Logical Methods in Computer Science
The coalgebraic $\mu$-calculus provides a generic semantic framework for fixpoint logics over systems whose branching type goes beyond the standard relational setup, e.g. probabilistic, weighted, or game-based.
Daniel Hausmann, Lutz Schröder
doaj   +1 more source

A decision procedure for a sublanguage of set theory involving monotone additive and multiplicative functions, II. The multi-level case

Le Matematiche, 2005
MLSS is a decidable sublanguage of set theory involving the predicates membership, set equality, set inclusion, and the operators union, intersection, set difference, and singleton.In this paper we extend MLSS with constructs for expressing monotonicity,
Domenico Cantone, Calogero G. Zarba, Jacob T. Schwartz   +2 more
doaj  

Phase transitions of the typical algorithmic complexity of the random satisfiability problem studied with linear programming. [PDF]

PLoS One, 2019
Schawe H, Bleim R, Hartmann AK.
europepmc   +1 more source

FYalSAT: High-Throughput Stochastic Local Search K-SAT Solver on FPGA

IEEE Access
The satisfiability (SAT) problem is a fundamental challenge in computing and has a broad range of applications. This problem is NP-complete, and many algorithmic and architectural improvements have aimed at accelerating the SAT solver.
Young-Kyu Choi, Changsoo Kim
doaj   +1 more source

Algorithm for finding partitionings of hard variants of boolean satisfiability problem with application to inversion of some cryptographic functions. [PDF]

Springerplus, 2016
Semenov A, Zaikin O.
europepmc   +1 more source