| Class and Description |
|---|
| Atom
An atomic language construct, linked to its predicate
|
| ClassicalFormula
This interface models a classical formula, i.e.
|
| Conjuctable
Formulas implementing this interface can be connected by using
AND.
|
| Disjunctable
Formulas implementing this interface can be connected using
OR.
|
| Invertable
Formulas implementing this interface have a
complement
|
| ProbabilityAware |
| SimpleLogicalFormula
A formula of a logical language
|
| Term
A term of a logical language, that can be given as argument for logical constructs
like atoms or functors.
|
| Class and Description |
|---|
| Term
A term of a logical language, that can be given as argument for logical constructs
like atoms or functors.
|
| TypedStructure
This interface defines method which are given by every TypedStructure like a
Predicate or an Functor.
|
| Class and Description |
|---|
| Invertable
Formulas implementing this interface have a
complement
|
| Class and Description |
|---|
| Invertable
Formulas implementing this interface have a
complement
|
| Class and Description |
|---|
| Invertable
Formulas implementing this interface have a
complement
|
| Class and Description |
|---|
| Invertable
Formulas implementing this interface have a
complement
|
| Class and Description |
|---|
| Invertable
Formulas implementing this interface have a
complement
|
| Class and Description |
|---|
| Invertable
Formulas implementing this interface have a
complement
|
| Class and Description |
|---|
| Term
A term of a logical language, that can be given as argument for logical constructs
like atoms or functors.
|
| Class and Description |
|---|
| Term
A term of a logical language, that can be given as argument for logical constructs
like atoms or functors.
|
| Class and Description |
|---|
| ClassicalFormula
This interface models a classical formula, i.e.
|
| ComplexLogicalFormula
A complex logical formula can contain arguments referred as terms, this
interface provides methods to substitute and exchange those terms.
|
| Conjuctable
Formulas implementing this interface can be connected by using
AND.
|
| Disjunctable
Formulas implementing this interface can be connected using
OR.
|
| Invertable
Formulas implementing this interface have a
complement
|
| LogicStructure
This interface captures the common functionalities of formulas,
sorts and terms.
|
| ProbabilityAware |
| QuantifiedFormula
Interface for a QuantifiedFormula with a set of quantified variables
implementing an all- or exist-quantor for example.
|
| SimpleLogicalFormula
A formula of a logical language
|
| Term
A term of a logical language, that can be given as argument for logical constructs
like atoms or functors.
|
| Class and Description |
|---|
| AssociativeFormula
This interfaces describes associative formulas like a disjunction or
a conjunction.
|
| Atom
An atomic language construct, linked to its predicate
|
| Atom.RETURN_SET_PREDICATE
An enum containing the different return values of the
setPredicate() method of Atom.
|
| ClassicalFormula
This interface models a classical formula, i.e.
|
| Conjuctable
Formulas implementing this interface can be connected by using
AND.
|
| Disjunctable
Formulas implementing this interface can be connected using
OR.
|
| Invertable
Formulas implementing this interface have a
complement
|
| ProbabilityAware |
| SimpleLogicalFormula
A formula of a logical language
|
| Term
A term of a logical language, that can be given as argument for logical constructs
like atoms or functors.
|
| Class and Description |
|---|
| ClassicalFormula
This interface models a classical formula, i.e.
|
| Class and Description |
|---|
| Conjuctable
Formulas implementing this interface can be connected by using
AND.
|
| Disjunctable
Formulas implementing this interface can be connected using
OR.
|
| SimpleLogicalFormula
A formula of a logical language
|
| Class and Description |
|---|
| AssociativeFormula
This interfaces describes associative formulas like a disjunction or
a conjunction.
|
| Atom
An atomic language construct, linked to its predicate
|
| ComplexLogicalFormula
A complex logical formula can contain arguments referred as terms, this
interface provides methods to substitute and exchange those terms.
|
| LogicStructure
This interface captures the common functionalities of formulas,
sorts and terms.
|
| SimpleLogicalFormula
A formula of a logical language
|
| Term
A term of a logical language, that can be given as argument for logical constructs
like atoms or functors.
|
| TypedStructure
This interface defines method which are given by every TypedStructure like a
Predicate or an Functor.
|
| Class and Description |
|---|
| Atom
An atomic language construct, linked to its predicate
|
| Atom.RETURN_SET_PREDICATE
An enum containing the different return values of the
setPredicate() method of Atom.
|
| ComplexLogicalFormula
A complex logical formula can contain arguments referred as terms, this
interface provides methods to substitute and exchange those terms.
|
| Conjuctable
Formulas implementing this interface can be connected by using
AND.
|
| Disjunctable
Formulas implementing this interface can be connected using
OR.
|
| Invertable
Formulas implementing this interface have a
complement
|
| LogicProgram
An interface for a logic program, which is a set of rules.
|
| LogicStructure
This interface captures the common functionalities of formulas,
sorts and terms.
|
| ProbabilityAware |
| SimpleLogicalFormula
A formula of a logical language
|
| Term
A term of a logical language, that can be given as argument for logical constructs
like atoms or functors.
|
| TypedStructure
This interface defines method which are given by every TypedStructure like a
Predicate or an Functor.
|
| Class and Description |
|---|
| ClassicalFormula
This interface models a classical formula, i.e.
|
| ComplexLogicalFormula
A complex logical formula can contain arguments referred as terms, this
interface provides methods to substitute and exchange those terms.
|
| Conjuctable
Formulas implementing this interface can be connected by using
AND.
|
| Disjunctable
Formulas implementing this interface can be connected using
OR.
|
| Invertable
Formulas implementing this interface have a
complement
|
| LogicStructure
This interface captures the common functionalities of formulas,
sorts and terms.
|
| ProbabilityAware |
| QuantifiedFormula
Interface for a QuantifiedFormula with a set of quantified variables
implementing an all- or exist-quantor for example.
|
| SimpleLogicalFormula
A formula of a logical language
|
| Term
A term of a logical language, that can be given as argument for logical constructs
like atoms or functors.
|
| Class and Description |
|---|
| Term
A term of a logical language, that can be given as argument for logical constructs
like atoms or functors.
|
| TypedStructure
This interface defines method which are given by every TypedStructure like a
Predicate or an Functor.
|
| Class and Description |
|---|
| Term
A term of a logical language, that can be given as argument for logical constructs
like atoms or functors.
|
| Class and Description |
|---|
| AssociativeFormula
This interfaces describes associative formulas like a disjunction or
a conjunction.
|
| Atom
An atomic language construct, linked to its predicate
|
| Atom.RETURN_SET_PREDICATE
An enum containing the different return values of the
setPredicate() method of Atom.
|
| ClassicalFormula
This interface models a classical formula, i.e.
|
| ComplexLogicalFormula
A complex logical formula can contain arguments referred as terms, this
interface provides methods to substitute and exchange those terms.
|
| Conjuctable
Formulas implementing this interface can be connected by using
AND.
|
| Disjunctable
Formulas implementing this interface can be connected using
OR.
|
| Invertable
Formulas implementing this interface have a
complement
|
| LogicStructure
This interface captures the common functionalities of formulas,
sorts and terms.
|
| ProbabilityAware |
| QuantifiedFormula
Interface for a QuantifiedFormula with a set of quantified variables
implementing an all- or exist-quantor for example.
|
| SimpleLogicalFormula
A formula of a logical language
|
| Term
A term of a logical language, that can be given as argument for logical constructs
like atoms or functors.
|
| Class and Description |
|---|
| Term
A term of a logical language, that can be given as argument for logical constructs
like atoms or functors.
|
| Class and Description |
|---|
| ClassicalFormula
This interface models a classical formula, i.e.
|
| ComplexLogicalFormula
A complex logical formula can contain arguments referred as terms, this
interface provides methods to substitute and exchange those terms.
|
| Conjuctable
Formulas implementing this interface can be connected by using
AND.
|
| Disjunctable
Formulas implementing this interface can be connected using
OR.
|
| Invertable
Formulas implementing this interface have a
complement
|
| LogicStructure
This interface captures the common functionalities of formulas,
sorts and terms.
|
| ProbabilityAware |
| QuantifiedFormula
Interface for a QuantifiedFormula with a set of quantified variables
implementing an all- or exist-quantor for example.
|
| SimpleLogicalFormula
A formula of a logical language
|
| Term
A term of a logical language, that can be given as argument for logical constructs
like atoms or functors.
|
| Class and Description |
|---|
| ProbabilityAware |
| SimpleLogicalFormula
A formula of a logical language
|
| Class and Description |
|---|
| AssociativeFormula
This interfaces describes associative formulas like a disjunction or
a conjunction.
|
| Atom
An atomic language construct, linked to its predicate
|
| Atom.RETURN_SET_PREDICATE
An enum containing the different return values of the
setPredicate() method of Atom.
|
| ClassicalFormula
This interface models a classical formula, i.e.
|
| Conjuctable
Formulas implementing this interface can be connected by using
AND.
|
| Disjunctable
Formulas implementing this interface can be connected using
OR.
|
| Invertable
Formulas implementing this interface have a
complement
|
| ProbabilityAware |
| SimpleLogicalFormula
A formula of a logical language
|
| Term
A term of a logical language, that can be given as argument for logical constructs
like atoms or functors.
|
| TypedStructure
This interface defines method which are given by every TypedStructure like a
Predicate or an Functor.
|
| Class and Description |
|---|
| ClassicalFormula
This interface models a classical formula, i.e.
|
| ComplexLogicalFormula
A complex logical formula can contain arguments referred as terms, this
interface provides methods to substitute and exchange those terms.
|
| Conjuctable
Formulas implementing this interface can be connected by using
AND.
|
| Disjunctable
Formulas implementing this interface can be connected using
OR.
|
| Invertable
Formulas implementing this interface have a
complement
|
| LogicStructure
This interface captures the common functionalities of formulas,
sorts and terms.
|
| ProbabilityAware |
| QuantifiedFormula
Interface for a QuantifiedFormula with a set of quantified variables
implementing an all- or exist-quantor for example.
|
| SimpleLogicalFormula
A formula of a logical language
|
| Term
A term of a logical language, that can be given as argument for logical constructs
like atoms or functors.
|
| Class and Description |
|---|
| ClassicalFormula
This interface models a classical formula, i.e.
|
| ComplexLogicalFormula
A complex logical formula can contain arguments referred as terms, this
interface provides methods to substitute and exchange those terms.
|
| Conjuctable
Formulas implementing this interface can be connected by using
AND.
|
| Disjunctable
Formulas implementing this interface can be connected using
OR.
|
| Invertable
Formulas implementing this interface have a
complement
|
| LogicStructure
This interface captures the common functionalities of formulas,
sorts and terms.
|
| ProbabilityAware |
| QuantifiedFormula
Interface for a QuantifiedFormula with a set of quantified variables
implementing an all- or exist-quantor for example.
|
| SimpleLogicalFormula
A formula of a logical language
|
| Term
A term of a logical language, that can be given as argument for logical constructs
like atoms or functors.
|
| Class and Description |
|---|
| Term
A term of a logical language, that can be given as argument for logical constructs
like atoms or functors.
|
| Class and Description |
|---|
| ClassicalFormula
This interface models a classical formula, i.e.
|
| ComplexLogicalFormula
A complex logical formula can contain arguments referred as terms, this
interface provides methods to substitute and exchange those terms.
|
| Conjuctable
Formulas implementing this interface can be connected by using
AND.
|
| Disjunctable
Formulas implementing this interface can be connected using
OR.
|
| Invertable
Formulas implementing this interface have a
complement
|
| LogicStructure
This interface captures the common functionalities of formulas,
sorts and terms.
|
| ProbabilityAware |
| QuantifiedFormula
Interface for a QuantifiedFormula with a set of quantified variables
implementing an all- or exist-quantor for example.
|
| SimpleLogicalFormula
A formula of a logical language
|
| Term
A term of a logical language, that can be given as argument for logical constructs
like atoms or functors.
|
| Class and Description |
|---|
| AssociativeFormula
This interfaces describes associative formulas like a disjunction or
a conjunction.
|
| Atom
An atomic language construct, linked to its predicate
|
| SimpleLogicalFormula
A formula of a logical language
|
| Class and Description |
|---|
| SimpleLogicalFormula
A formula of a logical language
|
| Class and Description |
|---|
| Term
A term of a logical language, that can be given as argument for logical constructs
like atoms or functors.
|
| Class and Description |
|---|
| AssociativeFormula
This interfaces describes associative formulas like a disjunction or
a conjunction.
|
| Atom
An atomic language construct, linked to its predicate
|
| Atom.RETURN_SET_PREDICATE
An enum containing the different return values of the
setPredicate() method of Atom.
|
| ComplexLogicalFormula
A complex logical formula can contain arguments referred as terms, this
interface provides methods to substitute and exchange those terms.
|
| Disjunctable
Formulas implementing this interface can be connected using
OR.
|
| Invertable
Formulas implementing this interface have a
complement
|
| LogicProgram
An interface for a logic program, which is a set of rules.
|
| LogicStructure
This interface captures the common functionalities of formulas,
sorts and terms.
|
| SimpleLogicalFormula
A formula of a logical language
|
| Term
A term of a logical language, that can be given as argument for logical constructs
like atoms or functors.
|
| TypedStructure
This interface defines method which are given by every TypedStructure like a
Predicate or an Functor.
|
| Class and Description |
|---|
| ClassicalFormula
This interface models a classical formula, i.e.
|
| ComplexLogicalFormula
A complex logical formula can contain arguments referred as terms, this
interface provides methods to substitute and exchange those terms.
|
| Conjuctable
Formulas implementing this interface can be connected by using
AND.
|
| Disjunctable
Formulas implementing this interface can be connected using
OR.
|
| Invertable
Formulas implementing this interface have a
complement
|
| LogicProgram
An interface for a logic program, which is a set of rules.
|
| LogicStructure
This interface captures the common functionalities of formulas,
sorts and terms.
|
| ProbabilityAware |
| QuantifiedFormula
Interface for a QuantifiedFormula with a set of quantified variables
implementing an all- or exist-quantor for example.
|
| SimpleLogicalFormula
A formula of a logical language
|
| Term
A term of a logical language, that can be given as argument for logical constructs
like atoms or functors.
|