ADVANCED SEARCH
Advanced Search
FEEDBACK
 Please provide us with feedback
Found 4 of 1,394,228
|
|
|
1
|
|
Computer understanding of mathematical proofs
Vesko Marinov
|
|
August 1977
|
|
IJCAI'77: Proceedings of the 5th international joint conference on Artificial intelligence - Volume 2
, Volume 2
|
|
Publisher: Morgan Kaufmann Publishers Inc.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 0 |
 |
|
Mathematical proofs constitute a mixture of formulas with a subset of natural language. They can be represented as a sequence of lines expressible in the symbolism of predicate calculus. The transition from step to step may depend on a series of logical ...
Keywords: automatic proof checking, automatic theorem proving, computer assisted instruction, proof understanding
|
|
2
|
|
Using interval arithmetic to prove that a set is path-connected
|
|
February 2006
|
|
Theoretical Computer Science
, Volume 351 Issue 1
|
|
Publisher: Elsevier Science Publishers Ltd.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 2 |
|
|
In this paper, we give a numerical algorithm able to prove whether a set S described by nonlinear inequalities is path-connected or not. To our knowledge, no other algorithm (numerical or symbolic) is able to deal with this type of problem. The proposed ...
Keywords: automatic proof, connected set, graph theory, interval arithmetic, set computation, topology
|
|
3
|
|
An elementary algorithm for the automatic derivation and proof of tensor product identities via computer algebra
|
|
August 2003
|
|
ISSAC '03: Proceedings of the 2003 international symposium on Symbolic and algebraic computation
|
Publisher: ACM
 Request Permissions
|
|
Full text available: |
 Pdf
(436.87 KB)
|
|
|
| Bibliometrics: Downloads (6 Weeks): 14, Downloads (12 Months): 42, Downloads (Overall): 346, Citation Count: 0 |
|
|
Tensor product identities in two variables are quite common in mathematics: Exponential, logarithmic, trigonometric, and hyperbolic functions all satisfy tensor product identities, and the binomial theorem is a familiar example of a tensor product identity ...
Keywords: Taylor interpolation, asymptotic splitting operator, automatic derivation, automatic proof, binormal forms, bivariate identities, characteristic cauchy problem, computer algebra, differential equations, dual asymptotic expansions, homogeneous hyperbolic eigenproblem, hyperbolic eigenfunction, lie groups, maple, symmetries, tensor products
|
|
4
|
|
Automatic Proofs of Properties of Simple C- - Modules
|
|
October 1999
|
|
ASE '99: Proceedings of the 14th IEEE international conference on Automated software engineering
|
|
Publisher: IEEE Computer Society
|
|
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 1 |
|
|
We address the problem of verifying automatically properties of modules written in the C-- language, a very simple imperative language. In this paper, we develop a framework for proving automatically properties of modules written in C--. Our approach ...
Keywords: Algebraic semantics, equational logic, inductive theorem proving, automatic proof
|
|
|
|
|
Adobe Acrobat
QuickTime
Windows Media Player
Real Player
Refine by Keywords
Save results to a Binder
Publisher Site