8337 search results - page 173 / 1668 » Reasoning With Characteristic Models |
173
click to vote
NMR
2004
Springer
15 years 10 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 ∈...
184
click to vote
LOGCOM
1998
15 years 4 months ago
1998
Planning algorithms have traditionally been geared toward achievement goals in single-agent environments. Such algorithms essentially produce plans to reach one of a specified se...
186
Voted
CAV
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We propose a new technique for the static analysis of concurrent programs comprised of multiple threads. In general, the problem is known to be undecidable even for progr...
190
click to vote
CONSTRAINTS
1998
15 years 4 months ago
1998
Many temporal applications like planning and scheduling can be viewed as special cases of the numeric and symbolic temporal constraint satisfaction problem. Thus we have developed ...
169
click to vote
ATAL
2011
Springer
14 years 4 months ago
2011
Springer
In modal logic, when adding a syntactic property to an axiomatisation, this property will semantically become true in all models, in all situations, under all circumstances. For i...