446 search results - page 43 / 90 » A Theorem Prover for a Computational Logic |
TPHOL
1996
IEEE
15 years 1 months ago
1996
IEEE
Nuprl and HOL are both tactic-based interactive theorem provers for higher-order logic, and both have been used in many substantial applications over the last decade. However, the ...
BIRTHDAY
1991
Springer
15 years 1 months ago
1991
Springer
The goal of the MKRP project is the development of a theorem prover which can be used as an inference engine in various applications, in particular it should be capable of proving ...
AI
2004
Springer
14 years 9 months ago
2004
Springer
We describe a logic-based AI architecture based on Brooks' subsumption architecture. In this architecture, we axiomatize different layers of control in First-Order Logic (FOL...
CIE
2008
Springer
14 years 11 months ago
2008
Springer
Approximate Herbrand theorems are established for first-order fuzzy logics based on continuous t-norms, and used to provide proof-theoretic proofs of Skolemization for their Prenex...
CADE
2007
Springer
15 years 10 months ago
2007
Springer
Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that combines 1) Boolean algebra of sets of uninterpreted elements (BA) and 2) Presburger arithmetic (PA). BA...