Extending the Stable Model Semantics with More Expressive Rules

Details Extending the Stable Model Semantics with More Expressive Rules Extending the Stable Model Semantics with More Expressive Rules

1999-08-06

arxiv.org/abs/cs/9908004v1

Computer Science

Logic in Computer Science

18 pages, a shortened version will be published in the proceedings of the 5th International Conference on Logic Programming an

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Extending the Stable Model Semantics with More Expressive Rules does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Extending the Stable Model Semantics with More Expressive Rules, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Extending the Stable Model Semantics with More Expressive Rules will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-74838