Results 1  10
of
273,983
Caching and Lemmaizing in Model Elimination Theorem Provers
, 1992
"... Theorem provers based on model elimination have exhibited extremely high inference rates but have lacked a redundancy control mechanism such as subsumption. In this paper we report on work done to modify a model elimination theorem prover using two techniques, caching and lemmaizing, that have reduc ..."
Abstract

Cited by 52 (2 self)
 Add to MetaCart
Theorem provers based on model elimination have exhibited extremely high inference rates but have lacked a redundancy control mechanism such as subsumption. In this paper we report on work done to modify a model elimination theorem prover using two techniques, caching and lemmaizing, that have
An Elimination Theorem for Regular Behaviours with Integration
 LNCS 715
, 1993
"... This chapter deals with an extension of the process algebra ACP with rational time and integration. We determine a proper subdomain of the regular processes for which an elimination theorem holds, namely, for each pair of processes p0 ; p1 in this class there is a process q in this class such that p ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
This chapter deals with an extension of the process algebra ACP with rational time and integration. We determine a proper subdomain of the regular processes for which an elimination theorem holds, namely, for each pair of processes p0 ; p1 in this class there is a process q in this class
On Hopf algebras and the elimination theorem for free Lie algebras
, 1995
"... The elimination theorem for free Lie algebras, a general principle which describes the structure of a free Lie algebra in terms of free Lie subalgebras, has been recently used by E. Jurisich to prove that R. Borcherds’ “Monster Lie algebra ” has certain large free Lie subalgebras, illuminating part ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
The elimination theorem for free Lie algebras, a general principle which describes the structure of a free Lie algebra in terms of free Lie subalgebras, has been recently used by E. Jurisich to prove that R. Borcherds’ “Monster Lie algebra ” has certain large free Lie subalgebras, illuminating part
Theoretical and algorithmical optimization of the deadend elimination theorem
 In Paci®c Symposium in Biocomputing
, 1997
"... The deadend elimination theorem has proved to be a powerful method to reduce the theoretically accessible conformational space when modeling protein side chains by using a rotameric representation of possible conformations. In this work, theoretical details about variants to the original criterion ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
The deadend elimination theorem has proved to be a powerful method to reduce the theoretically accessible conformational space when modeling protein side chains by using a rotameric representation of possible conformations. In this work, theoretical details about variants to the original criterion
AN ELIMINATION THEOREM FOR MIXED REALINTEGER SYSTEMS
"... Abstract. An elimination result for mixed realinteger systems of linear equations is established, and used to give a short proof for an adaptation of Farkas’ Lemma by Köppe and Weismantel [4]. An extension of the elimination theorem to a quantifier elimination result is indicated. Let A be an m ..."
Abstract
 Add to MetaCart
Abstract. An elimination result for mixed realinteger systems of linear equations is established, and used to give a short proof for an adaptation of Farkas’ Lemma by Köppe and Weismantel [4]. An extension of the elimination theorem to a quantifier elimination result is indicated. Let A be an m
METEOR: Exploring Model Elimination Theorem Proving
 Journal of Automated Reasoning
, 1992
"... In this paper we describe the theorem prover METEOR which is a highperformance Model Elimination prover running in sequential, parallel and distributed computing environments. METEOR has a very high inference rate, but as is the case with better chessplaying programs speed alone is not suffici ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
In this paper we describe the theorem prover METEOR which is a highperformance Model Elimination prover running in sequential, parallel and distributed computing environments. METEOR has a very high inference rate, but as is the case with better chessplaying programs speed alone
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
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
273,983