Sciweavers

103 search results - page 18 / 21
» High-Probability Syntactic Links
Sort
View
LPNMR
2005
Springer
15 years 2 months ago
Guarded Open Answer Set Programming
Open answer set programming (OASP) is an extension of answer set programming where one may ground a program with an arbitrary superset of the program’s constants. We define a ...
Stijn Heymans, Davy Van Nieuwenborgh, Dirk Vermeir
COLING
2008
14 years 11 months ago
Modeling Semantic Containment and Exclusion in Natural Language Inference
We propose an approach to natural language inference based on a model of natural logic, which identifies valid inferences by their lexical and syntactic features, without full sem...
Bill MacCartney, Christopher D. Manning
LREC
2010
158views Education» more  LREC 2010»
14 years 11 months ago
The JOS Linguistically Tagged Corpus of Slovene
The JOS language resources are meant to facilitate developments of HLT and corpus linguistics for the Slovene language and consist of the morphosyntactic specifications, defining ...
Tomaz Erjavec, Darja Fiser, Simon Krek, Nina Ledin...
ICWS
2008
IEEE
14 years 11 months ago
Generalized Semantics-Based Service Composition
Service-oriented computing (SOC) has emerged as the eminent market environment for sharing and reusing service-centric capabilities. The underpinning for an organization's us...
Srividya Kona, Ajay Bansal, M. Brian Blake, Gopal ...
AAAI
1990
14 years 10 months ago
Some Applications of Graph Bandwidth to Constraint Satisfaction Problems
Bandwidth is a fundamental concept in graph theory which has some surprising applications to a class of AI search problems. Graph bandwidth provides a link between the syntactic s...
Ramin Zabih