cs.AIMay 10, 2026

Weighted Rules under the Stable Model Semantics

Authors: Joohyung LeeYi Wang

Organizations: School of Computing, Informatics and Decision Systems Engineering Arizona State University, Tempe, USA

Abstract

We introduce the concept of weighted rules under the stable model semantics following the log-linear models of Markov Logic. This provides versatile methods to overcome the deterministic nature of the stable model semantics, such as resolving inconsistencies in answer set programs, ranking stable models, associating probability to stable models, and applying statistical inference to computing weighted stable models. We also present formal comparisons with related formalisms, such as answer set programs, Markov Logic, ProbLog, and P-log.

Explore similar work

CardsList