A Resolution Theorem for Algebraic Domains

Hitzler, Pascal

A Resolution Theorem for Algebraic Domains

Download BibTeX Cite

Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence. Pages 1339-1339.

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 domaintheoretic background.

Pascal Hitzler. 2003. A Resolution Theorem for Algebraic Domains. In Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, IJCAI-03. IJCAI, 1339–1339. https://ijcai.org/proceedings/2003/190

@inproceedings{ijcai2003p190,
  title     = {A Resolution Theorem for Algebraic Domains},
  author    = {Hitzler, Pascal},
  booktitle = {Proceedings of the Eighteenth International Joint Conference on
               Artificial Intelligence, {IJCAI-03}},
  publisher = {International Joint Conferences on Artificial Intelligence},
  editor    = {Georg Gottlob},
  pages     = {1339--1339},
  year      = {2003},
  url       = {https://ijcai.org/proceedings/2003/190},
}

TY  - CPAPER
TI  - A Resolution Theorem for Algebraic Domains
AU  - Hitzler, Pascal
T2  - Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, IJCAI-03
PB  - International Joint Conferences on Artificial Intelligence
PY  - 2003
SP  - 1339
EP  - 1339
UR  - https://ijcai.org/proceedings/2003/190
ER  -