22 search results - page 1 / 5 » Periodicity based decidable classes in a first order timed l... |
APAL
2006
13 years 4 months ago
2006
AAAI
1990
13 years 6 months ago
1990
Since knowledge bases (KBs) are usually incomplete, they should be able to provide information regarding their own incompleteness, which requires them to introspect on what they k...
FSTTCS
2010
Springer
13 years 2 months ago
2010
Springer
This paper focuses on first-order logic (FO) extended by reachability predicates such that the expressiveness and hence decidability properties lie between FO and monadic second-o...
ICTAC
2009
Springer
13 years 2 months ago
2009
Springer
Online trading invariably involves dealings between strangers, so it is important for one party to be able to judge objectively the trustworthiness of the other. In such a setting,...
CSL
2009
Springer
13 years 8 months ago
2009
Springer
We introduce tree-width for first order formulae , fotw(). We show that computing fotw is fixed-parameter tractable with parameter fotw. Moreover, we show that on classes of formul...