Graph theoretical properties of logic based argumentation frameworks: proofs and general results
Résumé
In this paper we extend our first results concerning the characterisa-tion of the graph structure of logic based argumentation graphs with two main classes of findings. First we provide full proofs for the structural results of argu-mentation graphs built over Datalog+/-knowledge base composed of facts and negative constraints solely. Second, we also provide some structural properties for the general case of knowledge bases composed of facts, rules and negative constraints.
Domaines
Intelligence artificielle [cs.AI]| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...