EconBiz - Find Economic Literature
    • Logout
    • Change account settings
  • A-Z
  • Beta
  • About EconBiz
  • News
  • Thesaurus (STW)
  • Academic Skills
  • Help
  •  My account 
    • Logout
    • Change account settings
  • Login
EconBiz - Find Economic Literature
Publications Events
Search options
Advanced Search history
My EconBiz
Favorites Loans Reservations Fines
    You are here:
  • Home
  • Search: subject:"Extended quantifier elimination"
Narrow search

Narrow search

Year of publication
Subject
All
Automated theorem proving 1 CAD 1 Extended quantifier elimination 1 Groebner Bases 1
Online availability
All
Undetermined 1
Type of publication
All
Article 1
Language
All
Undetermined 1
Author
All
Buchberger, Bruno 1 Jebelean, Tudor 1 Vajda, Robert 1
Published in...
All
Mathematics and Computers in Simulation (MATCOM) 1
Source
All
RePEc 1
Showing 1 - 1 of 1
Cover Image
Combining logical and algebraic techniques for natural style proving in elementary analysis
Vajda, Robert; Jebelean, Tudor; Buchberger, Bruno - In: Mathematics and Computers in Simulation (MATCOM) 79 (2009) 8, pp. 2310-2316
PCS (Proving-Computing-Solving) introduced by B. Buchberger in 2001 and S-Decomposition, introduced by T. Jebelean in 2001, are strategies for handling proof problems by combining logic inference steps (e.g., modus ponens, Skolemization, instantiation) with rewriting steps (application of...
Persistent link: https://www.econbiz.de/10010749986
Saved in:
A service of the
zbw
  • Sitemap
  • Plain language
  • Accessibility
  • Contact us
  • Imprint
  • Privacy

Loading...