A resolution theorem for algebraic domains

Authors:
Pascal Hitzler
Affiliations:
Dresden University of Technology, Dresden, Germany
Venue:
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Year:
2003

Citing 4
Cited 0

Domain theory

Handbook of logic in computer science (vol. 3)
A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)
Clausal logic and logic programming in algebraic domains

Information and Computation
Generalized metrics and uniquely determined logic programs

Theoretical Computer Science - Topology in computer science

Quantified Score

Hi-index	0.00

Visualization

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.