Non-elementary speed-up in proof length by structural clause form transformation

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 1994, Pages 213-219

  Baaz, Matthias ^a   Fermuller, Christian G ^a   Leitsch, Alexander ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; BOOLEAN ALGEBRA; COMPUTATIONAL COMPLEXITY; FORMAL LOGIC; MATHEMATICAL MODELS; MATHEMATICAL TRANSFORMATIONS;

FIRST ORDER FORMULAS; HERBRAND COMPLEXITY; PROOF LENGTH; PROPOSITIONAL RESOLUTION; REFUTATIONS; STRUCTURAL CLAUSE FORM TRANSFORMATION; STRUCTURAL TRANSLATIONS;

THEOREM PROVING;

EID: 0028094299     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (6)