Results 1  10
of
438
On Interpolation and Automatization for Frege Systems
, 2000
"... The interpolation method has been one of the main tools for proving lower bounds for propositional proof systems. Loosely speaking, if one can prove that a particular proof system has the feasible interpolation property, then a generic reduction can (usually) be applied to prove lower bounds for the ..."
Abstract

Cited by 52 (8 self)
 Add to MetaCart
, neither Frege nor TC 0 Frege has the feasible interpolation property. In order to carry out our argument, we show how to carry out proofs of many elementary axioms/theorems of arithmetic in polynomial size TC 0 Frege. As a corollary, we obtain that TC 0 Frege as well as any proof system
Strategies of Discourse Comprehension
, 1983
"... El Salvador, Guatemala is a, study in black and white. On the left is a collection of extreme MarxistLeninist groups led by what one diplomat calls “a pretty faceless bunch of people.’ ’ On the right is an entrenched elite that has dominated Central America’s most populous country since a CIAbacke ..."
Abstract

Cited by 601 (27 self)
 Add to MetaCart
El Salvador, Guatemala is a, study in black and white. On the left is a collection of extreme MarxistLeninist groups led by what one diplomat calls “a pretty faceless bunch of people.’ ’ On the right is an entrenched elite that has dominated Central America’s most populous country since a CIAbacked coup deposed the reformist government of Col. Jacobo Arbenz Guzmán in 1954. Moderates of the political center. embattled but alive in E1 Salvador, have virtually disappeared in Guatemalajoining more than 30.000 victims of terror over the last tifteen vears. “The situation in Guatemala is much more serious than in EI Salvador, ” declares one Latin American diplomat. “The oligarchy is that much more reactionary. and the choices are far fewer. “ ‘Zero’: The Guatemalan oligarchs hated Jimmy Carter for cutting off U.S. military aid in 1977 to protest humanrights abusesand the rightwingers hired marimba bands and set off firecrackers on the night Ronald Reagan was elected. They considered Reagan an ideological kinsman and believed they had a special
No Feasible Interpolation for TC 0 Frege Proofs
, 1997
"... The interpolation method has been one of the main tools for proving lower bounds for propositional proof systems. Loosely speaking, if one can prove that a particular proof system has the feasible interpolation property, then a generic reduction can (usually) be applied to prove lower bounds for the ..."
Abstract

Cited by 10 (4 self)
 Add to MetaCart
The interpolation method has been one of the main tools for proving lower bounds for propositional proof systems. Loosely speaking, if one can prove that a particular proof system has the feasible interpolation property, then a generic reduction can (usually) be applied to prove lower bounds
Frege systems for extensible modal logics
, 2006
"... By a wellknown result of Cook and Reckhow [4, 12], all Frege systems for the Classical Propositional Calculus (CPC) are polynomially equivalent. Mints and Kojevnikov [11] have recently shown pequivalence of Frege systems for the Intuitionistic Propositional Calculus (IPC) in the standard language, ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
By a wellknown result of Cook and Reckhow [4, 12], all Frege systems for the Classical Propositional Calculus (CPC) are polynomially equivalent. Mints and Kojevnikov [11] have recently shown pequivalence of Frege systems for the Intuitionistic Propositional Calculus (IPC) in the standard language
Nonautomatizability of boundeddepth Frege proofs
, 1999
"... In this paper, we show how to extend the argument due to Bonet, Pitassi and Raz to show that boundeddepth Frege proofs do not have feasible interpolation, assuming that factoring of Blum integers or computing the DiffieHellman function is sufficiently hard. It follows as a corollary that boundedde ..."
Abstract

Cited by 30 (8 self)
 Add to MetaCart
In this paper, we show how to extend the argument due to Bonet, Pitassi and Raz to show that boundeddepth Frege proofs do not have feasible interpolation, assuming that factoring of Blum integers or computing the DiffieHellman function is sufficiently hard. It follows as a corollary that bounded
Lower Bounds for Resolution and Cutting Plane Proofs and Monotone Computations
, 1997
"... We prove an exponential lower bound on the length of cutting plane proofs. The proof uses an extension of a lower bound for monotone circuits to circuits which compute with real numbers and use nondecreasing functions as gates. The latter result is of independent interest, since, in particular, i ..."
Abstract

Cited by 158 (6 self)
 Add to MetaCart
We prove an exponential lower bound on the length of cutting plane proofs. The proof uses an extension of a lower bound for monotone circuits to circuits which compute with real numbers and use nondecreasing functions as gates. The latter result is of independent interest, since, in particular, it implies an exponential lower bound for some arithmetic circuits.
Composition in distributional models of semantics
, 2010
"... Distributional models of semantics have proven themselves invaluable both in cognitive modelling of semantic phenomena and also in practical applications. For example, they have been used to model judgments of semantic similarity (McDonald, 2000) and association (Denhire and Lemaire, 2004; Griffit ..."
Abstract

Cited by 141 (3 self)
 Add to MetaCart
; Griffiths et al., 2007) and have been shown to achieve human level performance on synonymy tests (Landuaer and Dumais, 1997; Griffiths et al., 2007) such as those included in the Test of English as Foreign Language (TOEFL). This ability has been put to practical use in automatic thesaurus extraction
FEASIBLE DISJUNCTION PROPERTY AND FEASIBLE INTERPOLATION IN MODAL LOGIC
"... Abstract. We prove Feasible Disjunction Property for modal propositional logics K, K4, K4Grz, GL, T, S4, and S4Grz, by a uniform and simple proof based on modular modal sequent proof systems. We derive Feasible Interpolation Theorem for all the logics. Our results are weaker than Hrubeˇs’ obtained i ..."
Abstract
 Add to MetaCart
Abstract. We prove Feasible Disjunction Property for modal propositional logics K, K4, K4Grz, GL, T, S4, and S4Grz, by a uniform and simple proof based on modular modal sequent proof systems. We derive Feasible Interpolation Theorem for all the logics. Our results are weaker than Hrubeˇs’ obtained
Results 1  10
of
438