Abstract. We present a verifiable symbolic definite integral table look-up: a system which matches a query, comprising a definite integral with parameters and side conditions, against an entry in a verifiable table and uses a call to a library of facts about the reals in the theorem prover PVS to aid in the transformation of the table entry into an answer. Our system is able to obtain correct answers in cases where standard techniques implemented in computer algebra systems fail. We present the full model of such a system as well as a description of our prototype implementation showing the efficacy of such a system: for example, the prototype is able to obtain correct answers in cases where computer algebra systems [CAS] do not. We extend u...
The seminar focused on satisfiability checking for combinations of first-order logic and subclasses ...
Symbolic Computation and Satisfiability Checking are viewed as individual research areas, but they s...
We present hidden verification as a means to make the power of computational logic available to user...
We present a verifiable symbolic definite integral table look-up: a system which matches a query, co...
We assess the current state of research in the application of computer aided formal reasoning to com...
We assess the current state of research in the application of computer aided formal reasoning to com...
We describe an interface between version 6 of the Maple computer algebra system with the PVS automat...
Computer Algebra Systems (CASs), such as Maple and Mathematica, are now widely used in both industry...
We describe an interface between version 6 of the Maple computer algebra system with the PVS automat...
International audienceFinding an elementary form for an antiderivative is often a difficult task, so...
In [2] we presented a Definite Integral Table Lookup (the DITLU) for parametric functions, including...
Symbolic integration deals with the evaluation of integrals in closed form. We present an overview o...
In this paper we describe an environment for reasoning about the reals which combines the rigour of ...
The computation of definite integrals presents one with a variety of choices. There are various meth...
AbstractWe present hidden verification as a means to make the power of computational logic available...
The seminar focused on satisfiability checking for combinations of first-order logic and subclasses ...
Symbolic Computation and Satisfiability Checking are viewed as individual research areas, but they s...
We present hidden verification as a means to make the power of computational logic available to user...
We present a verifiable symbolic definite integral table look-up: a system which matches a query, co...
We assess the current state of research in the application of computer aided formal reasoning to com...
We assess the current state of research in the application of computer aided formal reasoning to com...
We describe an interface between version 6 of the Maple computer algebra system with the PVS automat...
Computer Algebra Systems (CASs), such as Maple and Mathematica, are now widely used in both industry...
We describe an interface between version 6 of the Maple computer algebra system with the PVS automat...
International audienceFinding an elementary form for an antiderivative is often a difficult task, so...
In [2] we presented a Definite Integral Table Lookup (the DITLU) for parametric functions, including...
Symbolic integration deals with the evaluation of integrals in closed form. We present an overview o...
In this paper we describe an environment for reasoning about the reals which combines the rigour of ...
The computation of definite integrals presents one with a variety of choices. There are various meth...
AbstractWe present hidden verification as a means to make the power of computational logic available...
The seminar focused on satisfiability checking for combinations of first-order logic and subclasses ...
Symbolic Computation and Satisfiability Checking are viewed as individual research areas, but they s...
We present hidden verification as a means to make the power of computational logic available to user...