Labelled Tableaux for Non-Normal Modal Logics

Governatori, Guido; Luppi, Alessandro

doi:10.1007/3-540-46238-4_11

Cited by 12 publications

(9 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The term classical modal logic is often used to refer to these logics (Chellas, 1980). The recent interest in classical modal logic has resulted in some proof procedures for it (Gasquet & Herzig, 1996; Governatori & Luppi, 2000; Giunchiglia et al ., 2002; Hansen, 2004). For , the technique published in Gasquet and Herzig (1996) is chosen.…”

Section: The Languagementioning

confidence: 99%

The design of a semantic web compatible content language for agent communication

Erdur

Seylan

2008

Expert Systems

View full text Add to dashboard Cite

Current standards on agent communication languages explain communication by changes in the mental states of agents. It is rather a striking issue that none of the popular agent middleware adheres to this semantics in a formal way. Therefore, this paper tries to close the gap between agent communication theory and practice by implementing a logic that is capable of representing agents' beliefs and intentions. An interesting property of this language, named ALC BI , is that it is a hybrid of modal and description logics. Due to its description logic foundation, it can also be used as an ontology definition language. Thus, it is well suited for agents working on the semantic web. In this paper, a sound and complete decision algorithm as well as other reasoning services for the logic are presented. Finally, the application of the language in a multi-agent development framework is discussed.

show abstract

Section: The Languagementioning

confidence: 99%

The design of a semantic web compatible content language for agent communication

Erdur

Seylan

2008

Expert Systems

View full text Add to dashboard Cite

show abstract

“…The label algebra contrary to the graph reasoning mechanism is not based on first order logic and thus can deal with complex structure and is not limited to particular fragments. Indeed KEM has been used with complex label schema for non-normal modal logics in a uniform way [10] as well as other intensional logics such as conditional logics [2]. For these reasons we believe that KEM offers a suitable framework for decision procedure for multi-modal logic for MAS.…”

Section: Conclusion and Related Workmentioning

confidence: 99%

On Constructing Fibred Tableaux for BDI Logics

Padmanabhan

Governatori

2006

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

“…While this could be a problem for other combination techniques and tableaux systems, this does not affect fibring, and KEM. It is possible to differentiate normal and non-normal modal logic in KEM based on additional conditions on the substitution function ρ, see [14].…”

Section: Inference Rulesmentioning

confidence: 99%

“…It combines linear tableau expansion rules with natural deduction rules and an analytic version of the cut rule. The tableau rules are supplemented with a powerful and flexible label algebra that allows the system to deal with a large class of intensional logics admitting possible world semantics (non-normal modal logic [14], multi-modal logics [11] and conditional logics [2]). The label algebra is intended to simulate the possible world semantics and it has a very strong relationship with fibring [10].…”

Section: Introductionmentioning

confidence: 99%

A Fibred Tableau Calculus for Modal Logics of Agents

Padmanabhan

Governatori

2006

Declarative Agent Languages and Technologies IV

Self Cite

View full text Add to dashboard Cite

In [15,19] we showed how to combine propositional multimodal logics using Gabbay's fibring methodology. In this paper we extend the above mentioned works by providing a tableau-based proof technique for the combined/fibred logics. To achieve this end we first make a comparison between two types of tableau proof systems, (graph & path), with the help of a scenario (The Friend's Puzzle). Having done that we show how to uniformly construct a tableau calculus for the combined logic using Governatori's labelled tableau system KEM. We conclude with a discussion on KEM's features. This work was supported by the Australian Research Council under Discovery Project DP0558854 on "A Formal Approach to Resource Allocation in Service Oriented Marketplaces". 1 General modal systems with an arbitrary set of normal modal operators all characterised by the axiom K: 2(ϕ → ψ) → (2ϕ → 2ψ) and the necessitation rule. i.e., ϕ/ 2ϕ.

show abstract

Labelled Tableaux for Non-Normal Modal Logics

Abstract: In this paper we show how to extend KEM, a tableau-like proof system for normal modal logic, in order to deal with classes of non-normal modal logics, such as monotonic and regular, in a uniform and modular way.

Cited by 12 publications

References 10 publications

The design of a semantic web compatible content language for agent communication

The design of a semantic web compatible content language for agent communication

On Constructing Fibred Tableaux for BDI Logics

A Fibred Tableau Calculus for Modal Logics of Agents

Contact Info

Product

Resources

About