1997 | ReviewPaper | Buchkapitel
Computing, solving, proving: A report on the Theorema project
Invited Talk
verfasst von : Bruno Buchberger
Erschienen in: Logic Programming And Nonmonotonic Reasoning
Verlag: Springer Berlin Heidelberg
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
In an oversimplified and abstract view, given a logic (syntax, semantics, inference system) L and a knowledge base K of formulae in L.“computer” for K enables the user to provide an expression (term, formula, program) T with a free variable x and a value υ (from an appropriate domain) and “evaluates” Tx←υ (T with υ substituted for x) w.r.t. K in L.“solver” for K enables the user to provide an expression T with a free variable x and produces (all) values υ for which Tx←υ holds w.r.t. K in L, and“prover” for K enables the user to provide an expression T with a free variable x and generates a proof (or disproves) that, for all values υ, Tx←υ holds w.r.t. K in L.