Extending the Resolution Method with Sorts

@inproceedings{Weidenbach1993ExtendingTR,
  title={Extending the Resolution Method with Sorts},
  author={Christoph Weidenbach},
  booktitle={IJCAI},
  year={1993}
}
In this paper I extend the standard first-order resolution method with special reasoning mechanisms for sorts. Sorts are unary predicates. Literals built from unary predicates are called sort literals. Negative sort literals can be compiled into restrictions of the relevant variables to sorts or can be deleted if they fulfill special conditions. Positive sort literals define the sort-theory. Sorted unification exploits the sort restrictions of variables with respect to the sort theory. As… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 14 references

A sorted logic using dynamic sorts

C Weidenbach, Weidenbach
A sorted logic using dynamic sorts • 1991

Unification theory

Decision Support Systems • 1990

Computational aspects of an order sorted logic with term declarations

Schmidt-Schaub
Lecture Notes in Artificial Intelligence • 1989
View 2 Excerpts

Similar Papers

Loading similar papers…