DisLoP: A Disjunctive Logic Programming System Based on PROTEIN Theorem Prover

  title={DisLoP: A Disjunctive Logic Programming System Based on PROTEIN Theorem Prover},
  author={Chandrabose Aravindan},
  • C. Aravindan
  • Published in KI 17 September 1996
  • Computer Science
In this paper, we describe a disjunctive logic programming system, referred to as DisLoP, based on PROTEIN theorem prover. PROTEIN supports certain theorem proving calculi, such as restart model elimination and hyper tableaux, that are suitable for working with positive disjunctive logic programs. In particular, restart model elimination calculus is answer complete for postive queries. The DisLoP project started at this point with the aim of extending this further to minimal model reasoning and… 
31 Citations

A Flexible System for Constraint Disjunctive Logic Programming

The main idea of the implementation is to compile the logical part of a problem specification into Prolog and to expound existing constraint solvers (available with many Prolog systems nowadays) and to integrated into the Protein theorem prover.

DisLoP: A Research Project on Disjunctive Logic Programming

This paper gives a brief highdlevel description of what has been done in the Disjunctive Logic Programmingdproject (funded by Deutsche ForschungsdGemeinschaft), undertaken by the University of

Disjunctive Logic Program = Horn Program + Control Program

A program transformation is introduced which transforms a disjunctive logic program into a Horn program and a so called control program which consists of only disjunctions of new propositional atoms and controls the "execution" of the Horn program.

Dislop: Towards a Disjunctive Logic Programming System

This paper gives a brief high-level description of the implementation of a disjunctive logic programming system referred to as DisLoP, a result of research activities of the Disjunctive Logic Programming-project, undertaken by the University of Koblenz since July 1995.

Con uent Rewriting Systems forLogic Programming

It is shown that most of the well-known semantics for normal logic programs are induced by connuent LP-systems, and several new transformation rules are introduced that induce interesting semantics which are polynomial time computable, extend WFS and seem suitable for modelling aggregation in logic programs.

Prolegomena to Logic Programming for Non-monotonic Reasoning

The book is not a mere collection of excellent papers in their own specialty, but provides also the basics of the motivation, background history, important themes, bridges to other areas, and a common technical platform of the principal formalisms and approaches.

Model-Guided Proof Debugging

This paper introduces techniques which are also applic able in the case of nontermination in automated deduction, and uses a natural interface for inspecting even intermediate results of the proof search, and employs tableau-based calculi, especially hyper-tableaux, for debugging axiomatizations.

Minimal Model Generation Based on E-hyper Tableaux

This paper develops an approach to generate the minimal models, without explicit minimization process, based on E-hyper tableau which is a variant of hyper tableaux.

Re nements for Restart Model Elimination

One result of this paper is a table of completeness results wi th respect to the combination of the refinements head selection function, strictness, regularity, independance of the goal clause for RME (Figure 1 below).



Model Elimination, Logic Programming and Computing Answers

It is demonstrated that theorem provers using model elimination (ME) can be used as answer complete interpreters for disjunctive logic programming and a new calculus called ancestry restart ME is developed, which admits a more restrictive regularity restriction than restart ME.

Hyper Tableaux and Disjunctive Logic Programming

This paper proves that there exist an eecient proof procedure, namely hyper tableaux, which can be understood as a direct implementation of some of the well known xpoint iteration techniques, and shows how ahyper tableaux refutation can be transformed into a restart model elimination refutation.

An Abductive Framework for Negation in Disjunctive Logic Programming

This paper shows how a theorem prover, based on restart model elimination calculus, can be modified for abductive reasoning and thus for minimal model reasoning.

A Disjunctive Semantics Bases on Unfolding and Bottom-Up Evaluation

We define a new semantics for disjunctive logic programs in an abstract way as the weakest semantics with certain properties, the most important being the unfolding-property (GPPE). Our semantics is

Refinements of Theory Model Elimination and a Variant without Contrapositives

This work presents several complete versions of highly restricted theory model elimination (TME) calculi, and shows how regul arity can be adapted for these versions, ensuring the independence of the goal computation ruleholds for all variants.

Knowledge Representation with Logic Programs

This overview of knowledge representation shows how Knowledge Representation (KR) can be done with the help of generalized logic programs and extends this basic class of programs by additional features like Negation-as-Finite-Failure, Default-Negation, Explicit Negation, Preferences, and Disjunction.

Characterizations of the Stable Semantics by Partial Evaluation

This work proves characterizations of three most prominent semantics defined for certain subclasses of disjunctive logic programs: GCWA, PERFECT and STABLE and shows that if a semantics SEM satisfies Partial Evaluation and Elimination of Taulologies then SEM is based on 2-volued minimal models for positive programs, and if SEM satisfies in addition Eliminations of Contradictions, it isbased on stable models.

Theory Reasoning in First Order Calculi

A PPTP-prover which is able to handle universal theories is presented and some examples are given to show that the use of built-in theories can increase efficiency drastically.

A Tableau Calculus for Minimal Model Reasoning

The paper studies the automation of minimal model inference, i.e., determining whether a formula is true in every minimal model of the premises by employing a groundedness property of minimal models.

Analyzing Rule Sets for the Calculation of Banking Fees by a Theorem Prover with Constraints

We show that theorem proving, logic programming and constraint solving can be combined in a straightforward manner. This is shown not only by setting up a theoretical framework, but also by a real