Sets of Boolean connectives that make argumentation easier

DOI10.1007/978-3-642-15675-5_12MaRDI QIDQ4930759zbMATH OpenOpenAlexFDO

Authors

Publication date 1 October 2010

Published in Logics in Artificial Intelligence (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Recommendations

• Complexity Classifications for Logic-Based Argumentation
• Encoding deductive argumentation in quantified Boolean formulae
• Algorithms for Effective Argumentation in Classical Propositional Logic: A Connection Graph Approach
• The complexity of the warranted formula problem in propositional argumentation
• The complexity of propositional implication

Cited in

(1)

• Encoding deductive argumentation in quantified Boolean formulae

This page was built for publication: Sets of Boolean connectives that make argumentation easier

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