Encoding deductive argumentation in quantified Boolean formulae

, &
Artificial Intelligence 173 (15):1406-1423 (2009)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.artint.2009.06.006

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 94,045

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

When is argumentation deductive?Henry Prakken - 2023 - Journal of Applied Non-Classical Logics 33 (3-4):212-223.
Philippe Besnard. An introduction to default logic. Symbolic computation, artificial intelligence series. Springer-Verlag, Berlin etc. 1989, xi + 208 pp. [REVIEW]V. Wiktor Marek - 1998 - Journal of Symbolic Logic 63 (4):1608-1610.
Backjumping for Quantified Boolean Logic satisfiability.Enrico Giunchiglia, Massimo Narizzano & Armando Tacchella - 2003 - Artificial Intelligence 145 (1-2):99-120.
Syntactic reasoning with conditional probabilities in deductive argumentation.Anthony Hunter & Nico Potyka - 2023 - Artificial Intelligence 321 (C):103934.
A logic-based theory of deductive arguments☆☆This is an extended version of a paper entitled “Towards a logic-based theory of argumentation” published in the Proceedings of the National Conference on Artificial Intelligence (AAAI'2000), Austin, TX, MIT Press, Cambridge, MA, 2000. [REVIEW]Philippe Besnard & Anthony Hunter - 2001 - Artificial Intelligence 128 (1-2):203-235.
Philippe BESNARD, "An Introduction to Default Logic". [REVIEW]Paul Gochet - 1990 - Revue Internationale de Philosophie 44 (1):145.
Review: Philippe Besnard, An Introduction to Default Logic. [REVIEW]V. Wiktor Marek - 1998 - Journal of Symbolic Logic 63 (4):1608-1610.
Logic, arguments and inconsistencies: an introduction to the festschrift in honour of Philippe Besnard.Sylvie Doutre, Andreas Herzig & Anthony Hunter - 2023 - Journal of Applied Non-Classical Logics 33 (3-4):207-211.
Redundancy in logic I: CNF propositional formulae.Paolo Liberatore - 2005 - Artificial Intelligence 163 (2):203-232.
Minimal sets on propositional formulae. Problems and reductions.Joao Marques-Silva, Mikoláš Janota & Carlos Mencía - 2017 - Artificial Intelligence 252 (C):22-50.

Analytics

Added to PP
2020-12-22

Downloads
8 (#1,336,469)

6 months
7 (#592,005)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

Argument-based extended logic programming with defeasible priorities.Henry Prakken & Giovanni Sartor - 1997 - Journal of Applied Non-Classical Logics 7 (1-2):25-75.
Coherence in finite argument systems.Paul E. Dunne & T. J. M. Bench-Capon - 2002 - Artificial Intelligence 141 (1-2):187-203.

View all 8 references / Add more references