A Resolution Theorem for Algebraic Domains
Abstract
W. C. Rounds and G.-Q. Zhang have recently proposed to study a form of resolution on algebraic domains [Rounds and Zhang, 2001]. This framework allows reasoning with knowledge which is hierarchically structured and forms a (suitable) domain, more precisely, a coherent algebraic cpo as studied in domain theory. In this paper, we give conditions under which a resolution theorem -- in a form underlying resolution-based logic programming systems -- can be obtained. The investigations bear potential for engineering new knowledge representation and reasoning systems on a firm domain-theoretic background.
Cite
Text
Hitzler. "A Resolution Theorem for Algebraic Domains." International Joint Conference on Artificial Intelligence, 2003.Markdown
[Hitzler. "A Resolution Theorem for Algebraic Domains." International Joint Conference on Artificial Intelligence, 2003.](https://mlanthology.org/ijcai/2003/hitzler2003ijcai-resolution/)BibTeX
@inproceedings{hitzler2003ijcai-resolution,
title = {{A Resolution Theorem for Algebraic Domains}},
author = {Hitzler, Pascal},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2003},
pages = {1339-1340},
url = {https://mlanthology.org/ijcai/2003/hitzler2003ijcai-resolution/}
}