A Many-Sorted Calculus Based on Resolution and Paramodulation emphasizes the utilization of advantages and concepts of many-sorted logic for resolution and paramodulation based automated theorem proving.This book considers some first-order calculus that defines how theorems from given hypotheses by pure syntactic reasoning are obtained, shifting all the semantic and implicit argumentation to the syntactic and explicit level of formal first-order reasoning. This text discusses the efficiency of many-sorted reasoning, formal preliminaries for the RP- and ?RP-calculus, and many-sorted term rewri
A straightforward formulation of a mathematical problem is mostly not ad-equate for resolution theor...
This techreport presents two approaches to primitive equality treatment in higher-order (HO) automat...
We review the fundamental resolution-based methods for first-order theorem proving and present them ...
In this paper I extend the standard first-order resolution method with special reasoning mechanisms ...
We present a sound and complete calculus for an expressive sorted first-order logic. Sorts are exten...
In the currently known many-sorted logic, a variable ranging over a sort that does not exist in the ...
. In a learning theorem prover, formulas can be verified by reusing proofs of previously verified co...
We apply chaining techniques to automated theorem proving in many-valued logics. In particular, we s...
AbstractA general approach to automated theorem proving for all first-order finite-valued logics tha...
The introduction of sorts to first-order automated deduc-tion has brought greater conciseness of rep...
Abstract. The theory of abstract algebraic logic aims at drawing a strong bridge between logic and u...
The usage of sorts in first-order automated deduction has brought greater conciseness of representat...
Extending existing calculi by sorts is astrong means for improving the deductive power offirst-order...
The semantics of everyday language and the semanticsof its naive translation into classical first-or...
A comparative study on the complexity of various procedures for proving that a set of clauses is co...
A straightforward formulation of a mathematical problem is mostly not ad-equate for resolution theor...
This techreport presents two approaches to primitive equality treatment in higher-order (HO) automat...
We review the fundamental resolution-based methods for first-order theorem proving and present them ...
In this paper I extend the standard first-order resolution method with special reasoning mechanisms ...
We present a sound and complete calculus for an expressive sorted first-order logic. Sorts are exten...
In the currently known many-sorted logic, a variable ranging over a sort that does not exist in the ...
. In a learning theorem prover, formulas can be verified by reusing proofs of previously verified co...
We apply chaining techniques to automated theorem proving in many-valued logics. In particular, we s...
AbstractA general approach to automated theorem proving for all first-order finite-valued logics tha...
The introduction of sorts to first-order automated deduc-tion has brought greater conciseness of rep...
Abstract. The theory of abstract algebraic logic aims at drawing a strong bridge between logic and u...
The usage of sorts in first-order automated deduction has brought greater conciseness of representat...
Extending existing calculi by sorts is astrong means for improving the deductive power offirst-order...
The semantics of everyday language and the semanticsof its naive translation into classical first-or...
A comparative study on the complexity of various procedures for proving that a set of clauses is co...
A straightforward formulation of a mathematical problem is mostly not ad-equate for resolution theor...
This techreport presents two approaches to primitive equality treatment in higher-order (HO) automat...
We review the fundamental resolution-based methods for first-order theorem proving and present them ...
.png%3Fwidth%3D300&w=3840&q=75)
Add to ORKG