Sciweavers

858 search results - page 118 / 172
» Planning and defeasible reasoning
Sort
View
KR
1989
Springer
15 years 3 months ago
Situated Control Rules
In this work we extend the work of Dean, Kaelbling, Kirman and Nicholson on planning under time constraints in stochastic domains to handle more complicated scheduling problems. I...
Mark Drummond
AAAI
2007
15 years 2 months ago
An Experimental Comparison of Constraint Logic Programming and Answer Set Programming
Answer Set Programming (ASP) and Constraint Logic Programming over finite domains (CLP(FD)) are two declarative programming paradigms that have been extensively used to encode ap...
Agostino Dovier, Andrea Formisano, Enrico Pontelli
IJCAI
2001
15 years 1 months ago
Perceptual Anchoring of Symbols for Action
Anchoring is the process of creating and maintaining the correspondence between symbols and percepts that refer to the same physical objects. Although this process must necessaril...
Silvia Coradeschi, Alessandro Saffiotti
WIRTSCHAFTSINFORMATI
2003
15 years 1 months ago
Using Management Objectives to Specify Management Information Systems - A Contribution to MIS Success
: Data warehouse projects, today, are in an ambivalent situation. On the one hand, data warehouses are critical for a company's success and various methodological and technolo...
Jörg Becker, Alexander Dreiling, Michael Ribb...
JAIHC
2010
205views more  JAIHC 2010»
14 years 10 months ago
Soft computing in intrusion detection: the state of the art
The state of the art is explored in using soft computing (SC) methods for network intrusion detection, including the examination of efforts in ten specific areas of SC as well as ...
Chet Langin, Shahram Rahimi