Results 1  10
of
426,229
On the Minimum ManyValued Modal Logic over a Finite Residuated Lattice
, 2009
"... This article deals with manyvalued modal logics, based only on the necessity operator, over a residuated lattice. We focus on three basic classes, according to the accessibility relation, of Kripke frames: the full class of frames evaluated in the residuated lattice (and so defining the minimum mod ..."
Abstract

Cited by 15 (5 self)
 Add to MetaCart
This article deals with manyvalued modal logics, based only on the necessity operator, over a residuated lattice. We focus on three basic classes, according to the accessibility relation, of Kripke frames: the full class of frames evaluated in the residuated lattice (and so defining the minimum
[09:36 21/9/2011 exp062.tex] LogCom: Journal of Logic and Computation Page: 739 739–790 On the Minimum ManyValued Modal Logic over a Finite Residuated Lattice
"... This article deals with manyvalued modal logics, based only on the necessity operator, over a residuated lattice. We focus on three basic classes, according to the accessibility relation, of Kripke frames: the full class of frames evaluated in the residuated lattice (and so defining the minimum mod ..."
Abstract
 Add to MetaCart
This article deals with manyvalued modal logics, based only on the necessity operator, over a residuated lattice. We focus on three basic classes, according to the accessibility relation, of Kripke frames: the full class of frames evaluated in the residuated lattice (and so defining the minimum
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 271 (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
On the Minimum ManyValued Modal Logic over a . . .
, 2009
"... This article deals with manyvalued modal logics, based only on the necessity operator, over a residuated lattice. We focus on three basic classes, according to the accessibility relation, of Kripke frames: the full class of frames evaluated in the residuated lattice (and so defining the minimum mod ..."
Abstract
 Add to MetaCart
This article deals with manyvalued modal logics, based only on the necessity operator, over a residuated lattice. We focus on three basic classes, according to the accessibility relation, of Kripke frames: the full class of frames evaluated in the residuated lattice (and so defining the minimum
Temporal and modal logic
 HANDBOOK OF THEORETICAL COMPUTER SCIENCE
, 1995
"... We give a comprehensive and unifying survey of the theoretical aspects of Temporal and modal logic. ..."
Abstract

Cited by 1300 (17 self)
 Add to MetaCart
We give a comprehensive and unifying survey of the theoretical aspects of Temporal and modal logic.
A Treatise on ManyValued Logics
 Studies in Logic and Computation
, 2001
"... The paper considers the fundamental notions of many valued logic together with some of the main trends of the recent development of infinite valued systems, often called mathematical fuzzy logics. Besides this logical approach also a more algebraic approach is discussed. And the paper ends with som ..."
Abstract

Cited by 84 (5 self)
 Add to MetaCart
ideas 1.1 From classical to manyvalued logic Logical systems in general are based on some formalized language which includes a notion of well formed formula, and then are determined either semantically or syntactically. That a logical system is semantically determined means that one has a notion
New Representation Theorem for Manyvalued Modal Logics
"... We propose a new definition of Representation theorem for manyvalued modal logics, based on a complete latice of algebraic truth values, and define the stronger relationship between algebraic models of a given logic L and relational structures used to define the Kripke possibleworld semantics for ..."
Abstract
 Add to MetaCart
We propose a new definition of Representation theorem for manyvalued modal logics, based on a complete latice of algebraic truth values, and define the stronger relationship between algebraic models of a given logic L and relational structures used to define the Kripke possibleworld semantics
Modal systems based on manyvalued logics
"... We propose a general semantic notion of modal manyvalued logic. Then, we explore the difficulties to characterize this notation in a syntactic way and analyze the existing literature with respect to this framework. ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
We propose a general semantic notion of modal manyvalued logic. Then, we explore the difficulties to characterize this notation in a syntactic way and analyze the existing literature with respect to this framework.
Abduction in Logic Programming
"... Abduction in Logic Programming started in the late 80s, early 90s, in an attempt to extend logic programming into a framework suitable for a variety of problems in Artificial Intelligence and other areas of Computer Science. This paper aims to chart out the main developments of the field over th ..."
Abstract

Cited by 616 (76 self)
 Add to MetaCart
Abduction in Logic Programming started in the late 80s, early 90s, in an attempt to extend logic programming into a framework suitable for a variety of problems in Artificial Intelligence and other areas of Computer Science. This paper aims to chart out the main developments of the field over
Automatic verification of finitestate concurrent systems using temporal logic specifications
 ACM Transactions on Programming Languages and Systems
, 1986
"... We give an efficient procedure for verifying that a finitestate concurrent system meets a specification expressed in a (propositional, branchingtime) temporal logic. Our algorithm has complexity linear in both the size of the specification and the size of the global state graph for the concurrent ..."
Abstract

Cited by 1384 (62 self)
 Add to MetaCart
We give an efficient procedure for verifying that a finitestate concurrent system meets a specification expressed in a (propositional, branchingtime) temporal logic. Our algorithm has complexity linear in both the size of the specification and the size of the global state graph for the concurrent
Results 1  10
of
426,229