NAME¶

eye - Euler Yet another proof Engine (EYE) semantic web reasoning engine

SYNOPSIS¶

eye.pvm <options>* <data>* <query>*

DESCRIPTION¶

eye --help EYE v22.0203.1955 josd SWI-Prolog version 8.4.2 starting 47 [msec cputime] 39 [msec walltime]

<options>

--csv-separator <separator>

CSV separator such as , or ;

--debug

output debug info on stderr

--debug-cnt

output debug info about counters on stderr

--debug-djiti

output debug info about DJITI on stderr

--debug-n3p

output debug info about N3P code on stderr

--debug-pvm

output debug info about PVM code on stderr

--help

show help info

--hmac-key <key>

HMAC key used in e:hmac-sha built-in

--ignore-inference-fuse

do not halt in case of inference fuse

--image <pvm-file>

output all <data> and all code to <pvm-file>

--license

show license info

--no-distinct-input

no distinct triples in the input

--no-distinct-output

no distinct answers in the output

--no-numerals

no numerals in the output

--no-qnames

no qnames in the output

--no-qvars

no qvars in the output

--nope

no proof explanation

--profile

output profile info on stderr

--quantify <prefix>

quantify uris with <prefix> in the output

--quiet

quiet mode

--random-seed

create random seed for e:random built-in

--restricted

restricting to core built-ins

--rule-histogram

output rule histogram info on stderr

--skolem-genid <genid>

use <genid> in Skolem IRIs

--source <file>

read command line arguments from <file>

--statistics

output statistics info on stderr

--strings

output log:outputString objects on stdout

--tactic limited-answer <count> give only a limited number of answers

--tactic limited-brake <count>

take only a limited number of brakes

--tactic limited-step <count>

take only a limited number of steps

--tactic linear-select

select each rule only once

--version

show version info

--warn

output warning info on stderr

--wcache <uri> <file>

to tell that <uri> is cached as <file>

<data>

[--n3] <uri>

N3 triples and rules

--blogic <uri>

RDF surfaces

--proof <uri>

N3 proof lemmas

<query>

--entail <rdf-graph>

output true if RDF graph is entailed

--not-entail <rdf-graph>

output true if RDF graph is not entailed

--pass

output deductive closure

--pass-all

output deductive closure plus rules

--pass-all-ground

ground the rules and run --pass-all

--pass-only-new

output only new derived triples

--query <n3-query>

output filtered with filter rules

EYE v22.0203.1955 josd SWI-Prolog version 8.4.2 starting 62 [msec cputime] 55 [msec walltime]