1544 search results - page 173 / 309 » Automated Evaluation of Description Logic Reasoning Systems |
152
click to vote
CADE
2009
Springer
16 years 7 months ago
2009
Springer
Current techniques and tools for automated termination analysis of term rewrite systems (TRSs) are already very powerful. However, they fail for algorithms whose termination is ess...
156
click to vote
CADE
2003
Springer
16 years 6 months ago
2003
Springer
This paper presents on-going researches on theoretical and practical issues of combining rewriting based automated theorem proving and user-guided proof development, with the stron...
165
click to vote
CL
2000
Springer
15 years 10 months ago
2000
Springer
In this paper, an algorithm for obtaining consistent answers to queries posed to inconsistent relational databases is presented. The algorith is proven to be sound, terminating and...
174
click to vote
LICS
1999
IEEE
15 years 10 months ago
1999
IEEE
Pitts and Stark have proposed the -calculus as a language for investigating the interaction of unique name generation and higher-order functions. They developed a sound model base...
181
click to vote
LPAR
2004
Springer
15 years 11 months ago
2004
Springer
Resolution-based calculi are among the most widely used calculi for theorem proving in first-order logic. Numerous refinements of resolution are nowadays available, such as e.g. ...