2303 search results - page 358 / 461 » On the logic of argumentation theory |
170
click to vote
LATA
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We consider policies that are described by regular expressions, finite automata, or formulae of linear temporal logic (LTL). Such policies are assumed to describe situat...
161
click to vote
SEFM
2009
IEEE
16 years 1 months ago
2009
IEEE
—Increasingly, tools and their underlying theories are able to cope with “real code” written as part of industrial grade applications almost as is. It has been our experience...
140
click to vote
LICS
2009
IEEE
16 years 1 months ago
2009
IEEE
—One-counter processes are pushdown systems over a singleton stack alphabet (plus a stack-bottom symbol). We study the complexity of two closely related verification problems ov...
171
click to vote
HYBRID
2010
Springer
16 years 27 days ago
2010
Springer
Probabilistic Computation Tree Logic (PCTL) is a wellknown modal logic which has become a standard for expressing temporal properties of finite-state Markov chains in the context...
180
click to vote
ATAL
2007
Springer
16 years 18 days ago
2007
Springer
Multiagent environments are often not cooperative nor collaborative; in many cases, agents have conflicting interests, leading to adversarial interactions. This paper presents a ...