AbstractThis paper describes the study of some specific test problems in automated theorem proving. It is shown how experimentation on relatively simple problems can lead to the development of techniques which prove successful on much more difficult problems. A number of enhancements to a resolution-based system obtained in this way are described
We study several procedures for theorem proving based on the resolution principle. We consider (1) D...
We present several classes of non-classical logics (many of which are practically relevant in know...
A resolution-based theorem prover (LRTP) has been built on the PROLOG/MTS system. The LRTP is design...
AbstractThis paper describes the study of some specific test problems in automated theorem proving. ...
We transform a user-friendly formulation of aproblem to a machine-friendly one exploiting the variab...
This paper summarizes the theoretical foundations and basic methodology of automated theorem-proving...
This talk reviews those efforts in automatic theorem proving, during the past few years, which have ...
This thesis focuses on implementation of resolution-based automatic theorem prover for propositional...
Interactive theorem provers can model complex systems, but require much e#ort to prove theorems. Re...
This paper is an overview of a variety of results, all centered around a common theme, namely embed...
Abstract. Interactive theorem provers can model complex systems, but require much effort to prove th...
This paper is an overview of a variety of results, all centered around a common theme, namely embedd...
We present several classes of non-classical logics (many of which are practically relevant in knowle...
This paper is an overview of a variety of results, all centered around a common theme, namely embedd...
We present several classes of non-classical logics (many of which are practically relevant in knowle...
We study several procedures for theorem proving based on the resolution principle. We consider (1) D...
We present several classes of non-classical logics (many of which are practically relevant in know...
A resolution-based theorem prover (LRTP) has been built on the PROLOG/MTS system. The LRTP is design...
AbstractThis paper describes the study of some specific test problems in automated theorem proving. ...
We transform a user-friendly formulation of aproblem to a machine-friendly one exploiting the variab...
This paper summarizes the theoretical foundations and basic methodology of automated theorem-proving...
This talk reviews those efforts in automatic theorem proving, during the past few years, which have ...
This thesis focuses on implementation of resolution-based automatic theorem prover for propositional...
Interactive theorem provers can model complex systems, but require much e#ort to prove theorems. Re...
This paper is an overview of a variety of results, all centered around a common theme, namely embed...
Abstract. Interactive theorem provers can model complex systems, but require much effort to prove th...
This paper is an overview of a variety of results, all centered around a common theme, namely embedd...
We present several classes of non-classical logics (many of which are practically relevant in knowle...
This paper is an overview of a variety of results, all centered around a common theme, namely embedd...
We present several classes of non-classical logics (many of which are practically relevant in knowle...
We study several procedures for theorem proving based on the resolution principle. We consider (1) D...
We present several classes of non-classical logics (many of which are practically relevant in know...
A resolution-based theorem prover (LRTP) has been built on the PROLOG/MTS system. The LRTP is design...
DOI
Add to ORKG