#### Filter Results:

#### Publication Year

1977

2016

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

#### Data Set Used

Learn More

A common tool for proving the termination of programs is the <italic>well-founded set</italic>, a set ordered in such a way as to admit no infinite descending sequences. The basic approach is to find a <italic>termination function</italic> that maps the values of the program variables into some well-founded set, such that the value of the termination… (More)

1 I n t r o d u c t i o n Interest in the theory and applications of rewriting has been growing rapidly, as evidenced in part by four conference proceedings (including this one) To encourage and stimulate continued progress in this area, we have collected (with the help of colleagues) a number of problems that appear to us to be of interest and regarding… (More)

We propose a novel unsupervised method for separating out distinct authorial components of a document. In particular, we show that, given a book artificially " munged " from two thematically similar biblical books, we can separate out the two constituent books almost perfectly. This allows us to automatically recapitulate many conclusions reached by Bible… (More)

We propose a new algorithm for minimal unsatisfiable core extraction, based on a deeper exploration of resolution-refutation properties. We provide experimental results on formal verification benchmarks confirming that our algorithm finds smaller cores than suboptimal algorithms ; and that it runs faster than those algorithms that guarantee minimality of… (More)

We describe the design and implementation of a highly optimized, multithreaded algorithm for the propositional satisfiability problem. The algorithm is based on the Davis-Putnam-Logemann-Loveland sequential algorithm, but includes many of the optimization techniques introduced in recent years. We provide experimental results for the execution of the… (More)

Church's Thesis asserts that the only numeric functions that can be calculated by effective means are the recursive ones, which are the same, extensionally, as the Turing-computable numeric functions. The Abstract State Machine Theorem states that every classical algorithm is behaviorally equivalent to an abstract state machine. This theorem presupposes… (More)