Violet

Authors:
Steve Greenbaum
Affiliations:
Hewlett-Packard Laboratories, 1501 Page Mill Road, MS 4A-D Palo Alto, CA 94304-1126, USA. e-mail: greenbaum@hpl.hp.com
Venue:
Journal of Automated Reasoning
Year:
1997

Citing 6
Cited 0

A Structure-preserving Clause Form Translation

Journal of Symbolic Computation
Efficiency and Completeness of the Set of Support Strategy in Theorem Proving

Journal of the ACM (JACM)
Artificial Intelligence Programming

Artificial Intelligence Programming
The CADE-13 ATP System Competition

Journal of Automated Reasoning
Otter - The CADE-13 Competition Incarnations

Journal of Automated Reasoning
Input transformations and resolution implementation techniques for theorem proving in first-order logic (clause form, discrimination networks, heuristic search, locking resolution)

Input transformations and resolution implementation techniques for theorem proving in first-order logic (clause form, discrimination networks, heuristic search, locking resolution)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Violet is an easy-to-use theorem prover based on locking resolution, with integrated equality extensions that use term rewriting and Knuth–Bendix completion. Violet participated in the CADE-13 ATP System Competition.