Sciweavers

1667 search results - page 325 / 334
» Extended clause learning
Sort
View
COCO
2006
Springer
96views Algorithms» more  COCO 2006»
15 years 1 months ago
Optimal Hardness Results for Maximizing Agreements with Monomials
We consider the problem of finding a monomial (or a term) that maximizes the agreement rate with a given set of examples over the Boolean hypercube. The problem is motivated by le...
Vitaly Feldman
75
Voted
KR
2000
Springer
15 years 1 months ago
Approximate Objects and Approximate Theories
We propose to extend the ontology of logical AI to include approximate objects, approximate predicates and approximate theories. Besides the ontology we treat the relations among ...
John McCarthy
122
Voted
FUN
2010
Springer
230views Algorithms» more  FUN 2010»
15 years 25 days ago
Scheduling with Bully Selfish Jobs
In job scheduling with precedence constraints, i j means that job j cannot start being processed before job i is completed. In this paper we consider selfish bully jobs who do no...
Tami Tamir
AIPS
2008
14 years 12 months ago
Planning 3D Task Demonstrations of a Teleoperated Space Robot Arm
We present an automated planning application for generating 3D tasks demonstrations involving a teleoperated robot arm on the International Space Station (ISS). A typical task dem...
Froduald Kabanza, Khaled Belghith, Philipe Bellefe...
95
Voted
DLOG
2007
14 years 12 months ago
Speeding up Approximation with Nicer Concepts
Abstract. Concept approximation is an inference service for Description Logics that provides “translations” of concept descriptions from one DL to a less expressive DL. In [4] ...
Anni-Yasmin Turhan, Yusri Bong