Sciweavers

1404 search results - page 35 / 281
» Complexity of admissible rules
Sort
View
INLG
2010
Springer
13 years 8 months ago
Complex Lexico-syntactic Reformulation of Sentences Using Typed Dependency Representations
We present a framework for reformulating sentences by applying transfer rules on a typed dependency representation. We specify a list of operations that the framework needs to sup...
Advaith Siddharthan
DEBU
2010
139views more  DEBU 2010»
13 years 7 months ago
Refining Information Extraction Rules using Data Provenance
Developing high-quality information extraction (IE) rules, or extractors, is an iterative and primarily manual process, extremely time consuming, and error prone. In each iteratio...
Bin Liu 0002, Laura Chiticariu, Vivian Chu, H. V. ...
ACL
2010
13 years 8 months ago
Complexity Assumptions in Ontology Verbalisation
We describe the strategy currently pursued for verbalising OWL ontologies by sentences in Controlled Natural Language (i.e., combining generic rules for realising logical patterns...
Richard Power
BPM
2008
Springer
125views Business» more  BPM 2008»
14 years 9 days ago
Checking Compliance of Execution Traces to Business Rules
Complex and flexible business processes are critical not only because they are difficult to handle, but also because they often tend to loose their intelligibility. Verifying compl...
Federico Chesani, Paola Mello, Marco Montali, Fabr...
CISSE
2008
Springer
14 years 3 days ago
From Constraints to Resolution Rules Part I : conceptual framework
: Many real world problems appear naturally as constraints satisfaction problems (CSP), for which very efficient algorithms are known. Most of these involve the combination of two ...
Denis Berthier