scispace - formally typeset
Search or ask a question
JournalISSN: 0266-4720

Expert Systems 

Wiley-Blackwell
About: Expert Systems is an academic journal published by Wiley-Blackwell. The journal publishes majorly in the area(s): Computer science & Expert system. It has an ISSN identifier of 0266-4720. Over the lifetime, 1922 publications have been published receiving 34144 citations.


Papers
More filters
Journal Article
TL;DR: An interval-based temporal logic is introduced, together with a computationally effective reasoning algorithm based on constraint propagation, which is notable in offering a delicate balance between space and time.
Abstract: An interval-based temporal logic is introduced, together with a computationally effective reasoning algorithm based on constraint propagation. This system is notable in offering a delicate balance between

7,466 citations

Book ChapterDOI
TL;DR: The Rete Match Algorithm is an efficient method for companng a large collection of patterns to a largeCollection of objects that finds all the objects that match each pattern.
Abstract: The Rete Match Algorithm is an efficient method for companng a large collection of patterns to a large collection of objects. It finds all the objects that match each pattern The algorithm was developed for use in production system interpreters, and it has been used for systems containing from a few hundred to more than a thousand patterns and objects. This article presents the algorithm in detail It explains the basic concepts of the algorithm, it describes pattern and object representations that are appropriate for the algorithm, and it describes the operations performed by the pattern matcher.

1,555 citations

Journal ArticleDOI
TL;DR: This paper describes ISIS, a scheduling system capable of incorporating all relevant constraints in the construction of job shop schedules, and examines both the representation of constraints within ISIS, and the manner in which these constraints are used in conducting a constraint-directed search for an acceptable schedule.
Abstract: Analysis of the job shop scheduling domain has indicated that the crux of the scheduling problem is the determination and satisfaction of a large variety of constraints. Schedules are influenced by such diverse and conflicting factors as due date requirements, cost restrictions, production levels, machine capabilities and substitutability, alternative production processes, order characteristics, resource requirements, and resource availability. This paper describes ISIS, a scheduling system capable of incorporating all relevant constraints in the construction of job shop schedules. We examine both the representation of constraints within ISIS, and the manner in which these constraints are used in conducting a constraint-directed search for an acceptable schedule. The important issues relating to the relaxation of constraints are addressed. Finally, the interactive scheduling facilities provided by ISIS are considered.

593 citations

Journal Article
TL;DR: A formalism is presented for representing commonsense knowledge using the notion of process and it is shown how this knowledge can be used to achieve particular goals or to form intentions regarding their achievement.
Abstract: Much of commonsense knowledge about the real world is in the form of procedures or sequences of actions for achieving particular goals. In this paper, a formalism is presented for representing such knowledge using the notion of process. A declarative semantics for the representation is given, which allows a user to state facts about the effects of doing things in the problem domain of interest. An operational semantics is also provided, which shows how this knowledge can be used to achieve particular goals or to form intentions regarding their achievement. Given both semantics, our formalism additionally serves as an executable specification language suitable for constructing complex systems. A system based on this formalism is described, and examples involving control of an autonomous robot and fault diagnosis for NASA's space shuttle are provided.

335 citations

Journal ArticleDOI
Yiyu Yao1
TL;DR: The Shannon entropy function is used to quantitatively characterize partitions of a universe and both algebraic and probabilistic rough set approximations are studied, both defined in a decision‐theoretic framework.
Abstract: This paper reviews probabilistic approaches to rough sets in granulation, approximation, and rule induction. The Shannon entropy function is used to quantitatively characterize partitions of a universe. Both algebraic and probabilistic rough set approximations are studied. The probabilistic approximations are defined in a decision-theoretic framework. The problem of rule induction, a major application of rough set theory, is studied in probabilistic and information-theoretic terms. Two types of rules are analyzed, the local, low order rules, and the global, high order rules.

327 citations

Performance
Metrics
No. of papers from the Journal in previous years
YearPapers
2023172
2022299
2021302
2020123
2019108
201877