Results 41 to 50 of about 6,500,790 (324)
Theory and Practice of Logic Programming, 2003 To appear in Special Issue of the Theory and Practice of Logic Programming Journal on Answer Set Programming ...
Vladimir Lifschitz, Esra Erdem
openaire +3 more sources
A Q‐Learning Algorithm to Solve the Two‐Player Zero‐Sum Game Problem for Nonlinear Systems
International Journal of Adaptive Control and Signal Processing, Volume 39, Issue 3, Page 566-581, March 2025.A Q‐learning algorithm to solve the two‐player zero‐sum game problem for nonlinear systems. ABSTRACT This paper deals with the two‐player zero‐sum game problem, which is a bounded L2$$ {L}_2 $$‐gain robust control problem. Finding an analytical solution to the complex Hamilton‐Jacobi‐Issacs (HJI) equation is a challenging task.
Afreen Islam +2 more
wiley +1 more source
Advanced Functional Materials, EarlyView.The PDEM‐based SIGPE provides a dynamic nanophase from Li+‐bridged molecular self‐association, enhancing electrochemical stability and facilitating uniform Li+ ion flux at the interface. This unique solvation structure results in a hetero species‐driven inorganic‐rich SEI and long‐term cycle stability, suggesting that a PFAS‐free Li+‐containing monomer
Susung Yun +5 more
wiley +1 more source
Detecting Malware Activities With MalpMiner: A Dynamic Analysis Approach
IEEE Access, 2023 Day by day, malware as a service becomes more popular and easy to acquire, thus allowing anyone to start an attack without any technical background, which in turn introduces challenges for detecting such attacks.
Mustafa F. Abdelwahed +2 more
doaj +1 more source
Logic frameworks for logic programs [PDF]
, 1994 We show how logical frameworks can provide a basis for logic program synthesis. With them, we may use first-order logic as a foundation to formalize and derive rules that constitute program development calculi. Derived rules may be in turn applied to synthesize logic programs using higher-order resolution during proof that programs meet their ...
openaire +4 more sources
Ultrasoft Iontronics: Stretchable Diodes Enabled by Ionically Conductive Bottlebrush Elastomers
Advanced Functional Materials, EarlyView.This work introduces a solvent‐free, ultrasoft, and stretchable ionic diode based on oppositely charged bottlebrush elastomers (BBEs). The BBE diode exhibits an ultralow Young's modulus (<23 kPa), a high rectification ratio of 46, and stretchability over 400%.
Xia Wu +6 more
wiley +1 more source
Transforming normal logic programs to constraint logic programs
Theoretical Computer Science, 1992 A normal logic program \(P\) is transformed to another \(P^ \omega\) by a bottom-up computation on the positive component of \(P\) while the negative counterpart is left untouched. The declarative semantics of \(P\) is given by the completion of \(P^ \omega\). The completed predicate definitions in \(P^ \omega\), if they do not contain local variables,
Peter J. Stuckey, Kanchana Kanchanasut
openaire +3 more sources
Advanced Functional Materials, EarlyView.An all‐in‐one analog AI accelerator is presented, enabling on‐chip training, weight retention, and long‐term inference acceleration. It leverages a BEOL‐integrated CMO/HfOx ReRAM array with low‐voltage operation (<1.5 V), multi‐bit capability over 32 states, low programming noise (10 nS), and near‐ideal weight transfer.
Donato Francesco Falcone +11 more
wiley +1 more source
Relational Parametricity and Separation Logic [PDF]
Logical Methods in Computer Science, 2008 Separation logic is a recent extension of Hoare logic for reasoning about programs with references to shared mutable data structures. In this paper, we provide a new interpretation of the logic for a programming language with higher types.
Lars Birkedal, Hongseok Yang
doaj +1 more source
Logic programs as specifications in the inductive verification of logic programs
Electronic Notes in Theoretical Computer Science, 2001 AbstractIn this paper we define a new verification method based on an assertion language able to express properties defined by the user through a logic program. We first apply the verification framework defined in [3] to derive sufficient inductive conditions to prove partial correctness.
Comini M, GORI, ROBERTA, Levi G.
openaire +4 more sources