An implementation and DSL for the Carneades argumentation model.

An implementation and domain specific language for the Carneades argumentation model. See "Haskell Gets Argumentative" in the Proceedings of Symposium on Trends in Functional Programming (TFP 2012) by Bas van Gijzel and Henrik Nilsson. Thanks to Stefan Sabev for providing initial code for the cyclicity check. For the papers accompanying this library see "Towards a framework for the implementation and verification of translations between argumentation models" and "A principled approach to the implementation of argumentation models", available at https://scholar.google.com/citations?user=Xu4yjvwAAAAJ&hl.

CarneadesDSL

An implementation and domain-specific language for the Carneades argumentation model.

Synopsis

CarneadesDSL provides a Haskell DSL for constructing and evaluating Carneades Argument Evaluation Structures (CAES). It supports five predefined proof standards and includes a parser for external CAES definitions.

Usage

import Language.Carneades.CarneadesDSL
import Language.Carneades.ExampleCAES (caes, argSet)

-- Construct propositions and arguments
let p = mkProp "intent"
let a = mkArg ["witness"] ["unreliable"] "intent"

-- Query a CAES
acceptable (mkProp "murder") caes   -- False
applicableArgs caes                 -- [applicable arguments]

Parsing

CAES definitions can be parsed from text files:

import Language.Carneades.Input (parseCAES)

main :: IO ()
main = do
  input <- readFile "examplecaes.txt"
  case parseCAES input of
    Left err   -> print err
    Right caes -> print (acceptableProps caes)

References

See "Haskell Gets Argumentative" in the Proceedings of Symposium on Trends in Functional Programming (TFP 2012) by Bas van Gijzel and Henrik Nilsson.

For the papers accompanying this library see Google Scholar.

License

BSD-3-Clause (see LICENSE)