مرکز منطقه ای اطلاع رساني علوم و فناوري - 3-SAT = SAT for a class of normal modal logics

Title of article :

3-SAT = SAT for a class of normal modal logics

Author/Authors :

Stéphane Demri، نويسنده ,

Issue Information :

دوهفته نامه با شماره پیاپی سال 1995

Pages :

From page :

281

To page :

287

Keywords :

Modal clauses , computational complexity , Automatic theorem proving , Nonnal modal logics

Journal title :

Information Processing Letters

Serial Year :

1995

Journal title :

Information Processing Letters

Record number :

128272

Link To Document :