2519 search results - page 240 / 504 » Reasoning with Textual Cases |
173
click to vote
CADE
1994
Springer
15 years 10 months ago
1994
Springer
In this paper we investigate the concept of simple termination. A term rewriting system is called simply terminating if its termination can be proved by means of a simpli cation o...
175
click to vote
BIRTHDAY
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Loops and other unbound control structures constitute a major bottleneck in formal software verification, because correctness proofs over such control structures generall...
162
click to vote
AAAI
2007
15 years 9 months ago
2007
We explore a means to both model and reason about partial observability within the scope of constraintbased temporal reasoning. Prior studies of uncertainty in Temporal CSPs have ...
180
click to vote
BVAI
2007
Springer
15 years 8 months ago
2007
Springer
This paper presents the implementation of ARQ-PROP II, a limited-depth propositional reasoner, via the compilation of its specification into an exact formulation using the satyrus...
175
click to vote
DLOG
2003
15 years 8 months ago
2003
In this short position paper, the project of building intelligent business information infrastructure using semantic web, ontology, description logics, and other related knowledge...