Results 1  10
of
992,863
Parallel cooperative propositional theorem proving
 Annals of Mathematics and Artificial Intelligence
, 1998
"... A parallel satis ability testing algorithm called Parallel Modoc is presented. Parallel Modoc is based on Modoc, which is based on propositional Model Elimination with an added capability to prune away certain branches that cannot lead to a successful subrefutation. The pruning information is encod ..."
Abstract

Cited by 13 (3 self)
 Add to MetaCart
A parallel satis ability testing algorithm called Parallel Modoc is presented. Parallel Modoc is based on Modoc, which is based on propositional Model Elimination with an added capability to prune away certain branches that cannot lead to a successful subrefutation. The pruning information
Parallel Cooperative Propositional Theorem Proving \Lambda
"... A parallel satisfiability testing algorithm called Parallel Modoc is presented. Parallel Modoc is based on Modoc, which is based on propositional Model Elimination with an added capability to prune away certain branches that cannot lead to a successful subrefutation. The pruning information is encod ..."
Abstract
 Add to MetaCart
A parallel satisfiability testing algorithm called Parallel Modoc is presented. Parallel Modoc is based on Modoc, which is based on propositional Model Elimination with an added capability to prune away certain branches that cannot lead to a successful subrefutation. The pruning information
Propositional Theorem Proving by Semantic Tree Trimming for Hardware Verification
, 1999
"... The present work describes a new algorithm for testing the satisfiability of statements in propositional logic. It was designed to efficiently handle the most obvious kinds of pathological cases for the DavisPutnam algorithm. Its performance is compared with a very efficient implementation of Davis ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The present work describes a new algorithm for testing the satisfiability of statements in propositional logic. It was designed to efficiently handle the most obvious kinds of pathological cases for the DavisPutnam algorithm. Its performance is compared with a very efficient implementation
The complexity of theoremproving procedures
 IN STOC
, 1971
"... It is shown that any recognition problem solved by a polynomial timebounded nondeterministic Turing machine can be “reduced” to the problem of determining whether a given propositional formula is a tautology. Here “reduced ” means, roughly speaking, that the first problem can be solved deterministi ..."
Abstract

Cited by 1057 (4 self)
 Add to MetaCart
It is shown that any recognition problem solved by a polynomial timebounded nondeterministic Turing machine can be “reduced” to the problem of determining whether a given propositional formula is a tautology. Here “reduced ” means, roughly speaking, that the first problem can be solved
Good News and Bad News: Representation Theorems and Applications
 Bell Journal of Economics
"... prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your personal, noncommercial use. Please contact the publisher regarding any further use of this work. Publisher contact information may be obtai ..."
Abstract

Cited by 684 (3 self)
 Add to MetaCart
prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your personal, noncommercial use. Please contact the publisher regarding any further use of this work. Publisher contact information may be obtained at
The Foundation of a Generic Theorem Prover
 Journal of Automated Reasoning
, 1989
"... Isabelle [28, 30] is an interactive theorem prover that supports a variety of logics. It represents rules as propositions (not as functions) and builds proofs by combining rules. These operations constitute a metalogic (or `logical framework') in which the objectlogics are formalized. Isabell ..."
Abstract

Cited by 471 (49 self)
 Add to MetaCart
Isabelle [28, 30] is an interactive theorem prover that supports a variety of logics. It represents rules as propositions (not as functions) and builds proofs by combining rules. These operations constitute a metalogic (or `logical framework') in which the objectlogics are formalized
Modular elliptic curves and Fermat’s Last Theorem
 ANNALS OF MATH
, 1995
"... When Andrew John Wiles was 10 years old, he read Eric Temple Bell’s The Last Problem and was so impressed by it that he decided that he would be the first person to prove Fermat’s Last Theorem. This theorem states that there are no nonzero integers a, b, c, n with n> 2 such that a n + b n = c n ..."
Abstract

Cited by 612 (1 self)
 Add to MetaCart
When Andrew John Wiles was 10 years old, he read Eric Temple Bell’s The Last Problem and was so impressed by it that he decided that he would be the first person to prove Fermat’s Last Theorem. This theorem states that there are no nonzero integers a, b, c, n with n> 2 such that a n + b n = c
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
prove three theorems. First, every strategyproof voting procedure is dictatorial. Second, this paper’s strategyproofness condition for voting procedures corresponds to Arrow’s rationality, independence of irrelevant alternatives, nonnegative response, and citizens ’ sovereignty conditions for social
Results 1  10
of
992,863