Fages' Theorem and Answer Set Programming
Yuliya Babovich, Esra Erdem, Vladimir Lifschitz
Abstract
We generalize a theorem by Francois Fages that describes the relationship between the completion semantics and the answer set semantics for logic programs with negation as failure. The study of this relationship is important in connection with the emergence of answer set programming. Whenever the two semantics are equivalent, answer sets can be computed by a satisfiability solver, and the use of answer set solvers such as smodels and dlv is unnecessary. A logic programming representation of the blocks world due to Ilkka Niemelae is discussed as an example.
Create a lesson
Related papers
Co-Evolving Acting and Forecasting for Language Agents
Haofei Yu, Yixing Chen, Yining Zhao et al.
Scaling Discovery Requires Forgetting
Shangyin Tan, Ben Zhou, Lakshya A Agrawal et al.
PhySGA: A Physics-Space Grounded Agentic Framework for Generalizable and Interactive 3D Composition
Weichen Lyu, Chong Xia, Mingyu Dong et al.
ActiveEvidence: Decision-Focused Evidence Graphs with Verifiable Acquisition Gaps
Miaobo Hu, Shuhao Hu, Xiaobo Guo et al.
The Wealth of Agents: Scaling Agentic AI Across Developers
Austin W. Hanjie, Carlos E. Jimenez, Zirui Wang et al.
SafeAdapt-Poker: Counterfactual Risk Calibration for Budgeted Adaptation under Opponent Shift
Miaobo Hu, Shuhao Hu, Xiaobo Guo et al.