Title of article :
On the complexity of Boolean unification
Author/Authors :
Franz Baader، نويسنده ,
Issue Information :
دوهفته نامه با شماره پیاپی سال 1998
Pages :
6
From page :
215
To page :
220
Keywords :
computational complexity , Automatic theorem proving
Journal title :
Information Processing Letters
Serial Year :
1998
Journal title :
Information Processing Letters
Record number :
128941
Link To Document :
https://search.isc.ac/dl/search/defaultta.aspx?DTC=10&DC=128941
بازگشت