Publications de
Philippe Besnard, Anthony Hunter, Stefan Woltran
Encoding deductive argumentation in quantified Boolean formulae.
Dans : Artificial Intelligence, Elsevier, Vol. 173 N. 15, p. 1406-1423, 2009.
Philippe Besnard, Torsten Schaub, Hans Tompits, Stefan Woltran
Paraconsistent Logics for Reasoning via Quantified Booelan Formulas II: Circumscribing Inconsistent Theories
Dans : 7th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU-2003), Aalborg, Denmark, 02/07/03-05/07/03, Thomas Nielsen, Nevin Zhang (Eds.), Springer, p. 528-539, juillet 2003.
Philippe Besnard, Torsten Schaub, Hans Tompits, Stefan Woltran
Paraconsistent Reasoning via Quantified Boolean Formulas I: Axiomatising Signed Systems
Dans : Paraconsistent Computational Logic Workshop – part of Federated Logic Conference (FLoC-2002), Roskilde, Denmark, 27/07/02-28/07/02, Hendrik Decker, Jorgen Villadsen, Toshiharu Waragai (Eds.).
Philippe Besnard, Torsten Schaub, Hans Tompits, Stefan Woltran
Paraconsistent Reasoning via Quantified Boolean Formulas I: Axiomatising Signed Systems
Dans : 8th European Conference on Logics in Artificial Intelligence (JELIA-2002), Cosenza, Italy, 23/09/02-26/09/02, Sergio Flesca, Sergio Greco, Nicola Leone, Giovambattista Ianni (Eds.), Springer, p. 320-331, septembre 2002.
Philippe Besnard, Torsten Schaub, Hans Tompits, Stefan Woltran
Representing Paraconsistent Reasoning via Quantified Propositional Logic
Dans : Inconsistency Tolerance. Leopoldo Bertossi, Anthony Hunter, Torsten Schaub (Eds.) , Springer, p. 84-118, Vol. 3300, LNCS, 2005.
Philippe Besnard, Torsten Schaub, Hans Tompits, Stefan Woltran
Quantified Propositional Formulas for Paraconsistency
Dans : Inconsistency Tolerance. Leopoldo Bertossi, Anthony Hunter, Torsten Schaub (Eds.) , Springer, p. 20-42, 2004.