4573 search results - page 229 / 915 » Automated Reasoning |
155
click to vote
DLOG
2007
15 years 9 months ago
2007
Abstract. Conjunctive query answering is an important DL reasoning task. Although this task is by now quite well-understood, tight complexity bounds for conjunctive query answering...
162
click to vote
CADE
2003
Springer
16 years 7 months ago
2003
Springer
Developing automatable methods for proving termination of term rewrite systems that resist traditional techniques based on simplification orders has become an active research area ...
164
click to vote
CADE
2001
Springer
16 years 7 months ago
2001
Springer
We propose the notion of rewriting modules in order to provide a structural and hierarchical approach of TRS. We define then relative dependency pairs built upon these modules whic...
158
click to vote
CADE
2008
Springer
16 years 7 months ago
2008
Springer
In this paper, we present a variant of the dependency pair method for analysing runtime complexities of term rewrite systems automatically. This method is easy to implement, but si...
171
click to vote
CADE
2007
Springer
16 years 7 months ago
2007
Springer
In this paper, a proof assistant, called SAD, is presented. SAD deals with mathematical texts that are formalized in the ForTheL language (brief description of which is also given)...