8 search results - page 1 / 2 » Density Elimination and Rational Completeness for First-Orde... |
95
Voted
LFCS
2007
Springer
15 years 6 months ago
2007
Springer
Density elimination by substitutions is introduced as a uniform method for removing applications of the Takeuti-Titani density rule from proofs in firstorder hypersequent calculi....
138
Voted
CADE
2005
Springer
16 years 22 days ago
2005
Springer
Two kinds of orderings are widely used in term rewriting and theorem proving, namely recursive path ordering (RPO) and Knuth-Bendix ordering (KBO). They provide powerful tools to p...
TCS
2008
15 years 10 days ago
2008
Density elimination, a close relative of cut elimination, consists of removing applications of the Takeuti-Titani density rule from derivations in Gentzen-style (hypersequent) cal...
112
Voted
CADE
1994
Springer
15 years 4 months ago
1994
Springer
Abstract. PROTEIN (PROver with a Theory Extension INterface) is a PTTPbased first order theorem prover over built-in theories. Besides various standardrefinements knownformodelelim...
189
Voted
ICDT
2009
ACM
16 years 1 months ago
2009
ACM
Marx and de Rijke have shown that the navigational core of the w3c XML query language XPath is not first-order complete ? that is it cannot express every query definable in firsto...