Results 1  10
of
648,025
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
A New Method for Solving Hard Satisfiability Problems
 AAAI
, 1992
"... We introduce a greedy local search procedure called GSAT for solving propositional satisfiability problems. Our experiments show that this procedure can be used to solve hard, randomly generated problems that are an order of magnitude larger than those that can be handled by more traditional approac ..."
Abstract

Cited by 734 (21 self)
 Add to MetaCart
discussed. GSAT is best viewed as a modelfinding procedure. Its good performance suggests that it may be advantageous to reformulate reasoning tasks that have traditionally been viewed as theoremproving problems as modelfinding tasks.
The Use of TheoremProving Techniques
 in Proc. 1968 ACM Conference , Las Vegas, QuestionAnswering Systems
, 1968
"... questionanswering systems ..."
An Open Approach to Concurrent TheoremProving
 Parallel Processing for Artificial Intelligence
, 1997
"... The purpose of this paper is twofold. Its main aim is to present an alternative mechanism for representing concurrent theoremproving activity which primarily relies upon massive parallelism and efficient broadcast communication. A secondary aim is to further motivate this model of concurrent theore ..."
Abstract

Cited by 22 (4 self)
 Add to MetaCart
The purpose of this paper is twofold. Its main aim is to present an alternative mechanism for representing concurrent theoremproving activity which primarily relies upon massive parallelism and efficient broadcast communication. A secondary aim is to further motivate this model of concurrent
A TheoremProving Approach to CLP
 Workshop Logische Programmierung
, 1995
"... This paper proposes a TheoremProving approach to Constraint Logic Programming, the ..."
Abstract

Cited by 8 (8 self)
 Add to MetaCart
This paper proposes a TheoremProving approach to Constraint Logic Programming, the
Application of theorem proving to problem solving
, 1969
"... This paper shows how an extension of the resolution proof procedure can be used to construct problem solutions. The extended proof procedure can solve problems involving state transformations. The paper explores several alternate problem representations and provides a discussion of solutions to samp ..."
Abstract

Cited by 267 (1 self)
 Add to MetaCart
to sample problems including the "Monkey and Bananas " puzzle and the 'Tower of Hanoi " puzzle. The paper exhibits solutions to these problems obtained by QA3, a computer program bused on these theoremproving methods. In addition, the paper shows how QA3 can write simple
TheoremProving for Discrete Temporal Logic
, 1998
"... This chapter considers theorem proving for discrete temporal logics. We are interested in deciding or at least enumerating the formulas of the logic which are valid, that is, are true in all circumstances. Most of the techniques for temporal theoremproving have been extensions for methods developed ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This chapter considers theorem proving for discrete temporal logics. We are interested in deciding or at least enumerating the formulas of the logic which are valid, that is, are true in all circumstances. Most of the techniques for temporal theoremproving have been extensions for methods
The Hungarian method for the assignment problem
 Naval Res. Logist. Quart
, 1955
"... Assuming that numerical scores are available for the performance of each of n persons on each of n jobs, the "assignment problem" is the quest for an assignment of persons to jobs so that the sum of the n scores so obtained is as large as possible. It is shown that ideas latent in the work ..."
Abstract

Cited by 1238 (0 self)
 Add to MetaCart
Assuming that numerical scores are available for the performance of each of n persons on each of n jobs, the "assignment problem" is the quest for an assignment of persons to jobs so that the sum of the n scores so obtained is as large as possible. It is shown that ideas latent
The Extended Linear Complementarity Problem
, 1993
"... We consider an extension of the horizontal linear complementarity problem, which we call the extended linear complementarity problem (XLCP). With the aid of a natural bilinear program, we establish various properties of this extended complementarity problem; these include the convexity of the biline ..."
Abstract

Cited by 776 (28 self)
 Add to MetaCart
We consider an extension of the horizontal linear complementarity problem, which we call the extended linear complementarity problem (XLCP). With the aid of a natural bilinear program, we establish various properties of this extended complementarity problem; these include the convexity
Results 1  10
of
648,025