Package net.sf.tweety.logics.cl.reasoner

Class SimpleCReasoner

  • All Implemented Interfaces:
    ModelProvider<Conditional,​ClBeliefSet,​RankingFunction>, QualitativeReasoner<ClBeliefSet,​PlFormula>, Reasoner<java.lang.Boolean,​ClBeliefSet,​PlFormula>
    public class SimpleCReasoner
extends AbstractConditionalLogicReasoner
    This class models a brute force c-reasoner for conditional logic. Reasoning is performed by computing a minimal c-representation for the given knowledge base.
    A c-representation for a conditional knowledge base R={r1,...,rn} is a ranking function k such that k accepts every conditional in R (k |= R) and if there are numbers k0,k1+,k1-,...,kn+,kn- with
    k(w)=k0 + \sum_{w verifies ri} ki+ + \sum_{w falsifies ri} kj- for every w. A c-representation is minimal if k0+...+kn- is minimal.
    The c-representation is computed using a brute force approach.

    See Gabriele Kern-Isberner. Conditionals in nonmonotonic reasoning and belief revision. Lecture Notes in Computer Science, Volume 2087. 2001.
    Author:
    Matthias Thimm

    • Constructor Summary

      Constructors 
      Constructor Description
      SimpleCReasoner()
      Creates a new simple c-representation reasoner.
      SimpleCReasoner​(boolean simple)
      Creates a new c-representation reasoner

    • Method Summary

      Modifier and Type Method Description
      RankingFunction getModel​(ClBeliefSet beliefset)
      Returns a single (dedicated) model of the given belief base.

      • Methods inherited from class java.lang.Object

        equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

    • Constructor Detail

      • SimpleCReasoner

        public SimpleCReasoner​(boolean simple)
        Creates a new c-representation reasoner
        Parameters:
        simple - whether the computed c-representation is simple.

      • SimpleCReasoner

        public SimpleCReasoner()
        Creates a new simple c-representation reasoner.