The complexity of resource-bounded first-order classical logic - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 1994

The complexity of resource-bounded first-order classical logic

Dates and versions

hal-03243514 , version 1 (31-05-2021)

Identifiers

Cite

Jean Goubault. The complexity of resource-bounded first-order classical logic. Annual Symposium on Theoretical Aspects of Computer Science, Feb 1994, Caen, France. pp.59-70, ⟨10.1007/3-540-57785-8_131⟩. ⟨hal-03243514⟩
8 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More