2490 search results - page 105 / 498 » Complexity of Contextual Reasoning |
149
click to vote
POPL
2012
ACM
13 years 12 months ago
2012
ACM
There has been great progress in recent years on developing effective techniques for reasoning about program equivalence in ML-like languages—that is, languages that combine fea...
127
click to vote
MPC
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. In this paper we explore the “for large enough” quantifier, also known as “all but finitely many”, which plays a central role in asymptotic reasoning, as used f...
164
click to vote
WISE
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Approximation has been identified as a potential way of reducing the complexity of logical reasoning. Here we explore approximation for speeding up instance retrieval in...
133
click to vote
CADE
2007
Springer
16 years 4 months ago
2007
Springer
Abstract. Automata-based decision procedures commonly achieve optimal complexity bounds. However, in practice, they are often outperformed by sub-optimal (but more local-search bas...
109
click to vote
KR
2000
Springer
15 years 8 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...