125 search results - page 22 / 25 » A Logic of Probability with Decidable Model Checking |
FSTTCS
2009
Springer
15 years 4 months ago
2009
Springer
The paper focuses on the structure of fundamental sequences of ordinals smaller than ε0. A first result is the construction of a monadic second-order formula identifying a given ...
ICTAC
2009
Springer
14 years 7 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,...
LPNMR
2005
Springer
15 years 3 months ago
2005
Springer
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 ...
86
Voted
CSL
2009
Springer
15 years 1 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...
FOCS
2005
IEEE
15 years 3 months ago
2005
IEEE
The automata-theoretic approach is one of the most fundamental approaches to developing decision procedures in mathematical logics. To decide whether a formula in a logic with the...