Sciweavers

40 search results - page 7 / 8
» On Generalization and Subsumption for Ordered Clauses
Sort
View
AIPS
2006
13 years 8 months ago
Optimal STRIPS Planning by Maximum Satisfiability and Accumulative Learning
Planning as satisfiability (SAT-Plan) is one of the best approaches to optimal planning, which has been shown effective on problems in many different domains. However, the potenti...
Zhao Xing, Yixin Chen, Weixiong Zhang
AICOM
2006
129views more  AICOM 2006»
13 years 7 months ago
A backjumping technique for Disjunctive Logic Programming
In this work we present a backjumping technique for Disjunctive Logic Programming (DLP) under the Answer Set Semantics. It builds upon related techniques that had originally been p...
Francesco Ricca, Wolfgang Faber, Nicola Leone
WWW
2004
ACM
14 years 7 months ago
A web services architecture for learning object discovery and assembly
Courseware systems are often based on an assembly of different components, addressing the different needs of storage and delivery functionality. The Learning Technology Standard A...
Claus Pahl, Ronan Barrett
KR
1992
Springer
13 years 11 months ago
Reasoning About Indefinite Actions
In this paper, we view planning as a special case of reasoning about indefinite actions. We treat actions as predicates defined over a linear temporal order. This formalism permit...
L. Thorne McCarty, Ron van der Meyden
CEC
2009
IEEE
13 years 11 months ago
A conflict based SAW method for Constraint Satisfaction Problems
Evolutionary algorithms have employed the SAW (Stepwise Adaptation of Weights) method in order to solve CSPs (Constraint Satisfaction Problems). This method originated in hill-clim...
Rafi Shalom, Mireille Avigal, Ron Unger