Results 1  10
of
945
ON THE COMPLEXITY OF ELEMENTARY MODAL LOGICS
"... Modal logics are widely used in computer science. The complexity of modal satisfiability problems has been investigated since the 1970s, usually proving results on a casebycase basis. We prove a very general classification for a wide class of relevant logics: Many important subclasses of modal lo ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
Modal logics are widely used in computer science. The complexity of modal satisfiability problems has been investigated since the 1970s, usually proving results on a casebycase basis. We prove a very general classification for a wide class of relevant logics: Many important subclasses of modal
AgentSpeak(L): BDI Agents speak out in a logical computable language
, 1996
"... BeliefDesireIntention (BDI) agents have been investigated by many researchers from both a theoretical specification perspective and a practical design perspective. However, there still remains a large gap between theory and practice. The main reason for this has been the complexity of theoremprov ..."
Abstract

Cited by 514 (2 self)
 Add to MetaCart
proving or modelchecking in these expressive specification logics. Hence, the implemented BDI systems have tended to use the three major attitudes as data structures, rather than as modal operators. In this paper, we provide an alternative formalization of BDI agents by providing an operational and proof
The computational complexity of provability in systems of modal propositional logic
 SIAM Journal of Computing
, 1977
"... Abstract. The computational complexity of the provability problem in systems of modal propositional logic is investigated. Every problem computable in polynomial space is log space reducible to the provability problem in any modal system between K and $4. In particular, the provability problem in K ..."
Abstract

Cited by 241 (0 self)
 Add to MetaCart
Abstract. The computational complexity of the provability problem in systems of modal propositional logic is investigated. Every problem computable in polynomial space is log space reducible to the provability problem in any modal system between K and $4. In particular, the provability problem
Realtime logics: complexity and expressiveness
 INFORMATION AND COMPUTATION
, 1993
"... The theory of the natural numbers with linear order and monadic predicates underlies propositional linear temporal logic. To study temporal logics that are suitable for reasoning about realtime systems, we combine this classical theory of in nite state sequences with a theory of discrete time, via ..."
Abstract

Cited by 252 (16 self)
 Add to MetaCart
allows us to classify a wide variety of realtime logics according to their complexity and expressiveness. Indeed, it follows that most formalisms proposed in the literature cannot be decided. We are, however, able to identify two elementary realtime temporal logics as expressively complete fragments
INFDATALOG, MODAL LOGIC AND COMPLEXITIES
 THEORETICAL INFORMATICS AND APPLICATIONS
, 1999
"... InfDatalog extends the usual least fixpoint semantics of Datalog with greatest fixpoint semantics: we defined infDatalog and characterized the expressive power of various fragments of infDatalog in [GFAA03]. In the present paper, we study the complexity of query evaluation on finite models for ..."
Abstract
 Add to MetaCart
for (various fragments of) infDatalog. We deduce a unified and elementary proof that global modelchecking (i.e. computing all nodes satisfying a formula in a given structure) has 1. quadratic data complexity in time and linear program complexity in space for CTL and alternationfree modal µcalculus, and 2
Complexity of Modal Logics of Relations
, 1997
"... We consider two families of modal logics of relations: arrow logic and cylindric modal logic and several natural expansions of these, interpreted on a range of (relativised) modelclasses. We give a systematic study of the complexity of the validity problem of these logics, obtaining price tags for ..."
Abstract

Cited by 26 (9 self)
 Add to MetaCart
We consider two families of modal logics of relations: arrow logic and cylindric modal logic and several natural expansions of these, interpreted on a range of (relativised) modelclasses. We give a systematic study of the complexity of the validity problem of these logics, obtaining price tags
Products, or How to Create Modal Logics of High Complexity
"... The aim of this paper is to exemplify the complexity of the satisability problem of products of modal logics. Our main goal is to arouse interest for the main open problem in this area: a tight complexity bound for the satisability problem of the product KK.At present, only nonelementary decision p ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
The aim of this paper is to exemplify the complexity of the satisability problem of products of modal logics. Our main goal is to arouse interest for the main open problem in this area: a tight complexity bound for the satisability problem of the product KK.At present, only nonelementary decision
The complexity of oneagent Refinement Modal Logic
"... Abstract. We investigate the complexity of satisfiability for oneagent Refinement Modal Logic (RML), a known extension of basic modal logic (ML) obtained by adding refinement quantifiers on structures. It is known that RML has the same expressiveness as ML, but the translation of RML into ML is of ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
Abstract. We investigate the complexity of satisfiability for oneagent Refinement Modal Logic (RML), a known extension of basic modal logic (ML) obtained by adding refinement quantifiers on structures. It is known that RML has the same expressiveness as ML, but the translation of RML into ML
The complexity of reasoning with boolean modal logics
 LTCSReport 0002, LuFG Theoretical Computer Science, RWTH
, 2001
"... 1 Motivation Since Modal Logics are an extension of Propositional Logic, they provide Boolean operators for constructing complex formulae. However, most Modal Logics do not admit Boolean operators for constructing complex modal parameters to be used in the box and diamond operators. This asymmetry i ..."
Abstract

Cited by 46 (6 self)
 Add to MetaCart
1 Motivation Since Modal Logics are an extension of Propositional Logic, they provide Boolean operators for constructing complex formulae. However, most Modal Logics do not admit Boolean operators for constructing complex modal parameters to be used in the box and diamond operators. This asymmetry
Products, or How to Create Modal Logics of High Complexity
"... Abstract The aim of this paper is to exemplify the complexity of the satisfiability problem of products of modal logics. Our main goal is to arouse interest for the main open problem in this area: a tight complexity bound for the satisfiability problem of the product K\Theta K. At present, only non ..."
Abstract
 Add to MetaCart
Abstract The aim of this paper is to exemplify the complexity of the satisfiability problem of products of modal logics. Our main goal is to arouse interest for the main open problem in this area: a tight complexity bound for the satisfiability problem of the product K\Theta K. At present, only nonelementary
Results 1  10
of
945