1667 search results - page 44 / 334 » Extended clause learning |
AIPS
2006
13 years 10 months ago
2006
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...
ICCD
2006
IEEE
14 years 5 months ago
2006
IEEE
Abstract— In this paper, we introduce a novel preimage computation technique that directly computes the circuit cofactors without an explicit search for any satisfiable solution...
ECTEL
2007
Springer
14 years 3 months ago
2007
Springer
Creating courses by combining Learning Objects (LOs) sourced from third parties, known as courseware, is becoming more popular of late. Although courseware has advantages over tra...
COLT
1992
Springer
14 years 1 months ago
1992
Springer
This paper deals with a class of Prolog programs, called context-free term transformations (CFT). We present a polynomial time algorithm to identify a subclass of CFT, whose progr...
ICMLC
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. Many supervised and unsupervised learning algorithms depend on the choice of an appropriate distance metric. While metric learning for supervised learning tasks has a lon...