4573 search results - page 472 / 915 » Automated Reasoning |
183
click to vote
CADE
2009
Springer
16 years 6 months ago
2009
Springer
The dependency pair framework is a powerful technique for proving termination of rewrite systems. One of the most frequently used methods within the dependency pair framework is t...
140
click to vote
CADE
2008
Springer
16 years 6 months ago
2008
Springer
We consider proof systems for effectively propositional logic. First, we show that propositional resolution for effectively propositional logic may have exponentially longer refuta...
188
click to vote
CADE
2008
Springer
16 years 6 months ago
2008
Springer
Abstract. We introduce the notion of array-based system as a suittraction of infinite state systems such as broadcast protocols or sorting programs. By using a class of quantified-...
180
click to vote
CADE
2008
Springer
16 years 6 months ago
2008
Springer
Abstract. Conjunctive query answering plays a prominent role in applications of description logics (DLs) that involve instance data, but its exact complexity was a long-standing op...
146
click to vote
CADE
2008
Springer
16 years 6 months ago
2008
Springer
Abstract. This paper describes the translation of proofs in the Thousands of Solutions from Theorem Provers (TSTP) solution library to the Proof Markup Language (PML), and the subs...