38 search results - page 5 / 8 » An Internal Version of Epistemic Logic |
CADE
2000
Springer
13 years 12 months ago
2000
Springer
Abstract. Proof-carrying code and other applications in computer security require machine-checkable proofs of properties of machine-language programs. These in turn require axioms ...
AMAI
2004
Springer
13 years 7 months ago
2004
Springer
We introduce the notion of combinatorial vote, where a group of agents (or voters) is supposed to express preferences and come to a common decision concerning a set of non-independ...
ICLP
1992
Springer
13 years 11 months ago
1992
Springer
CFT is a new constraint system providing records as logical data structure for constraint (logic) programming. It can be seen as a generalization of the rational tree system emplo...
ICSE
2001
IEEE-ACM
14 years 1 days ago
2001
IEEE-ACM
Mocha is a model checker based on the theme of exploiting design modularity: instead of manipulating unstructured state-transition graphs, it supports the hierarchical modeling fra...
IGPL
2010
13 years 6 months ago
2010
In this paper we investigate how to represent and reason about legal abrogations and annulments in Defeasible Logic. We examine some options that embed in this setting, and in simi...