550 search results - page 28 / 110 » Context Semantics, Linear Logic and Computational Complexity |
AMAI
2004
Springer
15 years 3 months ago
2004
Springer
In reasoning tasks involving logical formulas, high expressiveness is desirable, although it often leads to high computational complexity. We study a simple measure of expressiven...
CSL
2005
Springer
15 years 3 months ago
2005
Springer
We show that Csanky’s fast parallel algorithm for computing the characteristic polynomial of a matrix can be formalized in the logical theory LAP, and can be proved correct in LA...
CORR
2006
Springer
14 years 9 months ago
2006
Springer
This paper brings together two lines of research: implicit characterization of complexity classes by Linear Logic (LL) on the one hand, and computation over an arbitrary ring in t...
KR
2000
Springer
15 years 1 months ago
2000
Springer
Bondarenko et al. have recently proposed an extension of the argumentation-theoretic semantics of admissible and preferred arguments, originally proposed for logic programming onl...
TSD
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Rhetorical structuring is field approached mostly by research in natural language (pragmatic) interpretation. However, in natural language generation (NLG) the rhetorica...