public abstract class CLaw extends Object implements CausalLaw
| Modifier and Type | Field and Description |
|---|---|
protected net.sf.tweety.logics.fol.syntax.FolFormula |
headFormula |
protected net.sf.tweety.logics.fol.syntax.FolFormula |
ifFormula |
protected Set<GroundingRequirement> |
requirements |
| Constructor and Description |
|---|
CLaw()
Creates an empty causal law.
|
CLaw(net.sf.tweety.logics.fol.syntax.FolFormula headFormula)
Creates a causal law of the form caused headFormula if True
|
CLaw(net.sf.tweety.logics.fol.syntax.FolFormula headFormula,
net.sf.tweety.logics.fol.syntax.FolFormula ifFormula)
Creates a causal law of the form caused headFormula if ifFormula
|
CLaw(net.sf.tweety.logics.fol.syntax.FolFormula headFormula,
net.sf.tweety.logics.fol.syntax.FolFormula ifFormula,
Set<GroundingRequirement> requirements)
Creates a causal law of the form caused headFormula if ifFormula requires
requirements
|
CLaw(net.sf.tweety.logics.fol.syntax.FolFormula headFormula,
Set<GroundingRequirement> requirements)
Creates a causal law of the form caused headFormula if True requires
requirements
|
| Modifier and Type | Method and Description |
|---|---|
void |
addGroundingRequirement(GroundingRequirement c) |
abstract Set<CLaw> |
getAllGrounded()
Returns the set of all grounded instances of this causal law.
|
abstract Set<net.sf.tweety.logics.fol.syntax.FOLAtom> |
getAtoms()
Returns the set of propositions in all formulas in this law.
|
abstract Set<net.sf.tweety.logics.fol.syntax.FolFormula> |
getFormulas()
Returns the set of formulas contained in this causal law, e.g.
|
net.sf.tweety.logics.fol.syntax.FolFormula |
getHeadFormula()
Returns the headFormula of this causal law.
|
net.sf.tweety.logics.fol.syntax.FolFormula |
getIfFormula()
Returns the ifFormula of this causal law.
|
abstract net.sf.tweety.commons.Signature |
getSignature() |
protected boolean |
isConjunctiveClause(net.sf.tweety.logics.fol.syntax.FolFormula pl)
a conjunctive clause is either a literal or a conjunction of literals.
|
abstract boolean |
isDefinite()
Returns true iff this law is definite.
|
boolean |
isGround() |
protected boolean |
isValidDefiniteHead(net.sf.tweety.logics.commons.syntax.RelationalFormula pl)
Checks if a propositional formula is a valid head formula for a definite
causal law, which means either a contradiction, a fluent or the negation
of a fluent.
|
abstract Set<CLaw> |
toDefinite()
Returns an equivalent definite causal law.
|
protected net.sf.tweety.logics.fol.syntax.FolFormula headFormula
protected net.sf.tweety.logics.fol.syntax.FolFormula ifFormula
protected Set<GroundingRequirement> requirements
public CLaw()
public CLaw(net.sf.tweety.logics.fol.syntax.FolFormula headFormula)
headFormula - public CLaw(net.sf.tweety.logics.fol.syntax.FolFormula headFormula,
Set<GroundingRequirement> requirements)
headFormula - requirements - public CLaw(net.sf.tweety.logics.fol.syntax.FolFormula headFormula,
net.sf.tweety.logics.fol.syntax.FolFormula ifFormula,
Set<GroundingRequirement> requirements)
headFormula - public CLaw(net.sf.tweety.logics.fol.syntax.FolFormula headFormula,
net.sf.tweety.logics.fol.syntax.FolFormula ifFormula)
headFormula - public abstract net.sf.tweety.commons.Signature getSignature()
getSignature in interface net.sf.tweety.commons.Formulapublic abstract boolean isDefinite()
public abstract Set<CLaw> toDefinite() throws IllegalStateException
IllegalStateException - when there is no equivalent definite causal
law.public abstract Set<net.sf.tweety.logics.fol.syntax.FOLAtom> getAtoms()
public abstract Set<net.sf.tweety.logics.fol.syntax.FolFormula> getFormulas()
public void addGroundingRequirement(GroundingRequirement c)
public net.sf.tweety.logics.fol.syntax.FolFormula getHeadFormula()
public net.sf.tweety.logics.fol.syntax.FolFormula getIfFormula()
public boolean isGround()
public abstract Set<CLaw> getAllGrounded()
protected boolean isValidDefiniteHead(net.sf.tweety.logics.commons.syntax.RelationalFormula pl)
pl - a propositional formulaprotected boolean isConjunctiveClause(net.sf.tweety.logics.fol.syntax.FolFormula pl)
pl - a propositional formulaCopyright © 2018. All rights reserved.