31 search results - page 6 / 7 » Complexity Results for Quantified Boolean Formulae Based on ... |
LPNMR
1997
Springer
13 years 10 months ago
1997
Springer
This paper introduces power default reasoning (PDR), a framework for nonmonotonic reasoning based on the domain-theoretic idea of modeling default rules with partial-information i...
ARTMED
2010
13 years 5 months ago
2010
Objective: The programming language Arden Syntax has been optimised for use in clinical decision support systems. We describe an extension of this language named Fuzzy Arden Synta...
CORR
2004
Springer
13 years 5 months ago
2004
Springer
Data structures often use an integer variable to keep track of the number of elements they store. An invariant of such data structure is that the value of the integer variable is ...
NMR
2004
Springer
13 years 11 months ago
2004
Springer
A logic is defined which in addition to propositional calculus contains several types of probabilistic operators which are applied only to propositional formulas. For every s ∈...
ICALP
2009
Springer
14 years 6 months ago
2009
Springer
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...