Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

ISSAC
1990
Springer

favoriteEmaildiscussreport

83views Mathematics» more ISSAC 1990»

Resolution Proof Systems with Weak Transformation Rules

13 years 8 months ago

Resolution Proof Systems with Weak Transformation Rules

Download www.cs.helsinki.fi

In the previous papers [7-101we defined and explored a formal methodological framework on the basis of which resolution proof systems for strongly-finite logics can be introduced and studied. In the present paper we extend this approach to a wider class of the so-called resolution logics.

Zbigniew Stachniak

Real-time Traffic

Formal Methodological Framework | ISSAC 1990 | Mathematics | Resolution Proof Systems | So-called Resolution Logics |

claim paper

Related Content

» Lower Bounds for the Weak Pigeonhole Principle Beyond Resolution

» On the Automatizability of Resolution and Related Propositional Proof Systems

» Proof Output and Transformation for Disconnection Tableaux

» On extracting computations from propositional proofs a survey

» Proof Systems for Effectively Propositional Logic

» A Fixpoint Semantics of Event Systems With and Without Fairness Assumptions

» A Study of Proof Search Algorithms for Resolution and Polynomial Calculus

» Improved Lower Bounds for TreeLike Resolution over Linear Inequalities

» Automatic Parallelization and Optimization of Programs by Proof Rewriting

Post Info
More Details (n/a)

Added	11 Aug 2010
Updated	11 Aug 2010
Type	Conference
Year	1990
Where	ISSAC
Authors	Zbigniew Stachniak

Comments (0)