This HTML5 document contains 38 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n15https://wwwlehre.dhbw-stuttgart.de/~sschulz/DHBW_Stephan_Schulz/
n12https://global.dbpedia.org/id/
n16https://github.com/Z3Prover/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n11https://wwwlehre.dhbw-stuttgart.de/~sschulz/E/
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbchttp://dbpedia.org/resource/Category:
provhttp://www.w3.org/ns/prov#
dbphttp://dbpedia.org/property/
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
n17http://cvc4.cs.stanford.edu/web/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:E_(theorem_prover)
rdfs:label
E (theorem prover)
rdfs:comment
E is a high-performance theorem prover for full first-order logic with equality. It is based on the equational superposition calculus and uses a purely equational paradigm. It has been integrated into other theorem provers and it has been among the best-placed systems in several theorem proving competitions. E is developed by Stephan Schulz, originally in the Automated Reasoning Group at TU Munich, now at Baden-Württemberg Cooperative State University Stuttgart.
dcterms:subject
dbc:Free_theorem_provers dbc:Free_software_programmed_in_C dbc:Unix_programming_tools
dbo:wikiPageID
265268
dbo:wikiPageRevisionID
1096975339
dbo:wikiPageWikiLink
dbc:Free_software_programmed_in_C dbr:Conjunctive_normal_form dbr:Vampire_(theorem_prover) dbr:SPASS dbr:Automated_theorem_proving dbr:Many-sorted_logic dbr:Baden-Württemberg_Cooperative_State_University dbr:Superposition_calculus dbr:Technical_University_of_Munich dbr:GNU_General_Public_License dbr:C_(programming_language) dbc:Free_theorem_provers dbc:Unix_programming_tools dbr:Term_indexing dbr:Isabelle_(theorem_prover) dbr:Unix dbr:CADE_ATP_System_Competition dbr:Cygwin dbr:First-order_logic
dbo:wikiPageExternalLink
n11:E.html n15:Stephan_Schulz.html n16:z3 n17:
owl:sameAs
wikidata:Q5324845 n12:4izjM
dbp:wikiPageUsesTemplate
dbt:Use_dmy_dates dbt:Reflist
dbo:abstract
E is a high-performance theorem prover for full first-order logic with equality. It is based on the equational superposition calculus and uses a purely equational paradigm. It has been integrated into other theorem provers and it has been among the best-placed systems in several theorem proving competitions. E is developed by Stephan Schulz, originally in the Automated Reasoning Group at TU Munich, now at Baden-Württemberg Cooperative State University Stuttgart.
prov:wasDerivedFrom
wikipedia-en:E_(theorem_prover)?oldid=1096975339&ns=0
dbo:wikiPageLength
9065
foaf:isPrimaryTopicOf
wikipedia-en:E_(theorem_prover)