Results 31 to 40 of about 699,995 (283)
Quantifier-Free Interpolation of a Theory of Arrays [PDF]
Logical Methods in Computer Science, 2012 The use of interpolants in model checking is becoming an enabling technology to allow fast and robust verification of hardware and software. The application of encodings based on the theory of arrays, however, is limited by the impossibility of deriving ...
Roberto Bruttomesso +2 more
doaj +1 more source
Randomisation and Derandomisation in Descriptive Complexity Theory [PDF]
Logical Methods in Computer Science, 2011 We study probabilistic complexity classes and questions of derandomisation from a logical point of view. For each logic L we introduce a new logic BPL, bounded error probabilistic L, which is defined from L in a similar way as the complexity class BPP ...
Kord Eickmeyer, Martin Grohe
doaj +1 more source
Performance analysis of control allocation using data‐driven integral quadratic constraints
Advanced Control for Applications, Volume 4, Issue 4, December 2022., 2022 Abstract A new method is presented for evaluating the performance of a nonlinear control allocation system within a linear control loop. To that end, a worst‐case gain analysis problem is formulated that can be readily solved by means of well‐established methods from robustness analysis using integral quadratic constraints (IQCs).
Manuel Pusch +2 more
wiley +1 more source
Domain Representable Spaces Defined by Strictly Positive Induction [PDF]
Logical Methods in Computer Science, 2010 Recursive domain equations have natural solutions. In particular there are domains defined by strictly positive induction. The class of countably based domains gives a computability theory for possibly non-countably based topological spaces. A $ qcb_{0} $
Petter Kristian Køber
doaj +1 more source
Advanced Engineering Materials, EarlyView., 2023 The study presents the mechanical and in situ sensing performance of digital light processing‐enabled 2D lattice nanocomposites under monotonic tensile and repeated cyclic loading, and provides guidelines for the design of architectures suitable for strain sensors and smart lightweight structures.
Omar Waqas Saadi +3 more
wiley +1 more source
On Second-Order Monadic Monoidal and Groupoidal Quantifiers [PDF]
Logical Methods in Computer Science, 2010 We study logics defined in terms of second-order monadic monoidal and groupoidal quantifiers. These are generalized quantifiers defined by monoid and groupoid word-problems, equivalently, by regular and context-free languages.
Juha Kontinen, Heribert Vollmer
doaj +1 more source
Type-Theoretic Approaches to Ordinals [PDF]
Theoretical Computer Science, volume 957, issn 0304-3975, 2023, 2022 In a constructive setting, no concrete formulation of ordinal numbers can simultaneously have all the properties one might be interested in; for example, being able to calculate limits of sequences is constructively incompatible with deciding extensional equality.
arxiv +1 more source
A Variational Beam Model for Failure of Cellular and Truss‐Based Architected Materials
Advanced Engineering Materials, EarlyView., 2023 Herein, a versatile and efficient beam modeling framework is developed to predict the nonlinear response and failure of cellular, truss‐based, and woven architected materials. It enables the exploration of their design space and the optimization of their mechanical behavior in the nonlinear regime. A variational formulation of a beam model is presented
Konstantinos Karapiperis +3 more
wiley +1 more source
Deriving individual obligations from collective obligations [PDF]
, 2003 A collective obligation is an obligation directed to a group of agents so that the group, as a whole, is obliged to achieve a given task. The problem investigated here is the impact of collective obligations on individual obligations,i.e.
Cholvy, Laurence, Garion, Christophe
core +1 more source
The Complexity of Model Checking Higher-Order Fixpoint Logic [PDF]
Logical Methods in Computer Science, 2007 Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed \lambda-calculus and the modal \lambda-calculus. This makes it a highly expressive temporal logic that is capable of expressing various interesting correctness properties of programs that ...
Roland Axelsson +2 more
doaj +1 more source