2490 search results - page 38 / 498 » Complexity of Contextual Reasoning |
108
click to vote
IJCAI
1993
15 years 1 months ago
1993
Polynomial time complexity is the usual ‘threshold’ for distinguishing the tractable from the intractable and it may seem reasonable to adopt this notion of tractability in th...
LICS
2002
IEEE
15 years 4 months ago
2002
IEEE
We introduce three formal theories of increasing strength for linear algebra in order to study the complexity of the concepts needed to prove the basic theorems of the subject. We...
CADE
1992
Springer
15 years 4 months ago
1992
Springer
The ability to use a polynomial iterpretation to prove termination of a rewrite system naturally prompts the question as to what restriction on complexity this imposes. The main r...
122
click to vote
ESSLLI
2009
Springer
14 years 9 months ago
2009
Springer
This paper describes cdiprover3 a tool for proving termination of term rewrite systems by polynomial interpretations and context dependent interpretations. The methods used by cdip...
IJHCI
2008
14 years 12 months ago
2008
senting them at different levels of abstraction. This can make the analysis complex and unwieldy, requiring teams of analysts to manage it. A new approach to managing the complexit...