Results 81 to 90 of about 44,520 (208)
HyperLTL Satisfiability Is Highly Undecidable, HyperCTL$^*$ is Even Harder [PDF]
Logical Methods in Computer ScienceTemporal logics for the specification of information-flow properties are able to express relations between multiple executions of a system. The two most important such logics are HyperLTL and HyperCTL*, which generalise LTL and CTL* by trace ...
Marie Fortin +3 more
doaj +1 more source
The Connectivity of Boolean Satisfiability: Dichotomies for Formulas and Circuits [PDF]
, 2015 For Boolean satisfiability problems, the structure of the solution space is characterized by the solution graph, where the vertices are the solutions, and two solutions are connected iff they differ in exactly one variable.
Schwerdtfeger, Konrad W.
core
Efficient Mechanisms for Multi‐Asset Bilateral Trading
Journal of Public Economic Theory, Volume 28, Issue 2, April 2026.ABSTRACT We study when ex‐post efficient bilateral trade is possible under two‐sided asymmetric information with two agents and two assets, subject to balanced budget and voluntary participation constraints. We characterize how the interaction between asset characteristics and ownership structure determines the possibility of efficiency.
Nicolás Figueroa, Vasiliki Skreta
wiley +1 more source
International Journal of Robust and Nonlinear Control, Volume 36, Issue 5, Page 3047-3067, 25 March 2026.ABSTRACT This paper presents a robust control synthesis and analysis framework for nonlinear systems with uncertain initial conditions. First, a deep learning‐based lifting approach is proposed to approximate nonlinear dynamical systems with linear parameter‐varying (LPV) state‐space models in higher‐dimensional spaces while simultaneously ...
Sourav Sinha, Mazen Farhood
wiley +1 more source
Acta Informatica, 1990 A special case of the satisfiability problem, in which the clauses have a hierarchical structure, is shown to be solvable in linear time, assuming that the clauses have been represented in a convenient way.
openaire +2 more sources
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
Concurrency and Computation: Practice and Experience, Volume 38, Issue 5, March 2026.ABSTRACT Cyclic executives (CEs) offer the advantage of ensuring complete determinism with minimal runtime overhead, often making them the preferred choice for safety‐critical real‐time systems. However, generating CEs for multicore processors while addressing task precedence and exclusion relations presents significant challenges.
Bruno Nogueira +4 more
wiley +1 more source
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
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
SHACL Satisfiability and Containment [PDF]
, 2020 The Shapes Constraint Language (SHACL) is a recent W3C recommendation language for validating RDF data. Specifically, SHACL documents are collections of constraints that enforce particular shapes on an RDF graph. Previous work on the topic has provided theoretical and practical results for the validation problem, but did not consider the standard ...
Paolo Pareti +3 more
openaire +2 more sources