The MVL theorem proving system

Authors:
Matthew L. Ginsberg
Affiliations:
-
Venue:
ACM SIGART Bulletin - Special issue on implemented knowledge representation and reasoning systems
Year:
1991

Citing 5
Cited 6

An assumption-based TMS

Artificial Intelligence
Controlling recursive inference

Artificial Intelligence
A practically efficient and almost linear unification algorithm

Artificial Intelligence
A circumscriptive theorem prover

Artificial Intelligence
Negative subgoals with free variables

Journal of Logic Programming

Solving equations with sequence variables and sequence functions

Journal of Symbolic Computation
Flat matching

Journal of Symbolic Computation
On the relation between Context and Sequence Unification

Journal of Symbolic Computation
Context Sequence Matching for XML

Electronic Notes in Theoretical Computer Science (ENTCS)
Sequence unification through currying

RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Matching with regular constraints

LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

The MVL theorem-proving system is an implementation of theoretical work currently under way at Stanford University. Theoretical progress made there is regularly included in MVL in order to ensure that the ideas developed theoretically can be tested experimentally as well.