446 search results - page 2 / 90 » A Theorem Prover for a Computational Logic |
CADE
1992
Springer
13 years 9 months ago
1992
Springer
Theorem provers based on model elimination have exhibited extremely high inference rates but have lacked a redundancy control mechanism such as subsumption. In this paper we repor...
KBSE
1998
IEEE
13 years 9 months ago
1998
IEEE
Starting from a graphical data model (a subset of the OMT object model), a skeleton of formal specification can be generated and completed to express several constraints and provi...
CADE
2010
Springer
13 years 6 months ago
2010
Springer
It has recently been shown that proofs in which some symbols are colored (e.g. local or split proofs and symbol-eliminating proofs) can be used for a number of applications, such a...
SARA
2007
Springer
13 years 11 months ago
2007
Springer
Relational databases have had great industrial success in computer science, their power evidenced by theoretical analysis and widespread adoption. Often, automated theorem provers...
TABLEAUX
2000
Springer
13 years 9 months ago
2000
Springer
mspass is an extension of the first-order theorem prover spass, which can be used as a modal logic theorem prover, a theorem prover for description logics and a theorem prover for ...