Open AccessProceedings Article
A Fixed-point Characterization of a Deontic Logic of Regular Action
Jan Broersen,Roel Wieringa,John-Jules Ch. Meyer +2 more
- Vol. 48, Iss: 2, pp 107-128
TLDR
A deontic logic of regular action is defined as a characterization within a modal μ-calculus of action by closely following the structure of deterministic finite automatons for regular action.Abstract:
We define a deontic logic of regular action as a characterization within a modal μ-calculus of action. First a semantics of deontic notions for regular action is given in terms of conditions on modal action structures. Then modal μ-calculus formulas characterizing these conditions are constructed by closely following the structure of deterministic finite automatons for regular action.read more
Citations
More filters
Book ChapterDOI
A formal language for electronic contracts
TL;DR: This paper proposes an extension of the µ-calculus in order to capture the intuitive meaning of the deontic notions and to express concurrent actions, and provides a translation of the contract language into the logic, the semantics of which faithfully captures the meaning of obligation, permission and prohibition.
Journal ArticleDOI
A dynamic deontic logic for complex contracts
TL;DR: A dynamic deontic logic intended to be used in specifying complex contracts found in computer science, which incorporates the notions of contrary- to-duty and contrary-to-p rohibition by attaching to the deontics modalities explicitly a reparation which is to be en forced in case of violations.
Book ChapterDOI
Run-Time Monitoring of Electronic Contracts
TL;DR: It is shown how to obtain an alternating Buchi automaton which accepts exactly the traces that fulfill the contract, the basis for obtaining a finite state machine which acts as a run-time monitor for contracts written in $\mathcal {CL}$ contracts.
Journal ArticleDOI
Action negation and alternative reductions for dynamic deontic logics
TL;DR: The goal of this paper is to find a formalization of the notion of ‘action negation’ that has an intuitive interpretation as an action forming combinator and does not impose restrictions on the use of other relevant action combinators in the normative context.
Book ChapterDOI
Intelligent agents and common sense reasoning
TL;DR: This chapter describes the use of modal logic techniques to describe mental attitudes of intelligent systems, and the role of epistemic/doxastic logic in AI, and on the description of intelligent agents in particular is discussed in the chapter.
References
More filters
Journal ArticleDOI
A lattice-theoretical fixpoint theorem and its applications
TL;DR: In this paper, the authors formulate and prove an elementary fixpoint theorem which holds in arbitrary complete lattices, and give various applications (and extensions) of this result in the theories of simply ordered sets, real functions, Boolean algebras, as well as in general set theory and topology.
Journal ArticleDOI
Results on the propositional μ-calculus
TL;DR: A propositional μ-calculus L μ is defined and study, which consists essentially of propositional modal logic with a least fixpoint operator that is syntactically simpler yet strictly more expressive than Propositional Dynamic Logic (PDL).
Journal ArticleDOI
Propositional dynamic logic of regular programs
TL;DR: A formal syntax and semantics for the propositional dynamic logic of regular programs is defined and principal conclusions are that deciding satisfiability of length n formulas requires time d n /log n for some d > 1, and that satisfiability can be decided in nondeterministic time cn for some c.
Journal ArticleDOI
The concurrency workbench: a semantics-based tool for the verification of concurrent systems
TL;DR: The Concurrency Workbench is an automated tool for analyzing networks of finite-state processes expressed in Milner's Calculus of Communicating Systems and a large number of interesting verification methods can be formulated as combinations of a small number of primitive algorithms.