Package com.hp.hpl.jena.reasoner.rulesys.builtins

Implementations of the Builtin class which provides primitive operations to the rule engines.

See: Description

Class Summary

Class	Description
AddOne	Bind the second argument to 1+ the first argument.
AssertDisjointPairs	Assert the n^2 differtFrom pairs from a distinctMembers list
BaseBuiltin	Dummy implementation of the Builtin interface that specific implementations can inherit from.
Bound	Predicate used to check if a variable has been bound.
CountLiteralValues	CountLiteralValues(X, P, C) sets C to be the number of semantically distinct values for P on resource X.
Difference	Bind the third argument to the arithetic difference between the first and second aguments.
Drop	A variant of the "remove" builtin that will delete matched triples from the graph but will not trigger further rule processing for the removed triples.
Equal	Check that the two args are semantically equal.
GE	Tests if the first argument is greater than or equal to the second.
GreaterThan	Tests if the first argument is greater than the second.
Hide	Register a node as to be hidden from query result iterators.
IsBNode	Tests the single argument to make sure it is blank node.
IsDType	Tests whether the first argument is an instance of the datatype defined by the resource in the second argument.
IsFunctor	Tests the single argument to make sure it is not a Functor.
IsLiteral	Tests the single argument to make sure it is a literal.
LE	Tests if the first argument is less than or equal to the second.
LessThan	Tests if the first argument is less than the second.
ListContains	Returns true if the first argument is a list which contains the second argument.
ListEntry	listEntry(?list, ?index, ?val) will bind ?val to the ?index'th entry in the RDF list ?list.
ListEqual	Test if the two argument lists contain the same semantic elements.
ListLength	Bind the second arg to the length of the first arg treated as a list.
ListMapAsObject	For each element in the RDF list (third argument) it asserts triples with that as the object and subject and predicate given by arguments one and two.
ListMapAsSubject	For each element in the RDF list (first argument) it asserts triples with that as the subject and predicate and object given by arguments two and three.
ListNotContains	Returns false if the first argument is a list which contains the second argument.
ListNotEqual	Test if the two argument lists differ.
MakeInstance	Create or lookup an anonymous instance of a property value.
MakeSkolem	Bind a blank node to the first argument.
MakeTemp	Create a new anonymous node and bind it to the each argument
Max	Bind the third arg to the max of the first two args.
Min	Bind the third arg to the min of the first two args.
NotBNode	Tests the single argument to make sure it is not a blank node.
NotDType	Tests wheter the first argument is not an instance of the datatype defined by the resource in the second argument.
NotEqual	Check that the two args are different.
NotFunctor	Tests the single argument to make sure it is not a Functor.
NotLiteral	Tests the single argument to make sure it is a literal.
NoValue	Can be used in two arg form (X, P) or three arg form (X, P, V).
Now	Bind the first arg to the current date time in the current locale and timezone.
Print	Print its argument list as a side effect
Product	Bind the third arg to the product of the first two args.
Quotient	Bind the third arg to the ratio of the first two args.
Regex
Remove	Remove the body clause given by index arguments from the database.
StrConcat	Builtin which concatenates a set of strings.
Sum	Bind the third arg to the sum of the first two args.
Table	Arrange that the given predicate is tabled by the backchaining engine.
TableAll	Arrange that all backchaining goals should be tabled (aka memoized) by the LP engine.
Unbound	Predicate used to check if a variable has not been bound.
UriConcat	Builtin which concatenates a set of strings to generate a new URI.

Package com.hp.hpl.jena.reasoner.rulesys.builtins Description

Implementations of the Builtin class which provides primitive operations to the rule engines. The current set is small - just enought to implement OWL and demonstrate the principle of Builtin's - not comprehensive.