Two results for proiritized logic programming
Yan Zhang
Abstract
Prioritized default reasoning has illustrated its rich expressiveness and flexibility in knowledge representation and reasoning. However, many important aspects of prioritized default reasoning have yet to be thoroughly explored. In this paper, we investigate two properties of prioritized logic programs in the context of answer set semantics. Specifically, we reveal a close relationship between mutual defeasibility and uniqueness of the answer set for a prioritized logic program. We then explore how the splitting technique for extended logic programs can be extended to prioritized logic programs. We prove splitting theorems that can be used to simplify the evaluation of a prioritized logic program under certain conditions.
Create a lesson
Related papers
FDE-Gym: The Last Mile of AI Delivery
Dongxu Yang, Hongda Yan, Renxin Wang et al.
MLExpert: Towards a Generalist Agentic Model for Autonomous Machine Learning Engineering
Shangheng Du, Jinxin Shi, Shuaiyu Zhang et al.
Evaluation Awareness Beyond English: Do LLMs Act Differently When Tested in Indic Languages?
Trizal Garg, Sibayan Mitra, Arya Karanjkar et al.
KnowGPO: Knowledge-Grouped Policy Optimization for Search Agents
Siqi Chen, Zhengxi Lu, Yuchen Yan et al.
Designing Transformers for Continuous Diffusion Language Models
Weijian Luo, Yujian Chen, Hao Jiang et al.
A team of Gemini 4 Argon agents beats Minecraft
Maxence Faldor, Satinder Singh, Roberta Raileanu