Sciweavers

851 search results - page 25 / 171
» Inaccessibility in Decision Procedures
Sort
View
AAAI
1998
13 years 9 months ago
Procedural Help in Andes: Generating Hints Using a Bayesian Network Student Model
One of the most important problems for an intelligent tutoring system is deciding how to respond when a student asks for help. Responding cooperatively requires an understanding o...
Abigail S. Gertner, Cristina Conati, Kurt VanLehn
AISC
2008
Springer
13 years 9 months ago
MetiTarski: An Automatic Prover for the Elementary Functions
Many inequalities involving the functions ln, exp, sin, cos, etc., can be proved automatically by MetiTarski: a resolution theorem prover (Metis) modified to call a decision proced...
Behzad Akbarpour, Lawrence C. Paulson
CASC
2009
Springer
180views Mathematics» more  CASC 2009»
13 years 8 months ago
Effective Quantifier Elimination for Presburger Arithmetic with Infinity
We consider Presburger arithmetic extended by infinity. For this we give an effective quantifier elimination and decision procedure which implies also the completeness of our exten...
Aless Lasaruk, Thomas Sturm
ENTCS
2006
161views more  ENTCS 2006»
13 years 7 months ago
Tool Building Requirements for an API to First-Order Solvers
Effective formal verification tools require that robust implementations of automatic procedures for first-order logic and satisfiability modulo theories be integrated into express...
Jim Grundy, Thomas F. Melham, Sava Krstic, Sean Mc...
ECSA
2008
Springer
13 years 9 months ago
Automating Architecture Trade-Off Decision Making through a Complex Multi-attribute Decision Process
A typical software architecture design process requires the architects to make various trade-off architecture decisions. The architects need to consider different possibilities and...
Majid Makki, Ebrahim Bagheri, Ali A. Ghorbani