Sciweavers

1667 search results - page 68 / 334
» Extended clause learning
Sort
View
AIPS
2006
13 years 10 months ago
Lemma Reusing for SAT based Planning and Scheduling
In this paper, we propose a new approach, called lemma-reusing, for accelerating SAT based planning and scheduling. Generally, SAT based approaches generate a sequence of SAT prob...
Hidetomo Nabeshima, Takehide Soh, Katsumi Inoue, K...
MSV
2004
13 years 10 months ago
An Effective QBF Solver for Planning Problems
A large number of applications can be represented by quantified Boolean formulas (QBF). Although evaluating QBF is NP-hard and thus very difficult, there has been significant progr...
Charles Otwell, Anja Remshagen, Klaus Truemper
ANLP
2000
126views more  ANLP 2000»
13 years 10 months ago
The Automatic Translation of Discourse Structures
We empirically show that there are significant differences between the discourse structure of Japanese texts and the discourse structure of their corresponding English translation...
Daniel Marcu, Lynn Carlson, Maki Watanabe
CORR
1999
Springer
118views Education» more  CORR 1999»
13 years 8 months ago
Supervised Grammar Induction Using Training Data with Limited Constituent Information
Corpus-based grammar induction generally relies on hand-parsed training data to learn the structure of the language. Unfortunately, the cost of building large annotated corpora is...
Rebecca Hwa
PKDD
2010
Springer
148views Data Mining» more  PKDD 2010»
13 years 7 months ago
Exploiting Causal Independence in Markov Logic Networks: Combining Undirected and Directed Models
Abstract. A new method is proposed for compiling causal independencies into Markov logic networks (MLNs). An MLN can be viewed as compactly representing a factorization of a joint ...
Sriraam Natarajan, Tushar Khot, Daniel Lowd, Prasa...