Sciweavers

86 search results - page 3 / 18
» Automatic Generation of Propagation Rules for Finite Domains
Sort
View
FLAIRS
2003
13 years 7 months ago
Open Domain Information Extraction via Automatic Semantic Labeling
This paper presents a semantic labeling technique based on information encoded in FrameNet. Sentences labeled for frames relevant to any new Information Extraction domain enable t...
Alessandro Moschitti, Paul Morarescu, Sanda M. Har...
CPAIOR
2010
Springer
13 years 4 months ago
Lazy Clause Generation: Combining the Power of SAT and CP (and MIP?) Solving
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
Peter J. Stuckey
ACL
2010
13 years 4 months ago
Automatic Sanskrit Segmentizer Using Finite State Transducers
In this paper, we propose a novel method for automatic segmentation of a Sanskrit string into different words. The input for our segmentizer is a Sanskrit string either encoded as...
Vipul Mittal
CSCLP
2008
Springer
13 years 8 months ago
From Rules to Constraint Programs with the Rules2CP Modelling Language
In this paper, we present a rule-based modelling language for constraint programming, called Rules2CP. Unlike other modelling languages, Rules2CP adopts a single knowledge represen...
François Fages, Julien Martin
ICCS
2001
Springer
13 years 10 months ago
Learning to Generate CGs from Domain Specific Sentences
Automatically generating Conceptual Graphs (CGs) [1] from natural language sentences is a difficult task in using CG as a semantic (knowledge) representation language for natural l...
Lei Zhang, Yong Yu