723 search results - page 9 / 145 » Reducing the complexity of the issue logic |
CORR
2002
Springer
13 years 7 months ago
2002
Springer
The Inductive Logic Programming community has considered proof-complexity and model-complexity, but, until recently, size-complexity has received little attention. Recently a chal...
CIE
2009
Springer
14 years 2 months ago
2009
Springer
Let Γ be a (not necessarily finite) structure with a finite relational signature. We prove that deciding whether a given existential positive sentence holds in Γ is in LOGSPACE...
FPL
2006
Springer
13 years 11 months ago
2006
Springer
This paper provides a realistic case study of using the previously introduced SIMPPL system architectural model, which fixes the physical interface and communication protocols bet...
TLCA
2009
Springer
14 years 2 months ago
2009
Springer
The straightforward elimination of union types is known to break subject reduction, and for some extensions of the lambda-calculus, to break strong normalization as well. Similarly...
ICCD
2000
IEEE
14 years 4 months ago
2000
IEEE
In superscalar architectures, out-of-order issue mechanisms increase performance by dynamically rescheduling instructions that cannot be statically reordered by the compiler. Whil...