Sciweavers

1912 search results - page 244 / 383
» On the evaluation of argumentation formalisms
Sort
View
AGP
1995
IEEE
15 years 10 months ago
Domain Independent Ask Approximation in CCP
The main difficulty in the formalization of a static analysis framework for CC programs is probably related to the correct approximation of the entailment relation between constrai...
Enea Zaffanella
DBKDA
2009
IEEE
88views Database» more  DBKDA 2009»
15 years 9 months ago
Replay the Execution History of Rule-Based Information
Software systems in health care, such as disease and medical-record management, or financial applications, such as customer relationship and portfolio management, have very often...
Essam Mansour, Hagen Höpfner
BMVC
2002
15 years 8 months ago
Saliency of Interest Points under Scale Changes
Interest point detectors are commonly employed to reduce the amount of data to be processed. The ideal interest point detector would robustly select those features which are most ...
Daniela Hall, Bastian Leibe, Bernt Schiele
AAAI
2008
15 years 8 months ago
Fusing Procedural and Declarative Planning Goals for Nondeterministic Domains
While in most planning approaches goals and plans are different objects, it is often useful to specify goals that combine declarative conditions with procedural plans. In this pap...
Dmitry Shaparau, Marco Pistore, Paolo Traverso
AAAI
2007
15 years 8 months ago
PLOW: A Collaborative Task Learning Agent
To be effective, an agent that collaborates with humans needs to be able to learn new tasks from humans they work with. This paper describes a system that learns executable task m...
James F. Allen, Nathanael Chambers, George Ferguso...