Results 41 to 50 of about 27,177 (320)
Data‐Driven Distributed Safe Control Design for Multi‐Agent Systems
International Journal of Adaptive Control and Signal Processing, EarlyView.This paper presents a data‐driven control barrier function (CBF) technique for ensuring safe control of multi‐agent systems (MASs) with uncertain linear dynamics. A data‐driven quadratic programming (QP) optimization is first developed for CBF‐based safe control of single‐agent systems using a nonlinear controller. This approach is then extended to the
Marjan Khaledi, Bahare Kiumarsi
wiley +1 more source
Lietuvos Matematikos Rinkinys, 2013 We consider three sequent calculi for propositional linear temporal logic (PLTL) which allow us to formalize the properties of operator “always”. The main new results presented in the paper are: (1) introduction of the calculus with looping axioms; (2 ...
Romas Alonderis +1 more
doaj +1 more source
Bulletin of the Section of Logic, 2021 We examine the set of formula-to-formula valid inferences of Classical Logic, where the premise and the conclusion share at least a propositional variable in common. We review the fact, already proved in the literature, that such a system is identical to
Damian E. Szmuc
doaj +1 more source
Advanced Functional Materials, EarlyView.AI is transforming the research paradigm of battery materials and reshaping the entire landscape of battery technology. This comprehensive review summarizes the cutting‐edge applications of AI in the advancement of battery materials, underscores the critical challenges faced in harnessing the full potential of AI, and proposes strategic guidance for ...
Qingyun Hu +5 more
wiley +1 more source
Classical Combinatory Logic [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 Combinatory logic shows that bound variables can be eliminated without loss of expressiveness. It has applications both in the foundations of mathematics and in the implementation of functional programming languages.
Karim Nour
doaj +1 more source
Results on the Propositional µ-Calculus
DAIMI Report Series, 1982 We define a propositional version of the µ-calculus, and give an exponential-time decision procedure, small model property, and complete deductive system. We also show that it is strictly more expressive than PDL. Finally we give an algebraic semantics and prove a representation theorem.
openaire +3 more sources
Undecidable Iterative Propositional Calculus [PDF]
Algebra and Logic, 2016 In this paper, we consider iterative propositional calculi, which are finite sets of propositional formulas together with the rules of modus ponens and weak substitution (when formula being substituted must be already inferred). We construct an undecidable iterative propositional calculus using axioms in 3 variables.
openaire +3 more sources
Advanced Materials Interfaces, EarlyView.Zn–Sn–O thin films synthesized via ultrasonic spray pyrolysis reveal tunable phase evolution and enhanced acetone selectivity. Integrating DFT insights with machine learning predictions uncovers the role of stoichiometric control and oxygen vacancies in VOC sensing.
Kevin Rueda‐Castellanos +6 more
wiley +1 more source
A Couple of Novelties in the Propositional Calculus
Mathematical Logic Quarterly, 1985 It is often convenient to regard a dyadic operator as a 'Curried' monadic operator, in order to facilitate expression of its algebraic properties. Similarly, a triadic operator can be Curried to give a dyadic one; and when the resulting operator is expressed in infix form, its algebraic properties may be surprisingly elegant.
openaire +4 more sources
Approximating Propositional Calculi by Finite-valued Logics [PDF]
, 1994 The problem of approximating a propositional calculus is to find many-valued logics which are sound for the calculus (i.e., all theorems of the calculus are tautologies) with as few tautologies as possible.
Baaz, Matthias, Zach, Richard
core +1 more source