4573 search results - page 808 / 915 » Automated Reasoning |
122
click to vote
CSL
2007
Springer
15 years 9 months ago
2007
Springer
In 1973, Parikh proved a speed-up theorem conjectured by G¨odel 37 years before: there exist arithmetical formulæ that are provable in first order arithmetic, but whose shorter ...
109
click to vote
CSL
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. Although Cai, F¨urer and Immerman have shown that fixedpoint logic with counting (IFP + C) does not express all polynomialtime properties of finite structures, there h...
106
click to vote
CSL
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. Sequent calculi usually provide a general deductive setting that uniformly embeds other proof-theoretical approaches, such as tableaux methods, resolution techniques, goa...
126
click to vote
CSL
2007
Springer
15 years 9 months ago
2007
Springer
Normal form bisimulation is a powerful theory of program equivalence, originally developed to characterize L´evy-Longo tree equivalence and Boehm tree equivalence. It has been ada...
124
click to vote
ECSQARU
2007
Springer
15 years 9 months ago
2007
Springer
In this paper we describe an approach to classifying objects in a domain where classifications are uncertain using a novel combination of argumentation and data mining. Classific...