Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Superposition_calculus> ?p ?o }
Showing triples 1 to 42 of
42
with 100 triples per page.
- Superposition_calculus abstract "The superposition calculus is a calculus for reasoning in equational first-order logic. It has been developed in the early 1990s and combines concepts from first-order resolution with ordering-based equality handling as developed in the context of (unfailing) Knuth–Bendix completion. It can be seen as a generalization of either resolution (to equational logic) or unfailing completion (to full clausal logic). As most first-order calculi, superposition tries to show the unsatisfiability of a set of first-order clauses, i.e. it performs proofs by refutation. Superposition is refutation-complete — given unlimited resources and a fair derivation strategy, from any unsatisfiable clause set a contradiction will eventually be derived.As of 2007, most of the (state-of-the-art) theorem provers for first-order logic are based on superposition (e.g. the E equational theorem prover), although only a few implement the pure calculus.".
- Superposition_calculus wikiPageExternalLink ayane.
- Superposition_calculus wikiPageID "2648614".
- Superposition_calculus wikiPageLength "1783".
- Superposition_calculus wikiPageOutDegree "21".
- Superposition_calculus wikiPageRevisionID "611708869".
- Superposition_calculus wikiPageWikiLink Automated_theorem_proving.
- Superposition_calculus wikiPageWikiLink Ayane_theorem_prover.
- Superposition_calculus wikiPageWikiLink Category:Logical_calculi.
- Superposition_calculus wikiPageWikiLink Category:Mathematical_logic.
- Superposition_calculus wikiPageWikiLink Clause.
- Superposition_calculus wikiPageWikiLink E_theorem_prover.
- Superposition_calculus wikiPageWikiLink Elsevier.
- Superposition_calculus wikiPageWikiLink First-order_logic.
- Superposition_calculus wikiPageWikiLink Formal_system.
- Superposition_calculus wikiPageWikiLink Handbook_of_Automated_Reasoning.
- Superposition_calculus wikiPageWikiLink Knuth–Bendix_completion_algorithm.
- Superposition_calculus wikiPageWikiLink MIT_Press.
- Superposition_calculus wikiPageWikiLink Objection_(argument).
- Superposition_calculus wikiPageWikiLink Resolution_(logic).
- Superposition_calculus wikiPageWikiLink SPASS.
- Superposition_calculus wikiPageWikiLink Satisfiability.
- Superposition_calculus wikiPageWikiLink Vampire_(theorem_prover).
- Superposition_calculus wikiPageWikiLink Waldmeister_theorem_prover.
- Superposition_calculus wikiPageWikiLinkText "Superposition calculus".
- Superposition_calculus wikiPageWikiLinkText "Superposition".
- Superposition_calculus wikiPageWikiLinkText "purely equational calculus".
- Superposition_calculus wikiPageWikiLinkText "superposition calculus".
- Superposition_calculus wikiPageWikiLinkText "superposition".
- Superposition_calculus wikiPageUsesTemplate Template:Mathlogic-stub.
- Superposition_calculus subject Category:Logical_calculi.
- Superposition_calculus subject Category:Mathematical_logic.
- Superposition_calculus type Field.
- Superposition_calculus type Method.
- Superposition_calculus comment "The superposition calculus is a calculus for reasoning in equational first-order logic. It has been developed in the early 1990s and combines concepts from first-order resolution with ordering-based equality handling as developed in the context of (unfailing) Knuth–Bendix completion. It can be seen as a generalization of either resolution (to equational logic) or unfailing completion (to full clausal logic).".
- Superposition_calculus label "Superposition calculus".
- Superposition_calculus sameAs Q7644107.
- Superposition_calculus sameAs Càlcul_de_superposició.
- Superposition_calculus sameAs m.07v7jn.
- Superposition_calculus sameAs Q7644107.
- Superposition_calculus wasDerivedFrom Superposition_calculus?oldid=611708869.
- Superposition_calculus isPrimaryTopicOf Superposition_calculus.