Results 91 to 100 of about 44,520 (208)
The Complexity of Satisfiability for Sub-Boolean Fragments of ALC [PDF]
The standard reasoning problem, concept satisfiability, in the basic description logic ALC is PSPACE-complete, and it is EXPTIME-complete in the presence of unrestricted axioms.
Meier, Arne, Schneider, Thomas
core +1 more source
Perfect Matching Under Precedence Constraints
ABSTRACT In this article, we motivate and define variants of perfect matching under precedence constraints where a perfect matching is built incrementally and precedence constraints ensure that an edge may only be added to the matching if the edge's predecessor vertices have already been covered.
Christina Büsing, Corinna Mathwieser
wiley +1 more source
Generalized modal satisfiability
32 pages, 3 figures.
Edith Hemaspaandra +2 more
openaire +3 more sources
Compactness of first-order fuzzy logics
One of the nice properties of the first-order logic is the compactness of satisfiability. It state that a finitely satisfiable theory is satisfiable.
Khatami, Seyed Mohammad Amin
core
Generalized Satisfiability Problems via Operator Assignments
Schaefer introduced a framework for generalized satisfiability problems on the Boolean domain and characterized the computational complexity of such problems. We investigate an algebraization of Schaefer's framework in which the Fourier transform is used
A Acín +12 more
core +1 more source
Identification of Missing Knowledge in MBSE System Models Using Graph‐Based Machine Learning
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 +2 more
wiley +1 more source
Abstract The wave telescope is an analysis technique for multi‐point spacecraft data that estimates power spectra in reciprocal position space (k $k$‐space). It has been used to reveal the spatial properties of waves and fluctuations in space plasmas. Originally designed as an analysis tool for 4 spacecraft constellations, new multi‐scale missions such
L. Schulz +7 more
wiley +1 more source
Satisfiability at Microsoft [PDF]
Constraint satisfaction problems arise in many diverse areas including software and hardware verification, type inference, static program analysis, test-case generation, scheduling, planning and graph problems. These areas share a common trait, they include a core component using logical formulas for describing states and transformations between them ...
openaire +1 more source
An adaptive chance‐constrained hybrid SOCP‐Based ACOPF for coordinated optimisation of integrated source–grid–load–storage systems is presented. The coordinated optimisation of integrated source–grid–load–storage (SGLS) systems is challenged by renewable energy uncertainty, complex industrial load characteristics and stringent policy constraints ...
Mingyue He +6 more
wiley +1 more source
We present an exact quantum algorithm for solving the Exact Satisfiability problem, which belongs to the important NP-complete complexity class. The algorithm is based on an intuitive approach that can be divided into two parts: the first step consists ...
Salvatore Mandrà +2 more
doaj +1 more source

