Uses of Interface
net.sf.tweety.logics.commons.syntax.interfaces.SimpleLogicalFormula
-
-
-
Uses of SimpleLogicalFormula in net.sf.tweety.action.query.syntax
Classes in net.sf.tweety.action.query.syntax that implement SimpleLogicalFormula Modifier and Type Class Description class
AlwaysQuery
This class represents an always query in the action query language S.class
HoldsQuery
This class represents a holds query in the action query language S.class
NecessarilyQuery
This class represents a necessarily query in the action query language S.class
QueryProposition
Action queries are represented as propositional formulas with three possible types of propositions: holds, always and necessarily propositions. -
Uses of SimpleLogicalFormula in net.sf.tweety.arg.aba.syntax
Classes in net.sf.tweety.arg.aba.syntax that implement SimpleLogicalFormula Modifier and Type Class Description class
AbaElement<T extends Formula>
Abstract class that models common properties of aba syntax elements.class
AbaRule<T extends Formula>
A common interface for assumptions and inference rules.class
Assumption<T extends Formula>
This class models an assumption of an ABA theory.class
InferenceRule<T extends Formula>
This class models an inference rule from an ABA theory.class
Negation<T extends Formula>
-
Uses of SimpleLogicalFormula in net.sf.tweety.arg.aspic.syntax
Classes in net.sf.tweety.arg.aspic.syntax that implement SimpleLogicalFormula Modifier and Type Class Description class
DefeasibleInferenceRule<T extends Invertable>
class
InferenceRule<T extends Invertable>
class
StrictInferenceRule<T extends Invertable>
-
Uses of SimpleLogicalFormula in net.sf.tweety.arg.delp.syntax
Classes in net.sf.tweety.arg.delp.syntax that implement SimpleLogicalFormula Modifier and Type Class Description class
DefeasibleRule
This class models a defeasible rule in defeasible logic programming.class
DelpFact
This class implements a fact in defeasible logic programming which encapsulates a literal.class
DelpRule
This method is the superclass for both a strict rule and a defeasible rule in defeasible logic programming and captures their common attributes and methods.class
StrictRule
This class models a strict rule in defeasible logic programming. -
Uses of SimpleLogicalFormula in net.sf.tweety.arg.dung.ldo.syntax
Classes in net.sf.tweety.arg.dung.ldo.syntax that implement SimpleLogicalFormula Modifier and Type Class Description class
AbstractGraphLdoModality
Provides common functionalities for the graph-based modalities in LDO.class
AbstractLdoModality
Provides common functionalities for all modalities in LDO.class
LdoArgument
This class represents an argument in ldo.class
LdoAssociativeFormula
This class captures the common functionalities of formulas with an associative operation like conjunction, disjunction, etc.class
LdoBoxModality
class
LdoConjunction
This class represents a conjunction in ldo logic.class
LdoDiamondModality
class
LdoDisjunction
This class represents a disjunction in ldo logic.class
LdoFormula
This abstract class specifies the general methods of all Ldo-formulas (LDO - Logic of dialectical outcomes, cf.class
LdoGraphBoxModality
class
LdoGraphDiamondModality
class
LdoNegation
This class models classical negation of ldo logic.class
LdoRelation
Creates a relational formula, i.e.Methods in net.sf.tweety.arg.dung.ldo.syntax with type parameters of type SimpleLogicalFormula Modifier and Type Method Description <C extends SimpleLogicalFormula>
java.util.Set<C>LdoAssociativeFormula. getFormulas(java.lang.Class<C> cls)
-
Uses of SimpleLogicalFormula in net.sf.tweety.logics.cl.syntax
Classes in net.sf.tweety.logics.cl.syntax that implement SimpleLogicalFormula Modifier and Type Class Description class
Conditional
This class represents a basic conditional (B|A) with formulas A,B. -
Uses of SimpleLogicalFormula in net.sf.tweety.logics.commons.syntax
Classes in net.sf.tweety.logics.commons.syntax with type parameters of type SimpleLogicalFormula Modifier and Type Class Description class
AssociativeFormulaSupport<T extends SimpleLogicalFormula>
This class provides common implementation for associative formulas that are formulas which consists of several other formulas.Classes in net.sf.tweety.logics.commons.syntax that implement SimpleLogicalFormula Modifier and Type Class Description class
AssociativeFormulaSupport<T extends SimpleLogicalFormula>
This class provides common implementation for associative formulas that are formulas which consists of several other formulas.class
ComplexLogicalFormulaAdapter
Abstract base class for ComplexLogicalFormula, that are formulas which implement substitute(), exchange(), getTerms(), isGround() and isWellFormed() and therefore use terms to describe themself.class
RelationalFormula
This is the abstract base class for relational formulas, i.e.Methods in net.sf.tweety.logics.commons.syntax with type parameters of type SimpleLogicalFormula Modifier and Type Method Description <T extends SimpleLogicalFormula>
AssociativeFormula<T>AssociativeFormulaSupport.AssociativeSupportBridge. createEmptyFormula()
<C extends SimpleLogicalFormula>
java.util.Set<C>AssociativeFormulaSupport. getFormulas(java.lang.Class<C> cls)
Methods in net.sf.tweety.logics.commons.syntax with parameters of type SimpleLogicalFormula Modifier and Type Method Description boolean
AssociativeFormulaSupport. add(T... formulas)
Appends the specified elements to the end of this collection (optional operation). -
Uses of SimpleLogicalFormula in net.sf.tweety.logics.commons.syntax.interfaces
Classes in net.sf.tweety.logics.commons.syntax.interfaces with type parameters of type SimpleLogicalFormula Modifier and Type Interface Description interface
AssociativeFormula<T extends SimpleLogicalFormula>
This interfaces describes associative formulas like a disjunction or a conjunction.Subinterfaces of SimpleLogicalFormula in net.sf.tweety.logics.commons.syntax.interfaces Modifier and Type Interface Description interface
AssociativeFormula<T extends SimpleLogicalFormula>
This interfaces describes associative formulas like a disjunction or a conjunction.interface
Atom
An atomic language construct, linked to its predicateinterface
ClassicalFormula
This interface models a classical formula, i.e.interface
ComplexLogicalFormula
A complex logical formula can contain arguments referred as terms, this interface provides methods to substitute and exchange those terms.interface
Conjunctable
Formulas implementing this interface can be connected by using AND.interface
Disjunctable
Formulas implementing this interface can be connected using OR.interface
Invertable
Formulas implementing this interface have a complementinterface
QuantifiedFormula
Interface for a QuantifiedFormula with a set of quantified variables implementing an all- or exist-quantor for example.Methods in net.sf.tweety.logics.commons.syntax.interfaces with type parameters of type SimpleLogicalFormula Modifier and Type Method Description <C extends SimpleLogicalFormula>
java.util.Set<C>AssociativeFormula. getFormulas(java.lang.Class<C> cls)
Process the formulas of type C that are children of this associative formulaMethods in net.sf.tweety.logics.commons.syntax.interfaces that return SimpleLogicalFormula Modifier and Type Method Description SimpleLogicalFormula
SimpleLogicalFormula. clone()
Creates a deep copy of this formulaSimpleLogicalFormula
Conjunctable. combineWithAnd(Conjunctable f)
Returns a conjunction of this and the given formula.SimpleLogicalFormula
Disjunctable. combineWithOr(Disjunctable f)
SimpleLogicalFormula
QuantifiedFormula. getFormula()
-
Uses of SimpleLogicalFormula in net.sf.tweety.logics.dl.syntax
Classes in net.sf.tweety.logics.dl.syntax that implement SimpleLogicalFormula Modifier and Type Class Description class
AssertionalAxiom
Abstract base class for assertional axioms (concept assertions and role assertions).class
AssociativeDlFormula
This class captures the common functionalities of description logic associative formulas (union and intersection).class
AtomicConcept
This class models an atomic concept (aka concept name) in description logics.class
AtomicRole
This class models a role in description logics.class
BottomConcept
This class models the bottom concept (empty concept) in description logics.class
Complement
This class models the complement (negation) in description logics.class
ComplexConcept
The common abstract class for concepts (also called concepts, complex concepts or concept descriptions) of description logics.class
ConceptAssertion
This class models a concept assertion in description logic, i.e.class
DlAxiom
The common abstract class for axioms of the description logic ALC.class
EquivalenceAxiom
This class models an equivalence axiom, also known as general concept inclusion (GCU), meaning an expression of the form "C is a subset of or equal to D" with C and D as Concepts.class
ExistentialRestriction
This class models an existential restriction in description logics, i.e.class
Intersection
This class models an intersection in description logics.class
RoleAssertion
This class models a role assertion in description logic, i.e.class
TopConcept
This class models the top concept (universal concept) in description logics.class
Union
This class models an union in description logics.class
UniversalRestriction
This class models an universal restriction in description logics, i.e.Methods in net.sf.tweety.logics.dl.syntax with type parameters of type SimpleLogicalFormula Modifier and Type Method Description <C extends SimpleLogicalFormula>
java.util.Set<C>AssociativeDlFormula. getFormulas(java.lang.Class<C> cls)
-
Uses of SimpleLogicalFormula in net.sf.tweety.logics.fol.syntax
Classes in net.sf.tweety.logics.fol.syntax that implement SimpleLogicalFormula Modifier and Type Class Description class
AssociativeFolFormula
This class captures the common functionalities first order associative formulas like conjunction, disjunction, etc.class
Conjunction
The classical conjunction of first-order logic.class
Contradiction
A contradictory formula.class
Disjunction
The classical disjunction of first-order logic.class
Equivalence
The equivalence of first-order logic.class
ExclusiveDisjunction
The exclusive disjunction (XOR) in first-order logic.class
ExistsQuantifiedFormula
Exists-quantified first-order logic formula.class
FolAtom
An atom in first-order logic, i.e.class
FolFormula
The common abstract class for formulas of first-order logic.class
ForallQuantifiedFormula
For-All-quantified first-order logic formula.class
Implication
The implication of first-order logic.class
Negation
The classical negation of first-order logic.class
SpecialFormula
This class captures the common functionalities of the special formulas tautology and contradiction.class
Tautology
A tautological formula.Methods in net.sf.tweety.logics.fol.syntax with type parameters of type SimpleLogicalFormula Modifier and Type Method Description <C extends SimpleLogicalFormula>
java.util.Set<C>AssociativeFolFormula. getFormulas(java.lang.Class<C> cls)
-
Uses of SimpleLogicalFormula in net.sf.tweety.logics.ml.syntax
Classes in net.sf.tweety.logics.ml.syntax that implement SimpleLogicalFormula Modifier and Type Class Description class
MlFormula
This class models a modal formula, i.e.class
Necessity
This class models the necessity modality.class
Possibility
This class models the possibility modality. -
Uses of SimpleLogicalFormula in net.sf.tweety.logics.mln.syntax
Classes in net.sf.tweety.logics.mln.syntax that implement SimpleLogicalFormula Modifier and Type Class Description class
MlnFormula
Instances of this class represent first-order formulas with a weight. -
Uses of SimpleLogicalFormula in net.sf.tweety.logics.pcl.syntax
Classes in net.sf.tweety.logics.pcl.syntax that implement SimpleLogicalFormula Modifier and Type Class Description class
ProbabilisticConditional
This class represents a probabilistic conditional of the form (B|A)[p] with formulas A,B and a probability p. -
Uses of SimpleLogicalFormula in net.sf.tweety.logics.pl.syntax
Classes in net.sf.tweety.logics.pl.syntax that implement SimpleLogicalFormula Modifier and Type Class Description class
AssociativePlFormula
This class captures the common functionalities of formulas with an associative operation like conjunction, disjunction, etc.class
Conjunction
This class represents a conjunction in propositional logic.class
Contradiction
A contradictory formula.class
Disjunction
This class represents a disjunction in propositional logic.class
Equivalence
This class models equivalence of propositional logic.class
ExclusiveDisjunction
This class represents an exclusive disjunction (XOR) in propositional logic.class
Implication
This class models the implication of propositional logic.class
Negation
This class models classical negation of propositional logic.class
PlFormula
This class represents the common ancestor for propositional formulae.class
Proposition
This class represents a simple proposition in propositional logic.class
SpecialFormula
This class captures the common functionalities of the special formulas tautology and contradiction.class
Tautology
A tautological formula.Methods in net.sf.tweety.logics.pl.syntax with type parameters of type SimpleLogicalFormula Modifier and Type Method Description <C extends SimpleLogicalFormula>
java.util.Set<C>AssociativePlFormula. getFormulas(java.lang.Class<C> cls)
-
Uses of SimpleLogicalFormula in net.sf.tweety.logics.qbf.syntax
Classes in net.sf.tweety.logics.qbf.syntax that implement SimpleLogicalFormula Modifier and Type Class Description class
ExistsQuantifiedFormula
This class represents existential quantification for boolean formulas.class
ForallQuantifiedFormula
This class represents universal quantification for boolean formulas. -
Uses of SimpleLogicalFormula in net.sf.tweety.logics.rcl.syntax
Classes in net.sf.tweety.logics.rcl.syntax that implement SimpleLogicalFormula Modifier and Type Class Description class
RelationalConditional
Instances of this class represent relational conditionals. -
Uses of SimpleLogicalFormula in net.sf.tweety.logics.rdl.syntax
Classes in net.sf.tweety.logics.rdl.syntax that implement SimpleLogicalFormula Modifier and Type Class Description class
DefaultRule
Models a default rule in Reiter's default logic, see [R. -
Uses of SimpleLogicalFormula in net.sf.tweety.logics.rpcl.syntax
Classes in net.sf.tweety.logics.rpcl.syntax that implement SimpleLogicalFormula Modifier and Type Class Description class
RelationalProbabilisticConditional
This class represents a relational probabilistic conditional, i.e. -
Uses of SimpleLogicalFormula in net.sf.tweety.logics.translators
Methods in net.sf.tweety.logics.translators with type parameters of type SimpleLogicalFormula Modifier and Type Method Description <A extends AssociativeFormula<? extends SimpleLogicalFormula>>
AssociativeFormula<?>Translator. translateAssociative(A source, java.lang.Class<?> assocCls)
Translates the given AssociativeFormula into another AssociativeFormula thats type is given by the parameter assocClsMethods in net.sf.tweety.logics.translators that return SimpleLogicalFormula Modifier and Type Method Description SimpleLogicalFormula
Translator. translateUsingMap(SimpleLogicalFormula source)
Methods in net.sf.tweety.logics.translators with parameters of type SimpleLogicalFormula Modifier and Type Method Description SimpleLogicalFormula
Translator. translateUsingMap(SimpleLogicalFormula source)
Method parameters in net.sf.tweety.logics.translators with type arguments of type SimpleLogicalFormula Modifier and Type Method Description Rule<?,?>
Translator. translateRule(Rule<? extends SimpleLogicalFormula,? extends SimpleLogicalFormula> source, java.lang.Class<?> ruleCls)
Rule<?,?>
Translator. translateRule(Rule<? extends SimpleLogicalFormula,? extends SimpleLogicalFormula> source, java.lang.Class<?> ruleCls)
-
Uses of SimpleLogicalFormula in net.sf.tweety.logics.translators.aspfol
Methods in net.sf.tweety.logics.translators.aspfol that return SimpleLogicalFormula Modifier and Type Method Description SimpleLogicalFormula
AspFolTranslator. translateUsingMap(SimpleLogicalFormula source)
Methods in net.sf.tweety.logics.translators.aspfol with parameters of type SimpleLogicalFormula Modifier and Type Method Description SimpleLogicalFormula
AspFolTranslator. translateUsingMap(SimpleLogicalFormula source)
-
Uses of SimpleLogicalFormula in net.sf.tweety.lp.asp.syntax
Classes in net.sf.tweety.lp.asp.syntax that implement SimpleLogicalFormula Modifier and Type Class Description class
AggregateAtom
This class represents an aggregate.class
AggregateElement
This class models an aggregate element, meaning a set of terms and a set of naf literals (= literals or default negated literals).class
ASPAtom
This class models an atom, which is a basic structure for building literals and rules for logic programs.class
ASPBodyElement
This class is a common base class for ASP formulas that can be part of an ASP rule body (premise of a rule): Literals (i.e.class
ASPElement
This class acts as an abstract base class for elements of ASP rules.class
ASPHead
This formula represents the head of an disjunctive rule which is a disjunction of literals.class
ASPLiteral
This interface defines common functionality for literals, meaning atoms or strictly negated atoms.class
ASPRule
This class models a rule in ASP.class
ComparativeAtom
This class represents a comparative atom, meaning an expression of the form t x u where t,u are terms and x is in {<, <=, ==, !=, >, >=}.class
DefaultNegation
This class represents a default negated literal, i.e.class
StrictNegation
This class models the strict negation of an atom (as apposed to a NAF negation:DefaultNegation
).Methods in net.sf.tweety.lp.asp.syntax with type parameters of type SimpleLogicalFormula Modifier and Type Method Description <C extends SimpleLogicalFormula>
java.util.Set<C>ASPHead. getFormulas(java.lang.Class<C> cls)
Methods in net.sf.tweety.lp.asp.syntax that return SimpleLogicalFormula Modifier and Type Method Description SimpleLogicalFormula
ASPHead. combineWithOr(Disjunctable f)
-
Uses of SimpleLogicalFormula in net.sf.tweety.lp.nlp.syntax
Classes in net.sf.tweety.lp.nlp.syntax that implement SimpleLogicalFormula Modifier and Type Class Description class
NLPNot
A default negation of a first order formula, nested logic programs only allow not quantified formulas.class
NLPRule
A rule of a nested logic program.
-