Add to ORKGWe present several classes of non-classical logics (many of which are practically relevant in knowledge representation) which can be translated into tractable and relatively simple fragments of classical logic. In this context, refinements of resolution can be often used successfully for automated theorem proving, and in many cases yield optimal decision procedures
We provide techniques to integrate resolution logic with equality into type theory. The results may...
In this paper we present a method for automated theorem proving in non-classical logics having as al...
This thesis focuses on implementation of resolution-based automatic theorem prover for propositional...
We present several classes of non-classical logics (many of which are practically relevant in knowle...
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 embed...
This paper is an overview of a variety of results, all centered around a common theme, namely embedd...
This paper is an overview of a variety of results, all centered around a common theme, namely embedd...
This talk reviews those efforts in automatic theorem proving, during the past few years, which have ...
The topic of this dissertation lies in the intersection of logic and computer science, and rests fi...
[Symbolic and algebraic manipulation]: Symbolic and algebraic algorithms—Theorem proving algorithms;...
. We give a brief overview of the first order classical logic component in the Gandalf family of res...
AbstractThis paper describes the study of some specific test problems in automated theorem proving. ...
Linear logic, introduced by J.-Y.Girard, is a refinement of classical logic providing means for cont...
In this paper we present a method for automated theorem proving in non-classical logics having as a...
We provide techniques to integrate resolution logic with equality into type theory. The results may...
In this paper we present a method for automated theorem proving in non-classical logics having as al...
This thesis focuses on implementation of resolution-based automatic theorem prover for propositional...
We present several classes of non-classical logics (many of which are practically relevant in knowle...
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 embed...
This paper is an overview of a variety of results, all centered around a common theme, namely embedd...
This paper is an overview of a variety of results, all centered around a common theme, namely embedd...
This talk reviews those efforts in automatic theorem proving, during the past few years, which have ...
The topic of this dissertation lies in the intersection of logic and computer science, and rests fi...
[Symbolic and algebraic manipulation]: Symbolic and algebraic algorithms—Theorem proving algorithms;...
. We give a brief overview of the first order classical logic component in the Gandalf family of res...
AbstractThis paper describes the study of some specific test problems in automated theorem proving. ...
Linear logic, introduced by J.-Y.Girard, is a refinement of classical logic providing means for cont...
In this paper we present a method for automated theorem proving in non-classical logics having as a...
We provide techniques to integrate resolution logic with equality into type theory. The results may...
In this paper we present a method for automated theorem proving in non-classical logics having as al...
This thesis focuses on implementation of resolution-based automatic theorem prover for propositional...