AAAAAA
Results:
1-19
|
Results: 19
Authors:
Dowek, G
Citation: G. Dowek, Automated theorem proving in first-order logic module: On the difference between type theory and set theory, LECT N A I, 1761, 2000, pp. 1-22
Authors:
Fitting, H
Citation: H. Fitting, Higher-order modal logic - A sketch, LECT N A I, 1761, 2000, pp. 23-38
Authors:
Kapur, D
Sivakumar, G
Citation: D. Kapur et G. Sivakumar, Proving associative-commutative termination using RPO-compatible orderings, LECT N A I, 1761, 2000, pp. 39-61
Authors:
Leitsch, A
Citation: A. Leitsch, Decision procedures and model building or how to improve logical information in automated deduction, LECT N A I, 1761, 2000, pp. 62-79
Authors:
Plaisted, DA
Zhu, YS
Citation: Da. Plaisted et Ys. Zhu, Replacement rules with definition detection, LECT N A I, 1761, 2000, pp. 80-94
Authors:
de la Tour, TB
Citation: Tb. De La Tour, On the complexity of finite sorted algebras, LECT N A I, 1761, 2000, pp. 95-108
Authors:
Cantone, D
Asmundo, MN
Citation: D. Cantone et Mn. Asmundo, A further and effective liberalization of the delta-rule in free variable semantic tableaux, LECT N A I, 1761, 2000, pp. 109-125
Authors:
Cantone, D
Zarba, CG
Citation: D. Cantone et Cg. Zarba, A new fast tableau-based decision procedure for an unquantified fragment of set theory, LECT N A I, 1761, 2000, pp. 126-136
Authors:
Dahn, I
Citation: I. Dahn, Interpretation of a mizar-like logic in first order logic, LECT N A I, 1761, 2000, pp. 137-151
Authors:
Demri, S
Gore, R
Citation: S. Demri et R. Gore, An O((n center dot log n)(3))-time transformation from Grz into decidable fragments of classical first-order logic, LECT N A I, 1761, 2000, pp. 152-166
Authors:
Fermuller, CG
Citation: Cg. Fermuller, Implicational completeness of signed resolution, LECT N A I, 1761, 2000, pp. 167-174
Authors:
Formisano, A
Omodeo, E
Citation: A. Formisano et E. Omodeo, An equational re-engineering of set theories, LECT N A I, 1761, 2000, pp. 175-190
Authors:
Hustadt, U
Schmidt, RA
Citation: U. Hustadt et Ra. Schmidt, Issues of decidability for description logics in the framework of resolution, LECT N A I, 1761, 2000, pp. 191-205
Authors:
Pichler, R
Citation: R. Pichler, Extending decidable clause classes via constraints, LECT N A I, 1761, 2000, pp. 206-220
Authors:
Pichler, R
Citation: R. Pichler, Completeness and redundancy in constrained clause logic, LECT N A I, 1761, 2000, pp. 221-235
Authors:
Pliuskeviciene, A
Citation: A. Pliuskeviciene, Effective properties of some first order intuitionistic modal logics, LECT N A I, 1761, 2000, pp. 236-250
Authors:
Rosu, G
Goguen, J
Citation: G. Rosu et J. Goguen, Hidden congruent deduction, LECT N A I, 1761, 2000, pp. 251-266
Authors:
Sofronie-Stokkermans, V
Citation: V. Sofronie-stokkermans, Resolution-based theorem proving for SHn-logics, LECT N A I, 1761, 2000, pp. 267-281
Authors:
Wirth, CP
Citation: Cp. Wirth, Full first-order sequent and tableau calculi with preservation of solutions and the liberalized delta-rule but without Skolemization, LECT N A I, 1761, 2000, pp. 282-297
Risultati:
1-19
|