351 search results - page 17 / 71 » Classical proof forestry |
LPNMR
2007
Springer
14 years 1 months ago
2007
Springer
Recently, the stable model semantics was extended to the syntax of arbitrary propositional formulas, which are beyond the traditional rule form. Cabalar and Ferraris, as well as Ca...
RTA
2004
Springer
14 years 29 days ago
2004
Springer
We describe the system AProVE, an automated prover to verify (innermost) termination of term rewrite systems (TRSs). For this system, we have developed and implemented efficient al...
QUESTA
2007
13 years 7 months ago
2007
Recently, a state-dependent change of measure for simulating overflows in the two-node tandem queue was proposed by Dupuis et al. (Ann. Appl. Probab. 17(4):1306– 1346, 2007), to...
CSL
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. This paper is part of a general project of developing a systematic and algebraic proof theory for nonclassical logics. Generalizing our previous work on intuitionistic-su...
MFCS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We introduce a new general polynomial-time constructionthe fibre construction- which reduces any constraint satisfaction problem CSP(H) to the constraint satisfaction pr...