Clausal resolution in a logic of rational agency

Dixon, Clare; Fisher, Michael; Bolotov, Alexander

doi:10.1016/s0004-3702(02)00196-0

Cited by 18 publications

(24 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…current disposition and set of perceptual inputs, and for a given simulator fidelity and internal timing, a robot will always generate the same set of IM and CE outputs. Thus we may be able to formally check the correctness of the deterministic Generate-and-Test process using agent model checking (Dennis et al, 2012) or deductive verification approaches (Dixon et al, 2002). …”

Section: Validation and Verificationmentioning

confidence: 99%

Robots with Internal Models: A Route to Self-Aware and Hence Safer Robots

Winfield¹

2014

The Computer After Me

View full text Add to dashboard Cite

Section: Validation and Verificationmentioning

confidence: 99%

Robots with Internal Models: A Route to Self-Aware and Hence Safer Robots

Winfield¹

2014

The Computer After Me

View full text Add to dashboard Cite

“…In contrast, to show completeness of our calculus R ,S CTL we construct a graph known as a labelled behaviour graph. This is an extension of the concept of a behaviour graph used in Fisher et al [2001] for proving completeness of a clausal resolution for PLTL and related to the concept of a labelled behaviour graph used [Dixon et al 2002]. However, our labelled behaviour graph differs in its construction to capture the semantics of indices in SNF g CTL .…”

Section: Comparison Between R S Ctl and The Previous Resolution Calcmentioning

confidence: 99%

A resolution calculus for the branching-time temporal logic CTL

Zhang

Hustadt

Dixon

2014

ACM Trans. Comput. Logic

Self Cite

View full text Add to dashboard Cite

The branching-time temporal logic CTL is useful for specifying systems that change over time and involve quantification over possible futures. Here we present a resolution calculus for CTL that involves the translation of formulae to a normal form and the application of a number of resolution rules. We use indices in the normal form to represent particular paths and the application of the resolution rules is restricted dependent on an ordering and selection function to reduce the search space. We show that the translation preserves satisfiability, the calculus is sound, complete, and terminating, and consider the complexity of the calculus.

show abstract

“…While individual modal, temporal, or description logics have been studied extensively in the past, much less is known about combinations of modal logics and, in particular, about practical proof methods for such combinations [22]. However, both resolution-and tableau-based proof methods for combinations of propositional (linear or branching time) temporal logics with modal logics [54,53,193,94] have been studied. For example, the combination of modal and temporal logics and translations into fragments of classical first-order logics have been used to reason about the KARO agent framework [96], and about extensions of the basic METATEM framework [71].…”

Section: • Temporal Logicsmentioning

confidence: 99%

Computational Logics and Agents: A Road Map of Current Technologies and Future Trends

Fisher

Bordini

Hirsch

et al. 2007

Computational Intelligence

Self Cite

View full text Add to dashboard Cite

The concept of an agent is increasingly used in contemporary software applications, particularly those involving the Internet, autonomous systems, or cooperation. However, with dependability and safety in mind, it is vital that the mechanisms for representing and implementing agents are clear and consistent. Hence there has been a strong research effort directed at using formal logic as the basis for agent descriptions and agent implementation. Such a logical basis not only presents the clarity and consistency required but also allows for important techniques such as logical verification to be applied.We present a roadmap of research into the use of computational logic in agent-based systems and survey much of the recent work in these areas. Even though, with such a rapidly changing field, it is impossible to cover every development, we aim to give the reader sufficient background to understand the current research problems and potential future developments in this maturing area.

show abstract

Clausal resolution in a logic of rational agency

Cited by 18 publications

References 14 publications

Robots with Internal Models: A Route to Self-Aware and Hence Safer Robots

Robots with Internal Models: A Route to Self-Aware and Hence Safer Robots

A resolution calculus for the branching-time temporal logic CTL

Computational Logics and Agents: A Road Map of Current Technologies and Future Trends

Contact Info

Product

Resources

About