Class SimplePlLogicDeductiveKnowledgebase

  • All Implemented Interfaces:
    Iterable<SimplePlRule>, Collection<SimplePlRule>, net.sf.tweety.commons.BeliefBase

    public class SimplePlLogicDeductiveKnowledgebase
    extends net.sf.tweety.commons.BeliefSet<SimplePlRule,​net.sf.tweety.logics.pl.syntax.PlSignature>
    Author:
    Federico Cerutti (federico.cerutti@acm.org) According to http://www0.cs.ucl.ac.uk/staff/a.hunter/papers/ac13t.pdf a simple logic knowledge base (propositional version only in this implementation) is a set of literals---in this implementation rules with empty body---and a set of simple rules, @see SimplePlRule
    • Constructor Detail

      • SimplePlLogicDeductiveKnowledgebase

        public SimplePlLogicDeductiveKnowledgebase()
      • SimplePlLogicDeductiveKnowledgebase

        public SimplePlLogicDeductiveKnowledgebase​(Collection<SimplePlRule> _kb)
    • Method Detail

      • getMinimalSignature

        public net.sf.tweety.commons.Signature getMinimalSignature()
      • getAF

        public net.sf.tweety.arg.dung.syntax.DungTheory getAF()
        Builds simple logic arguments and attacks among them---simple undercut and simple rebuttal---as described in http://www0.cs.ucl.ac.uk/staff/a.hunter/papers/ac13t.pdf
        Returns:
        the DungTheory built on the simple logic knowledge base following http://www0.cs.ucl.ac.uk/staff/a.hunter/papers/ac13t.pdf
      • instantiateSignature

        protected net.sf.tweety.logics.pl.syntax.PlSignature instantiateSignature()
        Specified by:
        instantiateSignature in class net.sf.tweety.commons.BeliefSet<SimplePlRule,​net.sf.tweety.logics.pl.syntax.PlSignature>