Sciweavers

KR
2010
Springer
14 years 1 months ago
The Modular Structure of an Ontology: An Empirical Study
Bijan Parsia, Thomas Schneider 0002
KR
2010
Springer
14 years 1 months ago
One Hundred Prisoners and a Lightbulb - Logic and Computation
This is a case-study in knowledge representation. We analyze the ‘one hundred prisoners and a lightbulb’ puzzle. In this puzzle it is relevant what the agents (prisoners) know...
Hans P. van Ditmarsch, Jan van Eijck, William Wu
DEON
2010
Springer
14 years 1 months ago
Where Did Mally Go Wrong?
In 1926, Mally proposed the first formal deontic system. As Mally and others soon realized, this system had some rather strange consequences. We show that the strangeness of Mally...
Gert-Jan C. Lokhorst
DEON
2010
Springer
14 years 1 months ago
Moral Particularism and Deontic Logic
The aim of this paper is to strengthen the point made by Horty about the relationship between reason holism and moral particularism. In the literature prima facie obligations have ...
Xavier Parent
DEON
2010
Springer
14 years 1 months ago
Relevance, Derogation and Permission
Abstract. We show that a recently developed theory of positive permission based on the notion of derogation is hampered by a triviality result that indicates a problem with the und...
Audun Stolpe
DEON
2010
Springer
14 years 1 months ago
Value-Based Argumentation for Justifying Compliance
Compliance is often achieved ‘by design’ through a coherent system of controls consisting of information systems and procedures . This system-based control requires a new appro...
Brigitte Burgemeestre, Joris Hulstijn, Yao-Hua Tan
DEON
2010
Springer
14 years 1 months ago
Privacy Policies with Modal Logic: The Dynamic Turn
Abstract. Privacy policies are often defined in terms of permitted messages. Instead, in this paper we derive dynamically the permitted messages from static privacy policies defi...
Guillaume Aucher, Guido Boella, Leendert van der T...
TPHOL
2002
IEEE
14 years 1 months ago
Weakest Precondition for General Recursive Programs Formalized in Coq
Abstract. This paper describes a formalization of the weakest precondition, wp, for general recursive programs using the type-theoretical proof assistant Coq. The formalization is ...
Xingyuan Zhang, Malcolm Munro, Mark Harman, Lin Hu
TPHOL
2002
IEEE
14 years 1 months ago
Quotient Types: A Modular Approach
In this paper we introduce a new approach to axiomatizing quotient types in type theory. We suggest replacing the existing monolithic rule set by a modular set of rules for a speci...
Aleksey Nogin
TPHOL
2002
IEEE
14 years 1 months ago
Type-Theoretic Functional Semantics
We describe the operational and denotational semantics of a small imperative language in type theory with inductive and recursive definitions. The operational semantics is given b...
Yves Bertot, Venanzio Capretta, Kuntal Das Barman