Results 81 to 90 of about 44,054 (190)
Theorem proving for prenex G\"odel logic with Delta: checking validity and unsatisfiability [PDF]
Logical Methods in Computer Science, 2012 G\"odel logic with the projection operator Delta (G_Delta) is an important many-valued as well as intermediate logic. In contrast to classical logic, the validity and the satisfiability problems of G_Delta are not directly dual to each other.
Matthias Baaz +2 more
doaj +1 more source
Clustering in Hilbert space of a quantum optimization problem
, 2017 The solution space of many classical optimization problems breaks up into clusters which are extensively distant from one another in the Hamming metric.
Hsu, B. +4 more
core +1 more source
LOGIC, PRIMES AND COMPUTATION: A TALE OF UNREST
TASK Quarterly, 2005 The early connections between Mathematical Logic and Computer Science date back to the thirties and to the birth itself of modern Theoretical Computer Science, and concern computability.
STEFANO LEONESI, CARLO TOFFALORI
doaj
Complexity of the Guarded Two-Variable Fragment with Counting Quantifiers
, 2006 We show that the finite satisfiability problem for the guarded two-variable fragment with counting quantifiers is in EXPTIME. The method employed also yields a simple proof of a result recently obtained by Y.
Pratt-Hartmann, Ian
core +1 more source
Perfect Matching Under Precedence Constraints
Networks, Volume 87, Issue 2, Page 175-190, March 2026.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
Canonical Models and the Complexity of Modal Team Logic [PDF]
Logical Methods in Computer Science, 2019 We study modal team logic MTL, the team-semantical extension of modal logic ML closed under Boolean negation. Its fragments, such as modal dependence, independence, and inclusion logic, are well-understood.
Martin Lück
doaj +1 more source
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 +2 more
wiley +1 more source
Compactness of first-order fuzzy logics
, 2019 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
The Complexity of Satisfiability for Sub-Boolean Fragments of ALC [PDF]
, 2010 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
Journal of Geophysical Research: Space Physics, Volume 131, Issue 3, March 2026.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