package acgtk
Abstract Categorial Grammar development toolkit
Install
Dune Dependency
Authors
Maintainers
Sources
acgtk-1.5.3.tar.gz
sha256=2743321ae4cc97400856eb503a876cbcbd08435ebc750276399a97481d001d41
md5=04c1e14f98e2c8fd966ef7ef30b38323
doc/acgtkLib.datalogLib/DatalogLib/Datalog/Make/Program/index.html
Module Make.Program
Source
Source
type program = {
rules : Rule.Rules.t Predicate.PredMap.t;
edb : ASPred.pred_id list;
edb_facts : Predicate.FactSet.t Predicate.PredMap.t;
idb : ASPred.pred_id list;
pred_table : ASPred.PredIdTable.table;
const_table : Datalog_AbstractSyntax.ConstGen.Table.table;
rule_id_gen : UtilsLib.IdGenerator.IntIdGen.t;
}
Source
val temp_facts :
Rule.rule ->
Rule.FactArray.row Predicate.PredMap.t ->
Rule.FactArray.row Predicate.PredMap.t ->
Rule.FactArray.row Predicate.PredMap.t ->
Rule.FactArray.row Predicate.PredMap.t ->
((ASPred.predicate * Predicate.FactSet.elt list) -> Rule.rule -> 'a -> 'a) ->
'a ->
ASPred.PredIdTable.table ->
Datalog_AbstractSyntax.ConstGen.Table.table ->
'a
Source
val p_semantics_for_predicate :
Predicate.PredMap.key ->
program ->
Rule.FactArray.row Predicate.PredMap.t ->
Rule.FactArray.row Predicate.PredMap.t ->
Rule.FactArray.row Predicate.PredMap.t ->
Rule.FactArray.row Predicate.PredMap.t ->
Predicate.PremiseSet.t Predicate.PredicateMap.t ->
Predicate.FactSet.t * Predicate.PremiseSet.t Predicate.PredicateMap.t
Source
val seminaive :
program ->
Rule.FactArray.row Predicate.PredMap.t
* Predicate.PremiseSet.t Predicate.PredicateMap.t
Source
val add_e_facts :
program ->
(ASRule.rule list
* Datalog_AbstractSyntax.ConstGen.Table.table
* UtilsLib.IdGenerator.IntIdGen.t) ->
program
add_rule i r p
adds a ASRule.rule
to a Datalog.Program
with the assumption that it will not change the nature of any predicate (that is making it change from extensional to intensional). If i
is set to true, then the rule concerns an intensional predicate. If it is set to false
then it concerns an extensional predicate and the rhs of the rule should be empty.
remove_rule id p
returns the program p
from which the rule with id id
has been removed.
IMPORTANT: This function only deals with rules introducing intensional predicate, because it is used when a constant is given several interpretations in a lexicon.
Source
val build_forest :
?query:Datalog_AbstractSyntax.AbstractSyntax.Predicate.predicate ->
Predicate.PremiseSet.t Predicate.PredicateMap.t ->
program ->
int UtilsLib.SharedForest.SharedForest.tree list list
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>