One formulation of the concept of logic programming is the notion of Abstract Logic Programming Language, introduced in . Central to that definition is uniform proof, which enforces the requirements of inference direction, including goal-directedness, and the duality of readings, declarative and procedural. We use this technology to investigate Disjunctive Logic Programming (DLP), an extension of traditional logic programming that permits disjunctive program clauses. This extension has been considered by some to be inappropriately identified with logic programming because the indefinite reasoning introduced by disjunction violates the goal-oriented search directionality central to logic programming. We overcome this criticism by showing that the requirement of uniform provability can be realized in a logic more general than that of DLP under a modest, sound, modification of programs. We use this observation to derive inference rules that capture the essential proof structure of InH-Prolog, a known proof procedure for DLP.
|Original language||English (US)|
|Number of pages||8|
|Journal||Proceedings - Symposium on Logic in Computer Science|
|State||Published - Jan 1 1995|
|Event||Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science - San Diego, CA, USA|
Duration: Jun 26 1995 → Jun 29 1995