Sciweavers

1667 search results - page 13 / 334
» Extended clause learning
Sort
View
ICML
2010
IEEE
13 years 8 months ago
Learning Markov Logic Networks Using Structural Motifs
Markov logic networks (MLNs) use firstorder formulas to define features of Markov networks. Current MLN structure learners can only learn short clauses (4-5 literals) due to extre...
Stanley Kok, Pedro Domingos
LPAR
2004
Springer
14 years 1 months ago
Abstract DPLL and Abstract DPLL Modulo Theories
DPLL and DPLL Modulo Theories Robert Nieuwenhuis , Albert Oliveras , and Cesare Tinelli We introduce Abstract DPLL, a general and simple abstract rule-based formulation of the Davi...
Robert Nieuwenhuis, Albert Oliveras, Cesare Tinell...
SAT
2004
Springer
89views Hardware» more  SAT 2004»
14 years 1 months ago
Using Rewarding Mechanisms for Improving Branching Heuristics
The variable branching heuristics used in the most recent and most effective SAT solvers, including zChaff and BerkMin, can be viewed as consisting of a simple mechanism for rewa...
Elsa Carvalho, João P. Marques Silva
CP
2003
Springer
14 years 27 days ago
Ten Challenges Redux: Recent Progress in Propositional Reasoning and Search
Abstract. In 1997 we presented ten challenges for research on satisfiability testing [1]. In this paper we review recent progress towards each of these challenges, including our o...
Henry A. Kautz, Bart Selman
IMCSIT
2010
13 years 5 months ago
German subordinate clause word order in dialogue-based CALL.
We present a dialogue system for exercising the German subordinate clause word order. The pedagogical methodology we adopt is based on focused tasks: the targeted linguistic struct...
Magdalena Wolska, Sabrina Wilske