Well-Founded Semantics for Extended Logic Programs with Dynamic Preferences
G. Brewka
Abstract
The paper describes an extension of well-founded semantics for logic programs with two types of negation. In this extension information about preferences between rules can be expressed in the logical language and derived dynamically. This is achieved by using a reserved predicate symbol and a naming technique. Conflicts among rules are resolved whenever possible on the basis of derived preference information. The well-founded conclusions of prioritized logic programs can be computed in polynomial time. A legal reasoning example illustrates the usefulness of the approach.
Create a lesson
Related papers
WikiSkill: Compiling Agent Experience into Persistent Knowledge for Skill Evolution
Liyan Tang, Cyrus Rashtchian, Chun-Sung Ferng et al.
Mechanistic Reaction Prediction via Discrete Flow Matching on Graph-Structured Electron Occupation
Nguyen Xuan-Vu, Octavian Susanu, Daniel Armstrong et al.
Learning a Continuous Sepsis Severity Score Without Hour-by-Hour Supervision: A Two-Site Retrospective Study
Kevin Zhu, Ryan Zhang, Baraa Abed et al.
CorporateBench: Large-Scale Q&A Benchmarking with Temporal Knowledge Bases
Sil Hamilton, Albert Yu Sun, Oscar J. Romero et al.
Sophistication in GenAI Use: Field Evidence from a Large Firm
Nicholas J. Hallman, Zachary T. Kowaleski, Anu Puvvada et al.
Not All Eval-Awareness Is Equal: Capabilities Framing Predicts Compliance
Allison Zhuang, Santiago Aranguri