Sciweavers

2490 search results - page 225 / 498
» Complexity of Contextual Reasoning
Sort
View
WAOA
2010
Springer
232views Algorithms» more  WAOA 2010»
15 years 3 months ago
Approximation Algorithms for Domination Search
The r-domination search game on graphs is a game-theoretical approach to several graph and hypergraph parameters including treewidth and hypertree width. The task is to identify t...
Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thi...
CORR
2011
Springer
170views Education» more  CORR 2011»
15 years 1 months ago
On the Decidability of Connectedness Constraints in 2D and 3D Euclidean Spaces
We investigate (quantifier-free) spatial constraint languages with equality, contact and connectedness predicates, as well as Boolean operations on regions, interpreted over low-...
Roman Kontchakov, Yavor Nenov, Ian Pratt-Hartmann,...
ACL
2012
13 years 8 months ago
Event Linking: Grounding Event Reference in a News Archive
Interpreting news requires identifying its constituent events. Events are complex linguistically and ontologically, so disambiguating their reference is challenging. We introduce ...
Joel Nothman, Matthew Honnibal, Ben Hachey, James ...
EWCBR
2004
Springer
15 years 11 months ago
Software Design Retrieval Using Bayesian Networks and WordNet
The complexity of software systems makes design reuse a necessary task in the software development process. CASE tools can provide cognitive assistance in this task, helping the so...
Paulo Gomes
JACM
2010
137views more  JACM 2010»
15 years 4 months ago
Reconciling description logics and rules
Description logics (DLs) and rules are formalisms that emphasize different aspects of knowledge representation: whereas DLs are focused on specifying and reasoning about conceptual...
Boris Motik, Riccardo Rosati