Extending the Stable Model Semantics with More Expressive Rules

TL;DR

This paper introduces more expressive propositional rules to extend the stable model semantics, enabling more concise logic programs and improving practical applicability with an efficient decision procedure.

Contribution

It proposes new types of propositional rules that enhance expressiveness and integrates them with an efficient decision procedure for practical use.

Findings

New rules improve expressiveness of logic programs

Decision procedure enables efficient implementation

Practical applications benefit from extended semantics

Abstract

The rules associated with propositional logic programs and the stable model semantics are not expressive enough to let one write concise programs. This problem is alleviated by introducing some new types of propositional rules. Together with a decision procedure that has been used as a base for an efficient implementation, the new rules supplant the standard ones in practical applications of the stable model semantics.