Results 1  10
of
977,130
Natural Proofs
 Journal of Computer and System Sciences
, 1994
"... We introduce the notion of natural proof. We argue that the known proofs of lower bounds on the complexity of explicit Boolean functions in nonmonotone models fall within our definition of natural. We show based on a hardness assumption that natural proofs can't prove superpolynomial lower ..."
Abstract

Cited by 204 (6 self)
 Add to MetaCart
We introduce the notion of natural proof. We argue that the known proofs of lower bounds on the complexity of explicit Boolean functions in nonmonotone models fall within our definition of natural. We show based on a hardness assumption that natural proofs can't prove super
Almostnatural proofs
 In IEEE Symposium on Foundations of Computer Science (FOCS
, 2008
"... Razborov and Rudich have shown that socalled natural proofs are not useful for separating P from NP unless hard pseudorandom number generators do not exist. This famous result is widely regarded as a serious barrier to proving strong lower bounds in circuit complexity theory. By definition, a natur ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Razborov and Rudich have shown that socalled natural proofs are not useful for separating P from NP unless hard pseudorandom number generators do not exist. This famous result is widely regarded as a serious barrier to proving strong lower bounds in circuit complexity theory. By definition, a
Natural Proofs Versus Derandomization
"... We study connections between Natural Proofs, derandomization, and the problem of proving “weak” circuit lower bounds such as NEXP ⊂ TC 0, which are still wide open. Natural Proofs have three properties: they are constructive (an efficient algorithm A is embedded in them), have largeness (A accepts ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
We study connections between Natural Proofs, derandomization, and the problem of proving “weak” circuit lower bounds such as NEXP ⊂ TC 0, which are still wide open. Natural Proofs have three properties: they are constructive (an efficient algorithm A is embedded in them), have largeness (A accepts
Natural Proofs for Structure, Data, and Separation
"... We propose natural proofs for reasoning with programs that manipulate datastructures against specifications that describe the structure of the heap, the data stored within it, and separation and framing of substructures. Natural proofs are a subclass of proofs that are amenable to completely autom ..."
Abstract

Cited by 10 (3 self)
 Add to MetaCart
We propose natural proofs for reasoning with programs that manipulate datastructures against specifications that describe the structure of the heap, the data stored within it, and separation and framing of substructures. Natural proofs are a subclass of proofs that are amenable to completely
The fundamental properties of natural numbers
 Journal of Formalized Mathematics
, 1989
"... Summary. Some fundamental properties of addition, multiplication, order relations, exact division, the remainder, divisibility, the least common multiple, the greatest common divisor are presented. A proof of Euclid algorithm is also given. MML Identifier:NAT_1. WWW:http://mizar.org/JFM/Vol1/nat_1.h ..."
Abstract

Cited by 682 (76 self)
 Add to MetaCart
Summary. Some fundamental properties of addition, multiplication, order relations, exact division, the remainder, divisibility, the least common multiple, the greatest common divisor are presented. A proof of Euclid algorithm is also given. MML Identifier:NAT_1. WWW:http://mizar.org/JFM/Vol1/nat_1
StrategyProofness and Arrow’s Conditions: Existence and Correspondence Theorems for Voting Procedures and Social Welfare Functions
 J. Econ. Theory
, 1975
"... Consider a committee which must select one alternative from a set of three or more alternatives. Committee members each cast a ballot which the voting procedure counts. The voting procedure is strategyproof if it always induces every committee member to cast a ballot revealing his preference. I pro ..."
Abstract

Cited by 542 (0 self)
 Add to MetaCart
Consider a committee which must select one alternative from a set of three or more alternatives. Committee members each cast a ballot which the voting procedure counts. The voting procedure is strategyproof if it always induces every committee member to cast a ballot revealing his preference. I
Natural Proof Search and Proof Writing
, 2010
"... Abstract: Muscadet is a knowledgebased theorem prover based on natural deduction. Its results show its complementarity with regard to resolutionbased provers. This paper presents some Muscadet results and points out some of its characteristics. ..."
Abstract
 Add to MetaCart
Abstract: Muscadet is a knowledgebased theorem prover based on natural deduction. Its results show its complementarity with regard to resolutionbased provers. This paper presents some Muscadet results and points out some of its characteristics.
Basic objects in natural categories
 COGNITIVE PSYCHOLOGY
, 1976
"... Categorizations which humans make of the concrete world are not arbitrary but highly determined. In taxonomies of concrete objects, there is one level of abstraction at which the most basic category cuts are made. Basic categories are those which carry the most information, possess the highest categ ..."
Abstract

Cited by 856 (1 self)
 Add to MetaCart
Categorizations which humans make of the concrete world are not arbitrary but highly determined. In taxonomies of concrete objects, there is one level of abstraction at which the most basic category cuts are made. Basic categories are those which carry the most information, possess the highest category cue validity, and are, thus, the most differentiated from one another. The four experiments of Part I define basic objects by demonstrating that in taxonomies of common concrete nouns in English based on class inclusion, basic objects are the most inclusive categories whose members: (a) possess significant numbers of attributes in common, (b) have motor programs which are similar to one another, (c) have similar shapes, and (d) can be identified from averaged shapes of members of the class. The eight experiments of Part II explore implications of the structure of categories. Basic objects are shown to be the most inclusive categories for which a concrete image of the category as a whole can be formed, to be the first categorizations made during perception of the environment, to be the earliest categories sorted and earliest named by children, and to be the categories
Hierarchical correctness proofs for distributed algorithms
, 1987
"... Abstract: We introduce the inputoutput automaton, a simple but powerful model of computation in asynchronous distributed networks. With this model we are able to construct modular, hierarchical correctness proofs for distributed algorithms. We de ne this model, and give aninteresting example of how ..."
Abstract

Cited by 439 (66 self)
 Add to MetaCart
Abstract: We introduce the inputoutput automaton, a simple but powerful model of computation in asynchronous distributed networks. With this model we are able to construct modular, hierarchical correctness proofs for distributed algorithms. We de ne this model, and give aninteresting example
Results 1  10
of
977,130