186 search results - page 16 / 38 » Tractability of Theory Patching |
CHI
2009
ACM
15 years 11 months ago
2009
ACM
In this paper, we present a case study of humaninformation interaction in the online realm of politics. The case study consists of a participant observed while searching and brows...
MFCS
2004
Springer
15 years 3 months ago
2004
Springer
We study the complexity of the inclusion, equivalence, and intersection problem for simple regular expressions arising in practical XML schemas. These basically consist of the conc...
DOCENG
2003
ACM
15 years 3 months ago
2003
ACM
XPath [3, 5] is a powerful and quite successful language able to perform complex node selection in trees through compact specifications. As such, it plays a growing role in many ...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Courcelle's famous theorem from 1990 states that any property of graphs definable in monadic second-order logic (MSO2) can be decided in linear time on any class of graphs of ...
KR
1992
Springer
15 years 2 months ago
1992
Springer
While the task of answering queries from an arbitrary propositional theory is intractable in general, it can typicallybe performed e ciently if the theory is Horn. This suggests t...