Results 41 to 50 of about 39,214 (275)
Inductive Theorem Proving meets Dependency Pairs [PDF]
, 2010 Current techniques and tools for automated termination analysis of term rewrite systems (TRSs) are already very powerful. However, they fail for algorithms whose termination is essentially due to an inductive argument.
+4 more
core +1 more source
On Interpolation in Automated Theorem Proving
Journal of Automated Reasoning, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
BONACINA, Maria Paola, Moa Johansson
openaire +2 more sources
Rewrite Rules and Simplification of Matrix Expressions [PDF]
Computer Science Journal of Moldova, 1996 This paper concerns the automated simplification of expressions which involve non-commuting variables. The technology has been applied to the simplification of matrix and operator theory expressions which arise in engineering applications.
John J Wavrik
doaj
Robust Computer Algebra, Theorem Proving, and Oracle AI [PDF]
, 2017 In the context of superintelligent AI systems, the term "oracle" has two meanings. One refers to modular systems queried for domain-specific tasks. Another usage, referring to a class of systems which may be useful for addressing the value alignment and ...
Hay, Nick J., Sarma, Gopal P.
core +3 more sources
Current Tracking Adaptive Control of Brushless DC Motors
International Journal of Adaptive Control and Signal Processing, EarlyView.In this paper, the current tracking for Brushless Direct Current motors is approached considering uncertainty in the parameters of the motor's model. An adaptive control scheme to compensate electrical parameters uncertainty is proposed without requiring any knowledge of the mechanical parameters.
Fernanda Ramos‐García +3 more
wiley +1 more source
Advanced Functional Materials, EarlyView.Tabular foundation model interrogates the synthetic likelihood of metal−organic frameworks. Abstract Metal–organic frameworks (MOFs) are celebrated for their chemical and structural versatility, and in‑silico screening has significantly accelerated their discovery; yet most hypothetical MOFs (hMOFs) never reach the bench because their synthetic ...
Xiaoyu Wu +3 more
wiley +1 more source
Automatic Generation of Proof Tactics for Finite-Valued Logics [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 A number of flexible tactic-based logical frameworks are nowadays available that can implement a wide range of mathematical theories using a common higher-order metalanguage.
João Marcos
doaj +1 more source
A Perspective on Interactive Theorem Provers in Physics
Advanced Science, EarlyView.Into an interactive theorem provers (ITPs), one can write mathematical definitions, theorems and proofs, and the correctness of those results is automatically checked. This perspective goes over the best usage of ITPs within physics and motivates the open‐source community run project PhysLean, the aim of which is to be a library for digitalized physics
Joseph Tooby‐Smith
wiley +1 more source
Commutativity Theorems in Groups with Power-like Maps
Journal of Formalized Reasoning, 2019 There are several commutativity theorems in groups and rings which involve power maps f(x) = xn. The most famous example of this kind is Jacobson's theorem which asserts that any ring satisfying the identity xn = x is commutative.
Ranganathan Padmanabhan, Yang Zhang
doaj +1 more source
Adversarial Learning to Reason in an Arbitrary Logic
Proceedings of the International Florida Artificial Intelligence Research Society Conference, 2022 Existing approaches to learning to prove theorems focus on particular logics and datasets. In this work, we propose Monte-Carlo simulations guided by reinforcement learning that can work in an arbitrarily specified logic, without any human knowledge or ...
Stanisław Purgał, Cezary Kaliszyk
doaj +1 more source