872 search results - page 115 / 175 » Using Plans to Automate Software Applications |
SAC
2009
ACM
14 years 3 months ago
2009
ACM
This paper deals with the development and use of business cases in support of cross-organizational enterprise resource planning (ERP)-enabled e-business integration initiatives. I...
CAV
2007
Springer
14 years 25 days ago
2007
Springer
Abstract. Solvers for satisfiability modulo theories (SMT) check the satisfiability of first-order formulas containing operations from various theories such as the Booleans, bit-ve...
SIGUCCS
2000
ACM
14 years 1 months ago
2000
ACM
The University of Pittsburgh's Computing Services and Systems Development organization is focused on the needs of the faculty and student population, totaling nearly 40,000 u...
CAV
2012
Springer
11 years 11 months ago
2012
Springer
Abstract. A minimum satisfying assignment of a formula is a minimumcost partial assignment of values to the variables in the formula that guarantees the formula is true. Minimum sa...
ICCBR
2001
Springer
14 years 1 months ago
2001
Springer
It is useful for an intelligent software agent to be able to adapt to new demands from an environment. Such adaptation can be viewed as a redesign problem; an agent has some origin...