Sciweavers

95 search results - page 14 / 19
» An Implementation of Subtyping Among Regular Expression Type...
Sort
View
WWW
2010
ACM
14 years 2 months ago
A scalable machine-learning approach for semi-structured named entity recognition
Named entity recognition studies the problem of locating and classifying parts of free text into a set of predefined categories. Although extensive research has focused on the de...
Utku Irmak, Reiner Kraft
LPNMR
2001
Springer
13 years 12 months ago
plp: A Generic Compiler for Ordered Logic Programs
Abstract This paper describes a generic compiler, called plp, for translating ordered logic programs into standard logic programs under the answer set semantics. In an ordered logi...
James P. Delgrande, Torsten Schaub, Hans Tompits
CAV
1999
Springer
119views Hardware» more  CAV 1999»
13 years 11 months ago
A Theory of Restrictions for Logics and Automata
BDDs and their algorithms implement a decision procedure for Quanti ed Propositional Logic. BDDs are a kind of acyclic automata. Unrestricted automata (recognizing unbounded string...
Nils Klarlund
LREC
2008
83views Education» more  LREC 2008»
13 years 8 months ago
More Semantic Links in the SIMPLE-CLIPS Database
Notwithstanding its acknowledged richness, the SIMPLE semantic model does not offer the representational vocabulary for encoding some conceptual links holding between events and t...
Nilda Ruimy, Antonio Toral
POPL
2008
ACM
14 years 7 months ago
Boomerang: resourceful lenses for string data
A lens is a bidirectional program. When read from left to right, it denotes an ordinary function that maps inputs to outputs. When read from right to left, it denotes an "upd...
Aaron Bohannon, J. Nathan Foster, Benjamin C. Pier...