1667 search results - page 122 / 334 » Extended clause learning |
131
Voted
ICML
2007
IEEE
16 years 5 months ago
2007
IEEE
We study the problem of discovering a manifold that best preserves information relevant to a nonlinear regression. Solving this problem involves extending and uniting two threads ...
131
Voted
AAAI
2006
15 years 6 months ago
2006
straction is a useful tool for agents interacting with environments. Good state abstractions are compact, reuseable, and easy to learn from sample data. This paper and extends two...
176
click to vote
ICCAD
2002
IEEE
16 years 1 months ago
2002
IEEE
Optimized solvers for the Boolean Satisfiability (SAT) problem have many applications in areas such as hardware and software verification, FPGA routing, planning, etc. Further use...
164
click to vote
FOCS
1998
IEEE
15 years 9 months ago
1998
IEEE
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
153
Voted
LICS
1991
IEEE
15 years 8 months ago
1991
IEEE
When logic programming is based on the proof theory of intuitionistic logic, it is natural to allow implications in goals and in the bodies of clauses. Attempting to prove a goal ...