Logic Programming with Defaults and Argumentation Theories

DOI10.1007/978-3-642-02846-5_35zbMath1251.68230MaRDI QIDQ5325769

Hui Wan, Michael Kifer, Paul Fodor, Benjamin N. Grosof, Senlin Liang

Publication date: 24 July 2009

Published in: Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02846-5_35

zbMATH Keywords

argumentation theory; defeasible reasoning; well-founded models

Mathematics Subject Classification ID

68T27: Logic in artificial intelligence

68N17: Logic programming

Related Items

XSB: Extending Prolog with Tabled Logic Programming

Uses Software

• HiLog

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A logic for default reasoning
• Preferred answer sets for extended logic programs
• An argumentation framework in default logic
• An abstract, argumentation-theoretic approach to default reasoning
• Prioritized logic programming and its application to commonsense reasoning
• Priorities on defaults with prerequisites, and their application in treating specificity in terminological default logic
• Well-founded and stationary models of logic programs
• Representation results for defeasible logic
• Ambiguity Propagating Defeasible Logic and the Well-Founded Semantics
• HiLog: A foundation for higher-order logic programming
• The well-founded semantics for general logic programs
• Logical foundations of object-oriented and frame-based languages
• A framework for compiling preferences in logic programs
• Computing preferred answer sets by meta-interpretation in Answer Set Programming
• Defeasible logic programming: an argumentative approach
• Journal on Data Semantics I
• An argument-based approach to reasoning with specificity