Sciweavers

1650 search results - page 94 / 330
» The HOM problem is decidable
Sort
View
LPAR
2007
Springer
14 years 4 months ago
Complexity of Planning in Action Formalisms Based on Description Logics
Abstract. In this paper, we continue the recently started work on integrating action formalisms with description logics (DLs), by investigating planning in the context of DLs. We p...
Maja Milicic
FOCS
2005
IEEE
14 years 3 months ago
AdWords and Generalized On-line Matching
How does a search engine company decide what ads to display with each query so as to maximize its revenue? This turns out to be a generalization of the online bipartite matching p...
Aranyak Mehta, Amin Saberi, Umesh V. Vazirani, Vij...
MLCW
2005
Springer
14 years 3 months ago
An Inference Model for Semantic Entailment in Natural Language
Semantic entailment is the problem of determining if the meaning of a given sentence entails that of another. This is a fundamental problem in natural language understanding that ...
Rodrigo de Salvo Braz, Roxana Girju, Vasin Punyaka...
RTA
2010
Springer
14 years 2 months ago
Order-Sorted Unification with Regular Expression Sorts
Abstract. We extend first-order order-sorted unification by permitting regular expression sorts for variables and in the domains of function symbols. The set of basic sorts is ...
Temur Kutsia, Mircea Marin
CCCG
2008
13 years 11 months ago
Polynomial irreducibility testing through Minkowski summand computation
In this paper, we address the problem of deciding absolute irreducibility of multivariate polynomials. Our work has been motivated by a recent work due to Gao et. al. [1, 2, 3] wh...
Deepanjan Kesh, Shashank K. Mehta