A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Clausal Logic and Logic Programming in Algebraic Domains

2001
*
Information and Computation
*

We introduce a domain-theoretic foundation for disjunctive logic programming. This foundation is built on clausal logic, a representation of the Smyth powerdomain of any coherent algebraic dcpo. We establish the completeness of a resolutionrule for inferencein such a clausal logic; we introduce a natural declarative semantics and a xed-point semantics for disjunctive logic programs, and prove their equivalence; nally, we apply our results to give both a syntax and semantics for default logic in

doi:10.1006/inco.2001.3073
fatcat:k6gdk63x5remze6bguktcpqtty