reasoning

I have a serious problem to get any reasoner up and running. Also the examples from the documentation: https://jena.apache.org/documentation/inference/ does not work here. I transferred the example into a unit test, so that the problem might be easier reproduced. Is reasoning limited to certain environment like a spatial JDK or so on, or am i getting something wrong? Thanks Here the example code (as java unit test): import static org.junit.Assert.assertNotNull; import java.io.PrintWriter; import java.util.Iterator; import org.junit.Before; import org.junit.Test; import com.hp.hpl.jena.rdf

I'm trying to infer data using Pellet, but my application always crashes during reasoning due to an "OutOfMemoryError: Java heap space". As suggested elsewhere I have already tried to increase heap size and currently I am using these VM arguments: "-XX:MaxPermSize=256m -Xmx6144m". Furthermore I've to set 'PelletOptions.USE_CONTINUOUS = true', but so far I was only able delays the crashs for some minutes. (Longest run so far: 30 min.). I am storing data in a Jena TDB triplestore. Its total size is 170 mb and consists of 962117 statements. The ontology has been modelled in Protege and there are

it's my first time writing here but i'm really struck with a problem: is it possible to use the Jena reasoner on a No-SQL database, like Neo4J, already filled with data? I've a Neo4J's graph rappresenting a bunch of triples and I would like to use the Jena API and the Jena reasoner on them. I thought about using the SDB/TDB component of Jena but I don't get how to actually load the data into my model since the SDB component seems to work with just SQL databases and the go throught the whole TDB javadoc seems to be a bit too much. Should I define some kind of configuration file for the TDB

I am stuck on Kripke semantics , and wonder if there is educational software through which I can test equivalence of statements etc, since Im starting to think its easier to learn by example (even if on abstract variables). I will use ☐A to write necessarily A ♢A for possibly A do ☐true, ☐false, ♢true, ♢false evaluate to values, if so what values or kinds of values from what set ({true, false} or perhaps {necessary,possibly})? [1] I think I read all Kripke models use the duality axiom : (☐A)->(¬♢¬A) i.e. if its necessary to paytax then its not allowed to not paytax (irrespective of wheither

Let's say we have two classes named People and Disease . These classes are related by the Object Property has . :People :has :Disease People has subclass (or individual) John , and Disease has subclass (or individual) Cancer . :John a :People :Cancer a :Disease How can we get the relationship between these subclasses by inference? :John :has :Cancer Before you can get to an answer, there are a number of misconceptions you'll need to resolve. First, subclass and individual are very different concepts. Individuals (instances) are members of classes. Subclass denotes a class is a subset of

I have question based on the topic: SOF - Einstein puzzle in OWL In the owl, all cardinality restrictions are based on functional and inverse functional properties of Object Properties. I have remodeled it using QCRs. Old model (example): man drinks some beverage; drinks -> functional, inferse functional New model /EDITED/ : man drinks exactly 1 beverage; beverage drinkedBy exactly 1 man; drinks -> domain:man, range:beverage drinkedBy -> domain:beverage, range:man drinks inverseOf drinkedBy I replaced all "some" with "exactly 1". I think the first type is equivalent to the second model, but