Add to ORKGTwo inference rules are discussed in boolean ring based theorem proving, and linear strategy is developed. It is shown that both of them are complete for linear strategy. Moreover, by introducing a partial ordering on atoms, pseudo O-linear and O-linear strategies are presented. The former is complete, the latter, however, is complete for clausal theorem proving.This work is supported by the National Climbing Project Foundation of China
AbstractProof search in linear logic is known to be difficult: the provability of propositional line...
About 20 years ago, we proposed an innovative approach to data mining based on a blend of Boolean te...
AbstractA class of linear logic proof games is developed, each with a numeric score that depends on ...
AbstractA new method for first-order theorem proving based on the Boolean ring approach is proposed....
Linear logic, introduced by J.-Y.Girard, is a refinement of classical logic providing means for cont...
The concept of well-behaved inference rules is developed in first-order polynomial based theorem pro...
Introduction The Boolean ring or first-order polynomial based theorem proving began with the work o...
International audienceLinear rules have played an increasing role in structural proof theory in rece...
In this paper, we investigate automated proof construction in classical linear logic (CLL) by giving...
The concept of well-behaved inference rules is developed in first-order polynomial-based theorem pro...
Colloque avec actes et comité de lecture.After recalling more classical strategies used for automate...
This article presents a taxonomy of strategies for fully-automated general-purpose first-order theor...
In this paper, we propose an exponential multiplicative fragment of linear logic to encode and solve...
In this paper we present a new decision procedure for the satisfiability of Linear Arithmetic Logic ...
The problem of the automatic generation of logical consequences of a set of axioms is examined. The ...
AbstractProof search in linear logic is known to be difficult: the provability of propositional line...
About 20 years ago, we proposed an innovative approach to data mining based on a blend of Boolean te...
AbstractA class of linear logic proof games is developed, each with a numeric score that depends on ...
AbstractA new method for first-order theorem proving based on the Boolean ring approach is proposed....
Linear logic, introduced by J.-Y.Girard, is a refinement of classical logic providing means for cont...
The concept of well-behaved inference rules is developed in first-order polynomial based theorem pro...
Introduction The Boolean ring or first-order polynomial based theorem proving began with the work o...
International audienceLinear rules have played an increasing role in structural proof theory in rece...
In this paper, we investigate automated proof construction in classical linear logic (CLL) by giving...
The concept of well-behaved inference rules is developed in first-order polynomial-based theorem pro...
Colloque avec actes et comité de lecture.After recalling more classical strategies used for automate...
This article presents a taxonomy of strategies for fully-automated general-purpose first-order theor...
In this paper, we propose an exponential multiplicative fragment of linear logic to encode and solve...
In this paper we present a new decision procedure for the satisfiability of Linear Arithmetic Logic ...
The problem of the automatic generation of logical consequences of a set of axioms is examined. The ...
AbstractProof search in linear logic is known to be difficult: the provability of propositional line...
About 20 years ago, we proposed an innovative approach to data mining based on a blend of Boolean te...
AbstractA class of linear logic proof games is developed, each with a numeric score that depends on ...