Synergy of Expert Systems, CAD, and Logic Programming

Author(s):  
Yuval Lirov ◽  
Swaminathan Ravikumar ◽  
On-Ching Yue
1985 ◽  
pp. 219-235
Author(s):  
Isaac Balbin ◽  
Koenraad Lecot

Author(s):  
James D. Jones

“Expert systems” are a significant subset of what is known as “decision support systems” (DSS). This article suggests a different paradigm for expert systems than what is commonly used. Most often, expert systems are developed with a tool called an “expert system shell.” For the more adventurous, an expert system might be developed with Prolog, a language for artificial intelligence. Both Prolog and expert system shells stem from technology that is approximately 30 years old.1 There have been updates to these platforms, such as GUI interfaces, XML interfaces, and other “bells and whistles.” However, the technology is still fundamentally old. As an analogy, the current technology is akin to updating a 30-year-old car with new paint (a gooey interface), new upholstery, GPS, and so forth. However, the car is fundamentally still a 30-year-old car. It may be in far better shape than another 30-year-old car without the updates, but it cannot compete from an engineering perspective with current models.2 Similarly, the reasoning power of current expert system technology cannot compete with the reasoning power of the state of the art in logic programming. These advances that have taken place in the logic programming community since the advent of Prolog and expert system shells include: a well developed theory of multiple forms of negation, an understanding of open domains, and the closed world assumption, default reasoning with exceptions, reasoning with respect to time (i.e., a solution to the frame problem and introspection with regard to previous beliefs), reasoning about actions, introspection, and maintaining multiple views of the world simultaneously (i.e., reasoning with uncertainty). This article examines a family of logic programming languages. This article in conjunction with a companion article this volume, Knowledge Representation That Can Empower Expert Systems, suggest that logic programs employing recent advances in semantics and in knowledge representation provide a more robust framework in which to develop expert systems. The author has successfully applied this paradigm and these ideas to financial applications, security applications, and enterprise information systems.


Author(s):  
Hajime Yoshino ◽  
Katsumi Nitta

Lawyers use a reasoning process known as legal reasoning to solve legal problems. Legal expert systems could potentially help lawyers solve legal problems more quick and adequately, enable students to study law at school or at home more easily, and help legal scholars and professionals analyze the law and legal systems more clearly and precisely.In 1992, Hajime Yoshino of Meiji Gakuin University started a “Legal Expert Systems” project. This “Legal Expert” project is funded by the Japanese Ministry of Education, Science and Culture and is scheduled to run from May 1992 to March 1998. Yoshino organized over 30 lawyers and computer scientists to clarify legal knowledge and develop legal expert systems.This project covers a wide range of technologies such as the analysis of legal knowledge, the analysis of legal rules on international trade (United Nations Convention on Contracts for International Sale of Goods (CISG)), legal knowledge representation, legal inference models, utility programs to develop legal knowledge bases, and user interfaces. This project, which ends in March 1998, will focus on developing comprehensive legal expert systems as the final product. In this issue, we present 12 papers written by “Legal Expert” project members.In this number, Hajime Yoshino gives are overview of the legal expert systems project, explaining its aims, objectives, and organization. Six papers that follow his introduction include three on case-based reasoning. Legal rules are given by ambiguous predicates, making it difficult sometimes to determine whether conditions for rules are satisfied by the facts given of an event. In such cases, lawyers often refer to old cases and generate hypotheses through analogical reasoning.Kaoru Hirota, Hajime Yoshino and Ming Qiang Xu apply fuzzy theory to case-based reasoning. A number of related systems have been developed, but most focus on qualitative similarities between old cases and the current case, and cannot measure quantitative similarities. Hirota et al. treat quantitative similarity by applying fuzzy theory, explaining their method using CISG examples.Ken Satoh developed a way to compute an interpretation of undefined propositions in a legal rule using adversarial case-based reasoning. He translated old cases giving possible interpretations for a proposition into clauses in abductive logic programming and introduced abducibles to reason dynamically about important factors in an old case to the interpretation suiting the user’s purpose.Yoshiaki Okubo and Makoto Haraguchi formalized a way of attacking legal argument. Assume that an opponent has constructed a legal argument by applying a statute with an analogical interpretation. From the viewpoint of legal stability, the same statue for similar cases should be applied with the same interpretation. We thereby create a hypothetical case similar to the case in question and examine whether the statue can be interpreted analogically. Such a hypothetically similar case is created with the help of a goal-dependent abstraction framework. If a precedent in which a statue has been applied to a case with a different interpretation – particularly complete interpretation – can be found, the opponent’s argument is attacked by pointing out the incoherence of its interpretation of the statue.Takashi Kanai and Susumu Kunifuji proposed a legal reasoning system using abductive logic programming that deals with ambiguities in described facts and exceptions not described in articles. They examined the problems to be solved to develop legal knowledge bases through abductive logic programming, e.g., how to select ambiguities to be treated in abductive reasoning, how to describe time relationships, and how to describe an exception in terms of the application of abductive logic programming to legal reasoning.Toshiko Wakaki, Ken Satoh, and Katsumi Nitta presented an approach of reasoning about dynamic preferences in the framework of circumscription based on logic programming. To treat dynamic preferences correctly is required in legal reasoning to handle metarules such as lex posterior. This has become a hotly discussed topic in legal reasoning and more general nonmonotic reasoning. Comparisons of their method, Brewka’s approach, and Prakken and Sartor’s approach are discussed.Hiroyuki Matsumoto proposed a general legal reasoning model and a way of describing legal knowledge systematically. He applied his method to Japanese Maritime Traffic Law.Six more papers are to be presented in the next number


1984 ◽  
Vol 2 (2) ◽  
pp. 187-194 ◽  
Author(s):  
Eugenio Oliveira

Author(s):  
James D. Jones

Knowledge representation is a field of artificial intelligence that has been actively pursued since the 1940s.1 The issues at stake are that given a specific domain, how do we represent knowledge in that domain, and how do we reason about that domain? This issue of knowledge representation is of paramount importance, since the knowledge representation scheme may foster or hinder reasoning. The representation scheme can enable reasoning to take place, or it may make the desired reasoning impossible. To some extent, the knowledge representation depends upon the underlying technology. For instance, in order to perform default reasoning with exceptions, one needs weak negation (aka negation as failure. In fact, most complex forms of reasoning will require weak negation. This is a facility that is an integral part of logic programs but is lacking from expert system shells. Many Prolog implementations provide negation as failure, however, they do not understand nor implement the proper semantics. The companion article to this article in this volume, “Logic Programming Languages for Expert Systems,” discusses logic programming and negation as failure.


1985 ◽  
Vol 1 (2) ◽  
pp. 123-141 ◽  
Author(s):  
Yannis Vassiliou ◽  
James Clifford ◽  
Matthias Jarke

Sign in / Sign up

Export Citation Format

Share Document