A flexible framework for defeasible logics
G. Antoniou, D. Billigton, G. Governatori, M. J. Maher
Abstract
Logics for knowledge representation suffer from over-specialization: while each logic may provide an ideal representation formalism for some problems, it is less than optimal for others. A solution to this problem is to choose from several logics and, when necessary, combine the representations. In general, such an approach results in a very difficult problem of combination. However, if we can choose the logics from a uniform framework then the problem of combining them is greatly simplified. In this paper, we develop such a framework for defeasible logics. It supports all defeasible logics that satisfy a strong negation principle. We use logic meta-programs as the basis for the framework.
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