Propositional Clausal Defeasible Logic

被引：16
|
作者：
Billington, David [1 ]
机构：
[1] Griffith Univ, Sch ICT, Brisbane, Qld 4111, Australia
来源：
LOGICS IN ARTIFICIAL INTELLIGENCE, PROCEEDINGS | 2008年 / 5293卷
关键词：
Defeasible logic; Non-monotonic reasoning; Knowledge representation and reasoning; Artificial intelligence;
D O I：
10.1007/978-3-540-87803-2_5
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
Defeasible logics are non-monotonic reasoning systems that have efficient implementations and practical applications. We list several desirable properties and note that each defeasible logic fails to have some of these properties. We define and explain a new defeasible logic, called clausal defeasible logic (CDL), which has all these properties. CDL is easy to implement, consistent, detects loops, terminates, and has a range of deduction algorithms to cater for a range of intuitions.
引用
收藏
页码：34 / 47
页数：14
相关论文
共 50 条
  • [41] A denotational semantics of defeasible logic
    Maher, MJ
    COMPUTATIONAL LOGIC - CL 2000, 2000, 1861 : 209 - 222
  • [42] Norm Modifications in Defeasible Logic
    Governatori, Guido
    Palmirani, Monica
    Riveret, Regis
    Rotolo, Antonio
    Sartor, Giovanni
    LEGAL KNOWLEDGE AND INFORMATION SYSTEMS, 2005, 134 : 13 - 22
  • [43] Formalizing defeasible logic in CAKE
    Madalinska-Bugaj, E
    Lukaszewicz, W
    FUNDAMENTA INFORMATICAE, 2003, 57 (2-4) : 193 - 213
  • [44] Visualization of Proofs in Defeasible Logic
    Avguleas, Ioannis
    Gkirtzou, Katerina
    Triantafilou, Sofia
    Bikakis, Antonis
    Antoniou, Grigoris
    Kontopoulos, Efstratios
    Bassiliades, Nick
    RULE REPRESENTATION, INTERCHANGE AND REASONING ON THE WEB, RULEML 2008, 2008, 5321 : 197 - +
  • [45] Between SAT and CSP: Propositional satisfaction problems and clausal CSPs
    Castell, T
    Fargier, H
    ECAI 1998: 13TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 1998, : 214 - 218
  • [46] Learning in clausal logic: A perspective on inductive logic programming
    Flach, P
    Lavrac, N
    COMPUTATIONAL LOGIC: LOGIC PROGRAMMING AND BEYOND, PT I: ESSAYS IN HONOUR OF ROBERT A KOWALSKI, 2002, 2407 : 437 - 471
  • [47] Inductive equivalence in clausal logic and nonmonotonic logic programming
    Chiaki Sakama
    Katsumi Inoue
    Machine Learning, 2011, 83 : 1 - 29
  • [48] Towards Propositional KLM-Style Defeasible Standpoint Logics
    Leisegang, Nicholas
    Meyer, Thomas
    Rudolph, Sebastian
    ARTIFICIAL INTELLIGENCE RESEARCH, SACAIR 2024, 2025, 2326 : 459 - 475
  • [49] Inductive equivalence in clausal logic and nonmonotonic logic programming
    Sakama, Chiaki
    Inoue, Katsumi
    MACHINE LEARNING, 2011, 83 (01) : 1 - 29
  • [50] NON-CLAUSAL MULTI-ARY α-SEMANTIC RESOLUTION BASED ON LATTICE-VALUED PROPOSITIONAL LOGIC LP (X)
    Liu, Y.
    Xu, Y.
    UNCERTAINTY MODELLING IN KNOWLEDGE ENGINEERING AND DECISION MAKING, 2016, 10 : 453 - 458
12345