Specifying Deadlines with Continuous Time Using Deontic and Temporal Logic

Dignum, Frank; Kuiper, Ruurd

doi:10.1080/10864415.1998.11518334

Cited by 18 publications

(5 citation statements)

References 17 publications

(24 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This problem is of the same order of greatness as the fundamental problems indicated by von Wright in his previous work, and it is for this reason that it should have been included in the book. Furthermore, the ®rst two authors (Dignum and Kuiper 1998) have shown that the formalisms are useful in describing procedures in electronic commerce and in agent applications.…”

Section: Selectionmentioning

confidence: 99%

Essay Reviews

2002

History and Philosophy of Logic

View full text Add to dashboard Cite

Section: Selectionmentioning

confidence: 99%

Essay Reviews

2002

History and Philosophy of Logic

View full text Add to dashboard Cite

“…Strategic behaviour that uses timing information and strives to obtain timed properties have been referred to in many branches of computer science. For instance, timely fulfilment of contractual obligations is an important subject in deontic analysis of deadlines (Dignum & Kuiper, 1998;Broersen, Dignum, Dignum, & Meyer, 2004). As another example, the existence of timing attacks, where the attacker can compromise the system by analysing the time taken to execute different operations, create the need for timing analysis in verification of security (Kocher, 1996).…”

Section: Related Workmentioning

confidence: 99%

Timed ATL: Forget Memory, Just Count

Knapik¹,

André²,

Petrucci³

et al. 2019

jair

View full text Add to dashboard Cite

In this paper we investigate the Timed Alternating-Time Temporal Logic (TATL), a discrete-time extension of ATL. In particular, we propose, systematize, and further study semantic variants of TATL, based on different notions of a strategy. The notions are derived from different assumptions about the agents’ memory and observational capabilities, and range from timed perfect recall to untimed memoryless plans. We also introduce a new semantics based on counting the number of visits to locations during the play. We show that all the semantics, except for the untimed memoryless one, are equivalent when punctuality constraints are not allowed in the formulae. In fact, abilities in all those notions of a strategy collapse to the “counting” semantics with only two actions allowed per location. On the other hand, this simple pattern does not extend to the full TATL. As a consequence, we establish a hierarchy of TATL semantics, based on the expressivity of the underlying strategies, and we show when some of the semantics coincide. In particular, we prove that more compact representations are possible for a reasonable subset of TATL specifications, which should improve the efficiency of model checking and strategy synthesis.

show abstract

“…Note that, in this approach, the notion of the social contract differs from the one presented in Dellarocas [63] where both social and interaction contracts are merged into the social contract notion. Both types of contracts are represented through the Logic for Contract Representation (LCR) language [71], that is based on the Temporal and Deontic Logic (BTLcont) [68] and the branching-time temporal logic (CTL*) [76]. Based on this logic, formulae are represented as branching structures where nodes represent states and arcs represent events.…”

Section: Virtual Communitiesmentioning

confidence: 99%

Symbolic representations and common - sense reasoning in open multi - agent systems

Giannikis¹,

Γιαννίκης²

View full text Add to dashboard Cite

This thesis concerns with intelligent autonomous software agents that populate open computational environments, in which they interact for various purposes, e.g. competitively in the case of auctions or resource allocation problems, collaboratively in the case of distributed problem solving or parallel processing, joint planning, etc. We use the term open to characterize a computational environment in Hewitt's sense, that is to describe an environment that is dynamic, continuous, unobservable (or, at best, partially observable) and non-deterministic.Agents in such environments possess, unavoidably, information that is incomplete, imprecise, maybe even incorrect, due to the very fact that the environment is open and, at the very least, agents join and leave it as they please. The information exchanged between agents may be delayed, or distorted by noise during its communication, and in any case, as the environment evolves, it is bound to change.The interactions among agents in any multi-agent system are typically governed by norms. These may refer to restrictions on communication means among agents, or to particular coordination mechanisms, liveness and safety properties of the system etc. In some application areas, such as ecommerce, additional norms may regulate the agents' behaviours, resulting from agreements into which the agents enter willingly, and possibly from the protocol that governs the e-market. Norms prescribe what each agent is obliged, permitted, prohibited, empowered and so on, to do during its life in the particular environment. Autonomous agents decide for themselves which norms to subject itself to and whether to comply with the norms of their environment. This decision-making is all the more challenging when an agent has to perform it in circumstances where its available knowledge is incomplete/imprecise/incorrect. This thesis addresses the need and requirement for common-sense reasoning agents in open computational environments. We discuss and illustrate our proposals with reference to an e-commerce example. First, based on the example scenario, we identify the requirements for the representation of the norms that govern the environment and the specifications for the environment itself. Nevertheless, our proposals are generally applicable to any case where multiple agents interact and their interaction is governed by some contract as a coordination or collaboration mechanism.Primarily, this thesis examines and motivates the need of agents to fill in information gaps by resorting to assumptions. Agents need to be able to identify and use assumptions dynamically, in any open computational environment, as well as in the particular application context of an e-commerce example. We present a novel approach to dynamic assumption identification and hypothetical nonmonotonic reasoning inspired by the syntax and semantics of Default Logic, without however resorting to proof, which is notably computationally hard. We discuss in detail what distinguishes our approach from other work on dynamic assumption...

show abstract

Specifying Deadlines with Continuous Time Using Deontic and Temporal Logic

Cited by 18 publications

References 17 publications

Essay Reviews

Essay Reviews

Timed ATL: Forget Memory, Just Count

Symbolic representations and common - sense reasoning in open multi - agent systems

Contact Info

Product

Resources

About