Add to ORKGWe 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 resolution rule for inference in such a clausal logic; we introduce a natural declarative semantics and a fixed-point semantics for disjunctive logic programs, and prove their equivalence; finally, we apply our results to give both a syntax and semantics for default logic in any coherent algebraic dcpo. Key Words: Domain theory and applications, logic programming, logics in artificial intelligence. 1
The paper proposes a new knowledge representation language, called�ÄÈ�, which extends disjunctive lo...
W.C. Rounds and G.-Q. Zhang have proposed to study a form of disjunctive logic programming generaliz...
We characterize the symmetric structure of Cousot's hierarchy of semantics in terms of a purely alge...
AbstractWe introduce a domain-theoretic foundation for disjunctive logic programming. This foundatio...
W.C. Rounds and G.-Q. Zhang have recently proposed to study a form of disjunctive logic programming ...
W.C. Rounds and G.-Q. Zhang have recently proposed to study a form of resolution on algebraic domain...
AbstractIn this paper, we propose an argumentation-based semantic framework, called DAS, for disjunc...
Earlier, we have proposed a logic, called priority logic [16, 18], where a theory consists of a coll...
In this paper we study the properties of the class of head-cycle-free extended disjunctive logic pro...
Covering the authors’ own state-of-the-art research results, Mathematical Aspects of Logic Programmi...
AbstractAbramsky, S., Domain theory in logical form, Annals of Pure and Applied Logic 51 (1991) 1–77...
This dissertation studies the logical aspects of domains as used in the denotational semantics of p...
Abstract. Curry and and Howard observed that ordinary propositional logic can also be viewed as a fu...
We develop a denotational, fully abstract semantics for constraint logic programming (clp) with resp...
Signed clausal forms offer a suitable logical framework for automated reasoning in multiple-valued l...
The paper proposes a new knowledge representation language, called�ÄÈ�, which extends disjunctive lo...
W.C. Rounds and G.-Q. Zhang have proposed to study a form of disjunctive logic programming generaliz...
We characterize the symmetric structure of Cousot's hierarchy of semantics in terms of a purely alge...
AbstractWe introduce a domain-theoretic foundation for disjunctive logic programming. This foundatio...
W.C. Rounds and G.-Q. Zhang have recently proposed to study a form of disjunctive logic programming ...
W.C. Rounds and G.-Q. Zhang have recently proposed to study a form of resolution on algebraic domain...
AbstractIn this paper, we propose an argumentation-based semantic framework, called DAS, for disjunc...
Earlier, we have proposed a logic, called priority logic [16, 18], where a theory consists of a coll...
In this paper we study the properties of the class of head-cycle-free extended disjunctive logic pro...
Covering the authors’ own state-of-the-art research results, Mathematical Aspects of Logic Programmi...
AbstractAbramsky, S., Domain theory in logical form, Annals of Pure and Applied Logic 51 (1991) 1–77...
This dissertation studies the logical aspects of domains as used in the denotational semantics of p...
Abstract. Curry and and Howard observed that ordinary propositional logic can also be viewed as a fu...
We develop a denotational, fully abstract semantics for constraint logic programming (clp) with resp...
Signed clausal forms offer a suitable logical framework for automated reasoning in multiple-valued l...
The paper proposes a new knowledge representation language, called�ÄÈ�, which extends disjunctive lo...
W.C. Rounds and G.-Q. Zhang have proposed to study a form of disjunctive logic programming generaliz...
We characterize the symmetric structure of Cousot's hierarchy of semantics in terms of a purely alge...