Disjunctive Logic Program = Horn Program + Control Program Disjunctive Logic Program = Horn Program + Control Program
نویسندگان
چکیده
This paper presents an alternative view on propositional dis-junctive logic program: Disjunctive program = Control program + Horn program. For this we introduce a program transformation which transforms a disjunctive logic program into a Horn program and a so called control program. The control program consists of only disjunctions of new propositional atoms and controls the \execution" of the Horn program. The relationship between original and transformed programs is established by using circumscription. Based on this relationship a new minimal model reasoning approach is developed. Due to the transformation it is straightforward to incorporate SLD-resolution into the proof procedure.
منابع مشابه
Disjunctive Logic Program = Horn Program + Control Program
This paper presents an alternative view on propo-sitional disjunctive logic program: Disjunctive program = Control program + Horn program. For this we introduce a program transformation which transforms a disjunctive logic program into a Horn program and a so called control program. The control program consists of only disjunctions of new proposi-tional atoms and controls the \execution" of the...
متن کاملCH-Prolog: A Proof Procedure for Positive Disjunctive Logic Programming
The suc’ce.~ of Prolog motivat~ people to use full firstorder logic: instead of only Horn clauses as the b~is of logic programming. One of the main work in this extending is to seek proof procedure for new logic progrannning. Positive disjunctive logic programming extends Horn clause progrvanming by allowing more than one atoms re occur in the head o/’a program clause. In this paper we propose ...
متن کاملA Tree Construction of the Preferable Answer Sets for Prioritized Basic Disjunctive Logic Programs
One of the most important works in the investigation of logic programming is to define the semantics of the logic programs and to find the preferable answer set of them. There are so far three methods can be used to establish the semantics of the logic programs, i.e., the means of model, fixpoint and proof theory. According to the form of the rules contained in a logic program, different logic ...
متن کاملTree{Based Fixpoint Iteration for Disjunctive Logic Programs
Non{Horn programs containing disjunctive rules allow for more advanced applications of deductive databases. But the inference process dealing with rapidly increasing amounts of disjunctive facts becomes much more intricate, because of the problems of nding resolvable atoms in the facts and of subsumption elimination in sets of facts. We present an eecient implementation of the xpoint computatio...
متن کاملA CASE - ANALYSIS APPROACH TODISJUNCTIVE LOGIC PROGRAMMINGbyDavid
Computer Science) A CASE-ANALYSIS APPROACH TO DISJUNCTIVE LOGIC PROGRAMMING by David W. Reed Department of Computer Science Duke University Date: Approved: Donald W. Loveland, Supervisor Gopalan Nadathur Alan Biermann Richard Hodel Robert Wagner An abstract of a dissertation submitted in partial ful llment of the requirements for the degree of Doctor of Philosophy in the Department of Computer ...
متن کامل