𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Tractability through symmetries in propositional calculus

✍ Scribed by Belaid Benhamou; Lakhdar Sais

Book ID
104989879
Publisher
Springer Netherlands
Year
1994
Tongue
English
Weight
861 KB
Volume
12
Category
Article
ISSN
0168-7433

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Tractability of cut-free Gentzen type pr
Tractability of cut-free Gentzen type propositional calculus with permutation inference
✍ Noriko H. Arai πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 902 KB

We present a new propositional calculus that has desirable natures with respect to both automatic reasoning and computational complexity: we introduce an inference rule, called permutation, into a cut-free Gentzen type propositional calculus. It allows us to obtain a system which (1) guarantees the

Tractability of Cut-free Gentzen-type pr
Tractability of Cut-free Gentzen-type propositional calculus with permutation inference II
✍ Noriko H. Arai πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 114 KB

In Arai (1996), we introduced a new inference rule called permutation to propositional calculus and showed that cut-free Gentzen system LK (GCNF) with permutation (1) satisΓΏes the feasible subformula property, and (2) proves pigeonhole principle and k-equipartition polynomially. In this paper, we su

Space Complexity in Propositional Calcul
Space Complexity in Propositional Calculus
✍ Alekhnovich, Michael; Ben-Sasson, Eli; Razborov, Alexander A.; Wigderson, Avi πŸ“‚ Article πŸ“… 2002 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 311 KB