Meaning¶
Inference¶
This class stores both a prover and a model builder and when either prove() or build_model() is called, then both theorem tools are run in parallel. |
|
This command stores both a prover and a model builder and when either prove() or build_model() is called, then both theorem tools are run in parallel. |
|
Check properties of an ongoing discourse. |
|
|
|
A |
|
|
|
A |
|
Semantics¶
|
This class is an interface to Johan Bos's program Boxer, a wide-coverage semantic parser that produces Discourse Representation Structures (DRSs). |
A Discourse Representation Structure. |
|
This is the base abstract DRT Expression from which every DRT Expression extends. |
|
A dictionary which represents an assignment of values to variables. |
|
A first order model is a domain D of discourse and a valuation V. |
|
A dictionary which represents a model-theoretic Valuation of non-logical constants. |
|
|
Check the arity of a relation. |
|
Check whether a set represents a relation (of any arity). |
|
Convert a valuation string into a valuation. |
|
Convert a set containing individuals (strings or numbers) into a set of unary tuples. |
This class is used to represent two related types of logical expressions. |
|
This is the base abstract object for all logical expressions |
|
Binding operators |
|
Boolean operators |
|
Equality predicates |
|
|
Convert a file of First Order Formulas into a list of {Expression}s. |
|
Print the relation in clausal form. |
|
Filter the output of |
|
Pretty print the reldict as an rtuple. |
|
Skolemize the expression and convert to conjunctive normal form (CNF) |
|
Add the truth-in-a-model value to each semantic representation for each syntactic parse of each input sentences. |
|
Add the semantic representation to each syntactic parse tree of each input sentence. |
|
Convert input sentences into syntactic trees. |
|
Find the semantic representation at the root of a tree. |