Sciweavers

1252 search results - page 2 / 251
» Minimizing Learned Clauses
Sort
View
ML
2006
ACM
131views Machine Learning» more  ML 2006»
13 years 5 months ago
Markov logic networks
We propose a simple approach to combining first-order logic and probabilistic graphical models in a single representation. A Markov logic network (MLN) is a first-order knowledge b...
Matthew Richardson, Pedro Domingos
BIRTHDAY
2009
Springer
14 years 3 days ago
Combinatorial Problems for Horn Clauses
Given a family of Horn clauses, what is the minimal number of Horn clauses implying all other clauses in the family? What is the maximal number of Horn clauses from the family wit...
Marina Langlois, Dhruv Mubayi, Robert H. Sloan, Gy...
ICML
1994
IEEE
13 years 8 months ago
Reducing Misclassification Costs
We explore algorithms for learning classification procedures that attempt to minimize the cost of misclassifying examples. First, we consider inductive learning of classification ...
Michael J. Pazzani, Christopher J. Merz, Patrick M...
ECCC
2000
77views more  ECCC 2000»
13 years 5 months ago
Polynomial-Time Recognition of Minimal Unsatisfiable Formulas with Fixed Clause-Variable Difference
A formula (in conjunctive normal form) is said to be minimal unsatisfiable if it is unsatisfiable and deleting any clause makes it satisfiable. The deficiency of a formula is the ...
Herbert Fleischner, Stefan Szeider
ASPDAC
2005
ACM
99views Hardware» more  ASPDAC 2005»
13 years 7 months ago
A fast counterexample minimization approach with refutation analysis and incremental SAT
- It is a hotly research topic to eliminate irrelevant variables from counterexample, to make it easier to be understood. BFL algorithm is the most effective Counterexample minim...
ShengYu Shen, Ying Qin, Sikun Li