Sciweavers

899 search results - page 114 / 180
» A CTL-Based Logic for Program Abstractions
Sort
View
COMMA
2010
14 years 7 months ago
Dialectical Proofs for Constrained Argumentation
Abstract. Constrained argumentation frameworks (CAF) generalize Dung's frameworks by allowing additional constraints on arguments to be taken into account in the definition of...
Caroline Devred, Sylvie Doutre, Claire Lefè...
105
Voted
ICFP
2008
ACM
16 years 14 days ago
Typed closure conversion preserves observational equivalence
Language-based security relies on the assumption that all potential attacks are bound by the rules of the language in question. When programs are compiled into a different languag...
Amal Ahmed, Matthias Blume
FAABS
2004
Springer
15 years 5 months ago
Towards Timed Automata and Multi-agent Systems
Abstract. The design of reactive systems must comply with logical correctness (the system does what it is supposed to do) and timeliness (the system has to satisfy a set of tempora...
Guillaume Hutzler, Hanna Klaudel, D. Yue Wang
121
Voted
ATAL
1995
Springer
15 years 4 months ago
Time, Knowledge, and Choice
Abstract. This article considers the link between theory and practice in agentoriented programming. We begin by rigorously defining a new formal specification language for autono...
Michael Wooldridge
LPNMR
1990
Springer
15 years 4 months ago
The meaning of Negative Premises in Transition System Specifications
We present a general theory for the use of negative premises in the rules of Transition System Specifications (TSSs). We formulate a criterion that should be satisfied by a TSS in ...
Roland N. Bol, Jan Friso Groote