Interlinking logic programs and argumentation frameworks

DOI10.1007/978-3-031-15707-3_25MaRDI QIDQ2694581zbMATH OpenOpenAlexFDO

Authors Chiaki Sakama, Tran Cao Son

Publication date 4 April 2023

Full work available at URL https://doi.org/10.1007/978-3-031-15707-3_25

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Cites work

• scientific article; zbMATH DE number 25192 (Why is no real title available?)
• A probabilistic approach to modelling uncertain logical arguments
• Context-free and context-sensitive kernels: update and deletion equivalence in abstract argumentation
• Expressive power and complexity of partial models for disjunctive deductive databases
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games
• On the equivalence between logic programming semantics and argumentation semantics
• Semantical characterizations and complexity of equivalences in answer set programming
• The well-founded semantics for general logic programs

Cited in

(1)

• A logic programming framework for possibilistic argumentation: Formalization and logical properties

This page was built for publication: Interlinking logic programs and argumentation frameworks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2694581)