Results 1  10
of
318
The Concept of a Linguistic Variable and its Application to Approximate Reasoning
 Journal of Information Science
, 1975
"... By a linguistic variable we mean a variable whose values are words or sentences in a natural or artificial language. I:or example, Age is a linguistic variable if its values are linguistic rather than numerical, i.e., young, not young, very young, quite young, old, not very oldand not very young, et ..."
Abstract

Cited by 1157 (8 self)
 Add to MetaCart
By a linguistic variable we mean a variable whose values are words or sentences in a natural or artificial language. I:or example, Age is a linguistic variable if its values are linguistic rather than numerical, i.e., young, not young, very young, quite young, old, not very oldand not very young, etc., rather than 20, 21, 22, 23, In more specific terms, a linguistic variable is characterized by a quintuple (&?, T(z), U, G,M) in which &? is the name of the variable; T(s) is the termset of2, that is, the collection of its linguistic values; U is a universe of discourse; G is a syntactic rule which generates the terms in T(z); and M is a semantic rule which associates with each linguistic value X its meaning, M(X), where M(X) denotes a fuzzy subset of U The meaning of a linguistic value X is characterized by a compatibility function, c: l / + [0, I], which associates with each u in U its compatibility with X. Thus, the COItIpdtibiiity of age 27 with young might be 0.7, while that of 35 might be 0.2. The function of the semantic rule is to relate the compdtibihties of the socalled primary terms in a composite linguistic valuee.g.,.young and old in not very young and not very oldto the compatibility of the composite value. To this end, the hedges
Acting under uncertainty: Discrete Bayesian models for mobilerobot navigation
 in In Proceedings of IEEE/RSJ International Conference on Intelligent Robots and Systems
, 1996
"... ..."
(Show Context)
Symmetry and Model Checking
, 1994
"... We show how to exploit symmetry in model checking for concurrent systems containing many identical or isomorphic components. We focus in particular on those composed of many isomorphic processes. In many cases we are able to obtain significant, even exponential, savings in the complexity of model ch ..."
Abstract

Cited by 199 (15 self)
 Add to MetaCart
We show how to exploit symmetry in model checking for concurrent systems containing many identical or isomorphic components. We focus in particular on those composed of many isomorphic processes. In many cases we are able to obtain significant, even exponential, savings in the complexity of model checking. 1 Introduction In this paper, we show how to exploit symmetry in model checking. We focus on systems composed of many identical (isomorphic) processes. The global state transition graph M of such a system exhibits a great deal of symmetry, characterized by the group of graph automorphisms of M. The basic idea underlying our method is to reduce model checking over the original structure M, to model checking over a smaller quotient structure M, where symmetric states are identified. In the following paragraphs, we give a more detailed but still informal account of a "grouptheoretic" approach to exploiting symmetry. More precisely, the symmetry of M is reflected in the group, Aut M...
An optimisation technique for protocol conformance test generation based on UIO sequences and Rural Chinese Postman Tours
 Protocol Specification, Testing, and Verification
, 1988
"... ..."
The Power of a Pebble: Exploring and Mapping Directed Graphs
 A PRELIMINARY VERSION OF THIS WORK APPEARED IN STOC `98
, 1998
"... ..."
World Modeling for the Dynamic Construction of RealTime Control Plans
, 1994
"... As intelligent, autonomous systems are embedded in critical realworld environments, it becomes increasingly important to rigorously characterize how these systems will perform. Research in realtime computing and control has developed ways of proving that a given control system will meet the demand ..."
Abstract

Cited by 107 (56 self)
 Add to MetaCart
As intelligent, autonomous systems are embedded in critical realworld environments, it becomes increasingly important to rigorously characterize how these systems will perform. Research in realtime computing and control has developed ways of proving that a given control system will meet the demands of an environment, but has not addressed the dynamic planning of control actions. Building an agent that can flexibly achieve its goals in changing environments requires a blending of realtime computing and AI technologies. The Cooperative Intelligent Realtime Control Architecture (CIRCA) implements this blending by executing complex AI methods and guaranteed realtime control plans on separate subsystems. We describe the formal model of agent/environment interactions that CIRCA uses to build control plans, and we show how those control plans are guaranteed to meet domain requirements. CIRCA's world model provides the information required to make realtime performance guarantees, but avo...
Generic ILP versus Specialized 01 ILP: An Update
 IN INTERNATIONAL CONFERENCE ON COMPUTERAIDED DESIGN
, 2002
"... Optimized solvers for the Boolean Satisfiability (SAT) problem have many applications in areas such as hardware and software verification, FPGA routing, planning, etc. Further uses are complicated by the need to express "counting constraints" in conjunctive normal form (CNF). Expressing su ..."
Abstract

Cited by 92 (21 self)
 Add to MetaCart
Optimized solvers for the Boolean Satisfiability (SAT) problem have many applications in areas such as hardware and software verification, FPGA routing, planning, etc. Further uses are complicated by the need to express "counting constraints" in conjunctive normal form (CNF). Expressing such constraints by pure CNF leads to more complex SAT instances. Alternatively, those constraints can be handled by Integer Linear Programming (ILP), but generic ILP solvers may ignore the Boolean nature of 01 variables. Therefore specialized 01 ILP solvers extend SAT solvers to handle these socalled "pseudoBoolean" constraints. This work
Stochastic Activity Networks: Formal Definitions and Concepts
, 2001
"... Stochastic activity networks have been used since the mid1980s for performance, dependability, and performability evaluation. They have ..."
Abstract

Cited by 84 (1 self)
 Add to MetaCart
Stochastic activity networks have been used since the mid1980s for performance, dependability, and performability evaluation. They have