Results 51 to 60 of about 38,933 (219)
Reasoning in the OWL 2 Full Ontology Language using First-Order Automated Theorem Proving
, 2011 OWL 2 has been standardized by the World Wide Web Consortium (W3C) as a family of ontology languages for the Semantic Web. The most expressive of these languages is OWL 2 Full, but to date no reasoner has been implemented for this language.
Schneider, Michael, Sutcliffe, Geoff
core +1 more source
Canadian Journal of Statistics, EarlyView.Abstract We establish the consistency and the asymptotic distribution of the least squares estimators of the coefficients of a subset vector autoregressive process with exogenous variables (VARX). Using a martingale central limit theorem, we derive the asymptotic normal distribution of the estimators. Diagnostic checking is discussed using kernel‐based
Pierre Duchesne +2 more
wiley +1 more source
Examples and CounterexamplesWe present an independently discovered Andrews–Curtis trivialization of the balanced trivial group presentation MS9(w∗)=〈a,b∣a−1b9ab−10,a−1b−1aba−1〉 obtained through automated theorem proving.
Alexei Lisitsa
doaj +1 more source
Converting ALC Connection Proofs into ALC Sequents [PDF]
Electronic Proceedings in Theoretical Computer Science, 2019 The connection method has earned good reputation in the area of automated theorem proving, due to its simplicity, efficiency and rational use of memory. This method has been applied recently in automatic provers that reason over ontologies written in the
Eunice Palmeira +2 more
doaj +1 more source
An open extensible tool environment for Event-B
, 2006 . We consider modelling indispensable for the development of complex systems. Modelling must be carried out in a formal notation to reason and make meaningful conjectures about a model. But formal modelling of complex systems is a difficult task.
A.D. Brucker +21 more
core +2 more sources
Clinical Pharmacology &Therapeutics, EarlyView.Traditional dosing strategies often rely on a “one‐size‐fits‐all” paradigm, assuming an “average” patient with typical demographic and pharmacological characteristics. In reality, this often overlooks existing between‐patient variability and can lead to suboptimal drug exposure or toxicity. This issue is especially pronounced in pediatric patients, who
Zachary L. Taylor +12 more
wiley +1 more source
Explaining the undecidability of first-order logic
Zagadnienia Filozoficzne w NauceTuring proved the unsolvability of the decision problem for first-order logic (Entscheidungsproblem) in his famous paper On Computable Numbers, with an Application to the Entscheidungsproblem.
Timm Lampert, Anderson Nakano
doaj +1 more source
Automation of Diagrammatic Proofs in Mathematics [PDF]
, 1996 Theorems in automated theorem proving are usually proved by logical formal proofs. However, there is a subset of problems which can also be proved in a more informal way by the use of geometric operations on diagrams, so called diagrammatic proofs ...
Bundy, Alan, Green, I., Jamnik, M.
core +1 more source
Artificial intelligence in preclinical epilepsy research: Current state, potential, and challenges
Epilepsia Open, EarlyView.Abstract Preclinical translational epilepsy research uses animal models to better understand the mechanisms underlying epilepsy and its comorbidities, as well as to analyze and develop potential treatments that may mitigate this neurological disorder and its associated conditions. Artificial intelligence (AI) has emerged as a transformative tool across
Jesús Servando Medel‐Matus +7 more
wiley +1 more source
On the calculus of positively constructed formulas for authomated theorem proving
Моделирование и анализ информационных систем, 2010 The paper deals with an expressive logic language LF and its calculus. Formulas of this language consist of some large-block structural elements, such as type quanti¯ers.
A. V. Davydov +2 more
doaj