Results 91 to 100 of about 13,404,605 (326)
Synthesizing nested relational queries from implicit specifications: via model theory and via proof theory [PDF]
Logical Methods in Computer ScienceDerived datasets can be defined implicitly or explicitly. An implicit definition (of dataset O in terms of datasets I) is a logical specification involving two distinguished sets of relational symbols.
Michael Benedikt +2 more
doaj +1 more source
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective To describe long‐term outcomes after anti‐CD20 discontinuation in selected patients with secondary progressive multiple sclerosis (SPMS) who remained without subsequent disease‐modifying therapy (DMT). Methods We retrospectively analyzed data from four centers in Austria and Switzerland.
Ferdinand Otto +12 more
wiley +1 more source
Coherence in the Process of Legal Proof [PDF]
, 2014 The concept of coherence has long been thought to provide answers to a number of classical philosophical questions in metaphysics, epistemology and elsewhere.
Borg, Callum
core
Arthritis Care &Research, EarlyView.Systemic sclerosis (SSc) is a rare autoimmune disease defined by immune dysregulation, vasculopathy, and progressive fibrosis of the skin and internal organs. Despite advances in care, major complications such as interstitial lung disease (ILD) and myocardial involvement remain the leading causes of morbidity and mortality.
Cristiana Sieiro Santos +2 more
wiley +1 more source
Proof theory for tight apartness
2025 Acuerdos transformativos CRUE-CSIC con Springer Nature.The paper provides a cut-free sequent calculus for the theory of tight apartness in a language where both apartness and equality are primitive notions.
Maffezioli, Paolo
core +1 more source
Ideas for a high-level proof strategy language [PDF]
, 2010 Finding ways to prove theorems mechanically was one of the earliest challenges tackled by the AI community. Notable progress has been made but there is still always a limit to any set of heuristic search techniques.
Gudmund Grov +5 more
core
Proof theory and computational analysis
Electronic Notes in Theoretical Computer Science, 1997 In this survey paper we start with a discussion how functionals of finite type can be used for the proof-theoretic extraction of numerical data (e.g. effective<br />uniform bounds and rates of convergence) from non-constructive proofs in numerical analysis.
openaire +2 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
Observer‐Based Adaptive Event‐Triggered Tracking Control for Fuzzy TS Systems With Premise Mismatch
International Journal of Adaptive Control and Signal Processing, EarlyView.This paper presents an adaptive logistic event‐triggered observer‐based tracking controller for Takagi‐Sugeno fuzzy systems under constrained inputs and network delays. Leveraging a hybrid LMI and Secretary Bird Optimization approach, this strategy significantly minimizes communication overhead and computational burden while ensuring optimal reference ...
Oussama Djadane +3 more
wiley +1 more source
Coalition-proof supply function equilibria under capacity constraints [PDF]
, 2005 Whereas in the absence of capacity constraints the Cournot outcome is the unique coalition-proof supply function equilibrium outcome, the presence of capacity constraints may enlarge the set of equilibrium outcomes.
Delgado, Juan
core +1 more source