Results 11  20
of
1,235
A New General Method To Generate Random Modal Formulae For Testing Decision Procedures
 JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH
, 2003
"... The recent emergence of heavilyoptimized modal decision procedures has highlighted the key role of empirical testing in this domain. Unfortunately, the introduction of extensive empirical tests for modal logics is recent, and so far none of the proposed test generators is very satisfactory. To c ..."
Abstract

Cited by 16 (3 self)
 Add to MetaCart
The recent emergence of heavilyoptimized modal decision procedures has highlighted the key role of empirical testing in this domain. Unfortunately, the introduction of extensive empirical tests for modal logics is recent, and so far none of the proposed test generators is very satisfactory
ManyValued Modal Logics
 Fundamenta Informaticae
, 1992
"... . Two families of manyvalued modal logics are investigated. Semantically, one family is characterized using Kripke models that allow formulas to take values in a finite manyvalued logic, at each possible world. The second family generalizes this to allow the accessibility relation between worlds a ..."
Abstract

Cited by 273 (16 self)
 Add to MetaCart
. Two families of manyvalued modal logics are investigated. Semantically, one family is characterized using Kripke models that allow formulas to take values in a finite manyvalued logic, at each possible world. The second family generalizes this to allow the accessibility relation between worlds
Verifying modal formulas over I/Oautomata by means of type theory. Logic group preprint series
, 1994
"... We introduce the notion of an I/Oautomaton over a signature. Beside we introduce a modal logic to reason about such an I/Oautomaton. The semantics of the logic is de ned in terms of a givenalgebra. We illustrate how the question whether or not an execution in a given I/Oautomaton is a model for ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
We introduce the notion of an I/Oautomaton over a signature. Beside we introduce a modal logic to reason about such an I/Oautomaton. The semantics of the logic is de ned in terms of a givenalgebra. We illustrate how the question whether or not an execution in a given I/Oautomaton is a model
A New VeryGeneral Method to Generate Random Modal Formulae for Testing Decision Procedures
 Journal of Artificial Intelligence Research
, 2001
"... The recent emergence of heavilyoptimized modal decision procedures has highlighted the key role of empirical testing in this domain. Unfortunately, the introduction of extensive empirical tests for modal logics is recent, and so far none of the proposed test generators is very satisfactory. To c ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
The recent emergence of heavilyoptimized modal decision procedures has highlighted the key role of empirical testing in this domain. Unfortunately, the introduction of extensive empirical tests for modal logics is recent, and so far none of the proposed test generators is very satisfactory
Modal Languages And Bounded Fragments Of Predicate Logic
, 1996
"... Model Theory. These are nonempty families I of partial isomorphisms between models M and N , closed under taking restrictions to smaller domains, and satisfying the usual BackandForth properties for extension with objects on either side  restricted to apply only to partial isomorphisms of size ..."
Abstract

Cited by 273 (12 self)
 Add to MetaCart
at most k . 'Invariance for kpartial isomorphism' means having the same truth value at tuples of objects in any two models that are connected by a partial isomorphism in such a set. The precise sense of this is spelt out in the following proof. 21 Proof (Outline.) kvariable formulas
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
propositional formula is provable in certain systems of modal propositional logic, including K, T, $4, and $5. In terms to be defined later we show (using a suggestion of S. K. Thomason) that if S is a modal system between K and $4, then every problem computable in polynomial space is log
On a Generalization of the Ackermann Lemma
"... for computing firstorder equivalents of modal formulas. by ..."
On modal definability of Horn formulas
"... In this short paper we give a criterion of modal definability of a firstorder universal Horn sentence with exactly one positive atom in terms of its graph. As a consequence we obtain that every modal logic axiomatized by a single modal Horn formula (i.e. of the form K+ φ where φ is a modal Horn for ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
In this short paper we give a criterion of modal definability of a firstorder universal Horn sentence with exactly one positive atom in terms of its graph. As a consequence we obtain that every modal logic axiomatized by a single modal Horn formula (i.e. of the form K+ φ where φ is a modal Horn
Modal Definability, Solving Equations in Modal Algebras and Generalizations of the
"... Abstract. In this paper we reduce the problem of computing firstorder equivalents of modal formulas to the problem of solving certain equations in modal algebras by means of an algebraic generalization of a lemma of Ackermann. 1 ..."
Abstract
 Add to MetaCart
Abstract. In this paper we reduce the problem of computing firstorder equivalents of modal formulas to the problem of solving certain equations in modal algebras by means of an algebraic generalization of a lemma of Ackermann. 1
A Propositional Modal Logic of Time Intervals
 Journal of the ACM
, 1996
"... : In certain areas of artificial intelligence there is need to represent continuous change and to make statements that are interpreted with respect to time intervals rather than time points. To this end we develop a modal temporal logic based on time intervals, a logic which can be viewed as a gener ..."
Abstract

Cited by 157 (2 self)
 Add to MetaCart
: In certain areas of artificial intelligence there is need to represent continuous change and to make statements that are interpreted with respect to time intervals rather than time points. To this end we develop a modal temporal logic based on time intervals, a logic which can be viewed as a
Results 11  20
of
1,235