#### Filter Results:

#### Publication Year

1997

1999

#### Co-author

#### Key Phrase

#### Publication Venue

#### Data Set Used

Learn More

We propose a class of algorithms which gives best-efforts answers to problems in first-order logic given a bound on the resources available for reasoning. The algorithms in this class generate and attempt to solve S 1 and S 3 approximations to the input problem, then use the results to determine the most likely solution to the input problem. We show that an… (More)

In this paper, we present a partial instantiation theorem prover (INSTANT) which handles sentences in first-order logic in clausal or non-clausal form. INSTANT uses a variant of the GSAT algorithm for determining the satisfiabil-ity of a propositional sentence to increase its speed. The algorithm used in INSTANT can be parallelized with good speedup to… (More)

- ‹
- 1
- ›