In modal logic, the modal depth of a formula is the deepest nesting of modal operators (commonly and ). Modal formulas without modal operators have aâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2016

2016

Epistemic planning is a variant of automated planning in the framework of dynamic epistemic logic. In recent works, the epistemicâ€¦Â (More)

Is this relevant?

2010

2010

- Carlos Areces, Daniel GorÃn
- J. Applied Logic
- 2010

We present a coinductive definition of models for modal logics and show that it provides a homogeneous framework in which it isâ€¦Â (More)

Is this relevant?

2010

2010

- M. Praveen
- MFCS
- 2010

Many tractable algorithms for solving the Constraint Satisfaction Problem (Csp) have been developed using the notion of theâ€¦Â (More)

Is this relevant?

2007

2007

In this paper we continue our research in computational complexity of fragments of a particular belief-desire-intention (BDIâ€¦Â (More)

Is this relevant?

2002

2002

- Ian Horrocks, Peter F. Patel-Schneider
- Journal of Automated Reasoning
- 2002

Heavily optimized decision procedures for propositional modal satisfiability are now becoming available. Two systemsâ€¦Â (More)

Is this relevant?

2002

2002

- Marcus Kracht
- Advances in Modal Logic
- 2002

Recently, there has been growing attention to the space requirements of tableau methods (see for example [7], [1], [12]). We haveâ€¦Â (More)

Is this relevant?

2001

2001

- Peter F. Patel-Schneider, Roberto Sebastiani
- IJCAR
- 2001

Previous methods for generating random modal formulae (for the multi-modal logic K (m)) result either in awed test sets or forâ€¦Â (More)

Is this relevant?

2001

2001

- Linh Anh Nguyen
- Fundam. Inform.
- 2001

We propose a modal query language called MDatalog. A rule of an MDatalog program is a universally quantified modal Horn clauseâ€¦Â (More)

Is this relevant?

2000

2000

- Linh Anh Nguyen
- Fundam. Inform.
- 2000

We give algorithms to construct the least L-model for a given positive modal logic program P , where L can be one of the modalâ€¦Â (More)

Is this relevant?

1999

1999

- L. A. Nguyen
- 1999

We propose so called clausal tableau systems for the common modal logics K , KD , T , KB , KDB and B . There is a measure suchâ€¦Â (More)

Is this relevant?