Sciweavers

4708 search results - page 95 / 942
» Generating the Structure of Argument
Sort
View
ICDIM
2008
IEEE
15 years 11 months ago
Sentence compression by structural conversion of parse tree
Sentence compression is the task of generating a grammatical short sentence from an original sentence, retaining important information. The existing methods of only removing the c...
Seiji Egawa, Yoshihide Kato, Shigeki Matsubara
162
Voted
KDD
1994
ACM
116views Data Mining» more  KDD 1994»
15 years 8 months ago
Exception Dags as Knowledge Structures
: The problem of transforming the knowledge bases of performance systems using induced rules or decision trees into comprehensible knowledgestructures is addressed. A knowledgestru...
Brian R. Gaines
ACSC
2005
IEEE
15 years 10 months ago
Optimising Parallel Pattern-matching by Source-level Program Transformation
Parallel pattern-matching (PPM) provides true commutative implementation of functions defined by cases in functional languages, because no argument is given precedence over any o...
R. Lyndon While, Tony Field
115
Voted
ILP
2005
Springer
15 years 10 months ago
Converting Semantic Meta-knowledge into Inductive Bias
The Cyc KB has a rich pre-existing ontology for representing common sense knowledge. To clarify and enforce its terms’ semantics and to improve inferential efficiency, the Cyc on...
John Cabral, Robert C. Kahlert, Cynthia Matuszek, ...
170
Voted
FOSSACS
2004
Springer
15 years 10 months ago
Polynomials for Proving Termination of Context-Sensitive Rewriting
Abstract. We show how to generate well-founded and stable term orderings based on polynomial interpretations over the real numbers. Monotonicity (another usual requirement in termi...
Salvador Lucas