Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Model_elimination> ?p ?o }
Showing triples 1 to 32 of
32
with 100 triples per page.
- Model_elimination abstract "Model Elimination is the name attached to a pair of proof procedures invented by Donald W. Loveland, the first of which was published in 1968 in the Journal of the ACM. Their primary purpose is to carry out automated theorem proving, though they can readily be extended to logic programming, including the more general disjunctive logic programming.Model Elimination is closely related to resolutionwhile also bearing characteristics of a Tableaux method. It is a progenitor of the SLD resolution procedure used in the Prolog logic programming language.While somewhat eclipsed by attention to and progress in Resolutiontheorem provers, Model Elimination has continued to attract theattention of researchers and software developers. Today there are several theorem provers under active development that are based on the Model Elimination procedure.".
- Model_elimination wikiPageID "4073971".
- Model_elimination wikiPageLength "1177".
- Model_elimination wikiPageOutDegree "12".
- Model_elimination wikiPageRevisionID "552778166".
- Model_elimination wikiPageWikiLink Automated_theorem_proving.
- Model_elimination wikiPageWikiLink Category:Automated_theorem_proving.
- Model_elimination wikiPageWikiLink Category:Logic_in_computer_science.
- Model_elimination wikiPageWikiLink Category:Logical_calculi.
- Model_elimination wikiPageWikiLink Disjunctive_logic_programming.
- Model_elimination wikiPageWikiLink Donald_W._Loveland.
- Model_elimination wikiPageWikiLink Logic_programming.
- Model_elimination wikiPageWikiLink Method_of_analytic_tableaux.
- Model_elimination wikiPageWikiLink Prolog.
- Model_elimination wikiPageWikiLink Proof_procedure.
- Model_elimination wikiPageWikiLink Resolution_(logic).
- Model_elimination wikiPageWikiLink SLD_resolution.
- Model_elimination wikiPageWikiLinkText "Model elimination".
- Model_elimination wikiPageWikiLinkText "model elimination".
- Model_elimination subject Category:Automated_theorem_proving.
- Model_elimination subject Category:Logic_in_computer_science.
- Model_elimination subject Category:Logical_calculi.
- Model_elimination hypernym Name.
- Model_elimination type Method.
- Model_elimination type Proof.
- Model_elimination comment "Model Elimination is the name attached to a pair of proof procedures invented by Donald W. Loveland, the first of which was published in 1968 in the Journal of the ACM. Their primary purpose is to carry out automated theorem proving, though they can readily be extended to logic programming, including the more general disjunctive logic programming.Model Elimination is closely related to resolutionwhile also bearing characteristics of a Tableaux method.".
- Model_elimination label "Model elimination".
- Model_elimination sameAs Q6888321.
- Model_elimination sameAs m.0bgr_8.
- Model_elimination sameAs Q6888321.
- Model_elimination wasDerivedFrom Model_elimination?oldid=552778166.
- Model_elimination isPrimaryTopicOf Model_elimination.