Questions tagged [reasoning]

For questions relating to reasoning tasks that can be be performed by programming tools. To be used with relevant tool, language and environment tags. Not to be use for questions related to program logic or algorithms, or the act of human reasoning. Reasoning tools are based on either a rule engine, OWL, RDFS, and can be inclusions in tools such as Jena, Oracle Spatial, or add ons such as Pellet.

For questions relating to reasoning tasks that can be be performed by programming tools. To be used with relevant tool, language and environment tags. Not to be related to program logic or algorithms, or the act of human reasoning.

Reasoning tools are based on either a rule engine, OWL, RDFS, and can be inclusions in tools such as Jena, Oracle Spatial, or add ons such as Pellet.

Recent releases and modified reasoners:

  • Jena, a Java RDF API and toolkit (last modified: 19 January 2016)
  • ELK (last modified: 14 January 2016)
  • RDFSharp (last modified: 22 December 2015)
  • Stardog (last modified: 27 March 2015)
  • Blazegraph (Formerly Bigdata®) (last modified: 18 February 2015)
248 questions
0
votes
1 answer

OWLKnowledgeExplorerReasoner - getObjectLabel always ends in error Unreachable situation

I am trying to access information about completion graph, but everytime it ends with error uk.ac.manchester.cs.jfact.helpers.UnreachableSituationException: Unreachable situation! when I call getObjectLabel(rootNode, false/true). I was trying it on…
bobo3
  • 1
  • 1
0
votes
1 answer

How is: "A subclassOf of B, C" interpreted? As AND or OR in rdfs / owl / description logic?

Is the following interpreted as the intersection (AND) in the sense that members of class A are members of B and C; or as the disjunction (OR) that members of A are a member of B, or a member of C, or member of both? A rdf:type owl:Class ; …
user3352632
  • 617
  • 6
  • 18
0
votes
1 answer

OWLAPI: Reasoning over ontology with disjunctions

I have an ontology with one individual a and 6 classes (A, B, C, D, E, F). Individual belongs to the following disjunctions: (A or B; C or D; E or F). There is some way how can I infer that an individual has to be in one of the two classes from each…
IvetX
  • 1
  • 3
0
votes
1 answer

How to distinguish ontology individuals with same name

I am creating an ontology where the case occurred, that multiple individuals have the same name. Normally, I would create the IRI based on the name. E.g. Paul Paul Peter Hans The only way to distinguish the individuals is based on their…
Felix Z.
  • 317
  • 2
  • 12
0
votes
2 answers

Print the number of ways in which you can pay the amount as described

In how many ways, can you pay N dollar with 1 dollar, 2 dollar & 5 dollar denominations, in such a way that the number of 1 dollar coins are always greater than that of 2 dollar coins and number of 2 dollar coins are always greater than that of 5…
Vaibhav Atray
  • 208
  • 4
  • 14
0
votes
0 answers

How to know inferencing/reasoning level of any RDF

I am new in this area; I would like to know how to know the level of inferencing/reasoning supported by RDF, any idea to calculate the level of inferencing in Jena. Looking forward to your kind reply
bamboat_3
  • 11
  • 1
  • 6
0
votes
1 answer

reason over a rather large ontology

I have a rather large ontology (about 80 GB). I think the reasoner brings the whole ontology into the memory for reasoning process, doesn't it? is there any way to reason over a 80 GB ontology with 16 GB of RAM?
hitter
  • 3
  • 1
0
votes
2 answers

How to calculate no of matches in given days

We have 16 teams and 2 grounds. Both 2 grounds available for 60 min on Monday and 120 min on Tuesdays. That means 2 matches can be possible on Monday and 4 matches on Tuesday. If one team can not play the match again on the same day how many matches…
Satanand Tiwari
  • 486
  • 4
  • 21
0
votes
0 answers

Inference in virtuoso 7.x

I am reading that virtuoso 7.x does not support SWRL but is there an alternative way to achieve (in Virtuoso 7.x) the following: Given: . . Infer: . Any sort of suggestion…
0
votes
1 answer

Reasoning over functions applied to lists of nat in Coq

We are working on verifying a system with three functions that looks like the following. However, we do not know how to proceed further with proofs like this. Actual definitions of the Coq functions may be shared. Kindly guide us. Parameter weights…
Khan
  • 303
  • 2
  • 14
0
votes
0 answers

Need an algorithm to compute all possible inferences

I am making a static RDFS-Plus inference engine. I have written a function that will make the appropriate inferences for all of the constructs included. For example if this function is passed the triple C1 rdf:subClassOf C2, then for all X's in…
Nicholas Hubbard
  • 527
  • 2
  • 15
0
votes
1 answer

How to compare properties in OWL?

How would I represent the following reasoning in OWL/Protege? If molecules of type A have longer carbon chains then molecules of type B, then the boiling point of A is greater than that for B. I unpack that statement as follows: A_1 has property…
mac389
  • 3,004
  • 5
  • 38
  • 62
0
votes
0 answers

How to parallelized OWLlink server for Konclude reasoning?

in some articles, I read that they have configured Konclude and Elk as parallel reasoners with different threads. How can I parallelize Konclude reasoning? can someone link me the useful documentation about it? Thank you very much Rita
Ritulla
  • 33
  • 3
0
votes
1 answer

How to turn off reasoning in the Grakn python client

I am using the Grakn python client and I want to query for data without reasoning turned on. client = GraknClient(uri=uri) session = client.session(keyspace=keyspace) tx = session.transaction().read() Do I pass an argument in the transaction()…
user7420209
  • 225
  • 2
  • 10
0
votes
1 answer

Error "rule graph is not stratifiable" in Grakn

I'm trying to insert this rule (data is masked): when { $d isa person; $a isa animal; $r (role-1: $d, role-2: $a) isa relation-1, has attr $ds; not {$r1 (role-3: $d, role-4: $a) isa relation-2; }; $ds > 0.5; }, then { …
user7420209
  • 225
  • 2
  • 10