We study full completeness and syntactical separability of MLL proof nets with the mix rule. The general method we use consists first in addressing the two questions in the less ...
Density elimination by substitutions is introduced as a uniform method for removing applications of the Takeuti-Titani density rule from proofs in firstorder hypersequent calculi....
We consider an extension of bi-intuitionistic logic with the traditional modalities , , and from tense logic Kt. Proof theoretically, this extension is obtained simply by extendin...
We present the architecture and design details of a logic database system that extends functionality in a number of ways. The system supports indefinite (non-Horn) facts in extens...
This work addresses the issue of prioritized reasoning in the context of logic programming. The case of preference conditions involving atoms is considered and a refinement of th...