Logic Programming and Knowledge Base Maintenance.

1983 ◽  
Author(s):  
K. A. Bowen
Keyword(s):  
Logic Programming ◽  
Knowledge Base

Knowledge base for finite-element mesh design learned by inductive logic programming

1998 ◽  
Vol 12 (2) ◽  
pp. 95-106 ◽  
Author(s):  
BOJAN DOLšAK ◽  
IVAN BRATKO ◽  
ANTON JEZERNIK
Keyword(s):  
Finite Element ◽  
Logic Programming ◽  
Knowledge Base ◽  
Inductive Logic Programming ◽  
Design Patterns ◽  
Inductive Logic ◽  
Real Life ◽  
Finite Element Mesh ◽  
Element Mesh ◽  
Computational Overhead

This paper addresses an important application of machine learning (ML) in design. One of the major bottlenecks in the process of engineering analysis by using the finite-element method—a design of the finite-element mesh—was a subject of improvement. Defining an appropriate geometric mesh model that ensures low approximation errors and avoids unnecessary computational overhead is a very difficult and time-consuming task based mainly on the user's experience. A knowledge base for finite-element mesh design has been constructed using the ML techniques. Ten mesh models have been used as a source of training examples. The mesh dataset was probably the first real-world relational dataset and became one of the most widely used training set for experimenting with inductive logic programming (ILP) systems. After several experiments with different ML systems in the last few years, the ILP system CLAUDIEN was chosen to construct the rules for determining the appropriate mesh resolution values. The ILP has been found to be an effective approach to the problem of mesh design. An evaluation of the resulting knowledge base shows that the mesh design patterns are captured well by the induced rules and represent a solid basis for practical application. The aim of this paper is not only to present the real-life ML application to design, but also to describe and discuss a relation of the work being done to the topic of this special issue: the proposed “dimensions” of ML in design.

Legal Reasoning Using Abductive Logic Programming

1997 ◽  
Vol 1 (2) ◽  
pp. 114-120
Author(s):  
Takashi Kanai ◽  
◽  
Susumu Kunifuji
Keyword(s):  
Logic Programming ◽  
Knowledge Base ◽  
Legal Reasoning ◽  
The Other ◽  
Abductive Logic ◽  
Reasoning System ◽  
Abductive Logic Programming ◽  
Reasoning Systems ◽  
Legal Arguments

In this paper, we propose a new legal reasoning system using abductive logic programming (ALP). The system can deal with ambiguities of described facts and exceptions which is not described in relevant articles. In addition, the goal, queried to a legal reasoning system, differs in compliance with whether the user is a plaintiff or defendant. In usual deductive legal reasoning systems, there are two major problems in treating legal arguments. One is that legal facts usually have ambiguities, and the other is that two conflicting conclusions must be derived from one knowledge base, depending on whether a plaintiff of defendant is involved. To overcome these difficulties, abductive logic programming is used in our legal reasoning system, which can deal with implicit exceptions and generate presumptions according to the user’s needs.

Computer architectures for logic-oriented data/knowledge bases

1989 ◽  
Vol 4 (1) ◽  
pp. 1-29
Author(s):  
Donghoon Shin ◽  
P. Bruce Berra
Keyword(s):  
Logic Programming ◽  
Knowledge Base ◽  
Knowledge Bases ◽  
Computer Architectures ◽  
Management Systems ◽  
Shared Knowledge ◽  
Base System ◽  
Knowledge Base System ◽  
Base Management ◽  
Knowledge Base Management Systems

AbstractKnowledge base management systems (KBMS) are designed to efficiently retrieve and manipulate large shared knowledge bases. A significant subclass of KBMS consisting of a combination of logic programming and database is often called a logic oriented knowledge base system (LOKBS). These systems must possess considerable processing and I/O capabilities so many approaches have been taken to the improvement of their performance. In this paper we review the current performance enhancing hardware approaches for LOKBS. We include parallelism, both in processing and I/O, algorithms, caching, and physical data organizations.

Algorithm of Representing and Preparing for Resources in EEM

2014 ◽  
Vol 989-994 ◽  
pp. 2144-2147
Author(s):  
Qian Yu ◽  
Tong Li ◽  
Xuan Zhang ◽  
Ying Lin ◽  
Yong Yu ◽  
...  
Keyword(s):  
Logic Programming ◽  
Knowledge Base ◽  
Process Model ◽  
Software Evolution ◽  
Evolution Process ◽  
Description Language ◽  
Formal Approach ◽  
Execution Model ◽  
Execution Environment ◽  
Knowledge Intensive

Software evolution process model (EPM) is a knowledge-intensive process which is described in EPDL(Software Evolution Process Description Language) and modelled by semi-formal approach based on EPMM(Software Evolution Process Meta-Model). EPM’s execution model (EEM) is represented by logic programming to create the knowledge base of EPM during constructing the EEM. Only its needing all kinds of resources are satisfied by system execution environment is activity in EEM implemented. The paper discussed the method and the algorithm of preparing resources is respectively presented in order to execute the EEM automatically. The converter program is realized and the correct results have presented to prove the correctness of the method.

scholarly journals Semantics for Possibilistic Disjunctive Programs

2011 ◽  
Vol 13 (1) ◽  
pp. 33-70 ◽  
Author(s):  
JUAN CARLOS NIEVES ◽  
MAURICIO OSORIO ◽  
ULISES CORTÉS
Keyword(s):  
Logic Programming ◽  
Knowledge Base ◽  
Logic Program ◽  
Programming Approach ◽  
Logic Programs ◽  
Possibilistic Logic ◽  
Point Operator ◽  
Disjunctive Logic Programs ◽  
Answer Sets ◽  
Disjunctive Programs

AbstractIn this paper, a possibilistic disjunctive logic programming approach for modeling uncertain, incomplete, and inconsistent information is defined. This approach introduces the use of possibilistic disjunctive clauses, which are able to capture incomplete information and states of a knowledge base at the same time. By considering a possibilistic logic program as a possibilistic logic theory, a construction of a possibilistic logic programming semantic based on answer sets and the proof theory of possibilistic logic is defined. It shows that this possibilistic semantics for disjunctive logic programs can be characterized by a fixed-point operator. It is also shown that the suggested possibilistic semantics can be computed by a resolution algorithm and the consideration of optimal refutations from a possibilistic logic theory. In order to manage inconsistent possibilistic logic programs, a preference criterion between inconsistent possibilistic models is defined. In addition, the approach of cuts for restoring consistency of an inconsistent possibilistic knowledge base is adopted. The approach is illustrated in a medical scenario.

scholarly journals Towards a Calendar Agent Society with Intelligent Agents in ASP-Updates

2012 ◽  
Vol 22 ◽  
pp. 48-54
Author(s):  
Juan C. Acosta G. ◽  
J. Raymundo Marcial Romero ◽  
Marco A. Ramos C. ◽  
J. A. Hernández Servín
Keyword(s):  
Logic Programming ◽  
Knowledge Base ◽  
Intelligent Agents ◽  
Common Goal ◽  
Bdi Agents ◽  
Agent Societies ◽  
Simple Protocol ◽  
Multi Agent ◽  
Answer Sets

We present the analysis and some preliminary specifications to describe a multi-agent society to represent dynamic appointments under in Answer-Sets Programming, by means of knowledge-base updates. This is a case study to represent a group of intelligent BDI agents with a common goal of scheduling a meeting, and we use an example to show how to distribute and change their specifications under unforeseen circumstances, as well as a simple protocol to realise a consensual meeting. We claim that the proposed framework is appropriate to have the benefits from a strong foundation like Answer-Sets Programming, simplicity for its declarative logic programming, as well as practicality for existent implemented solvers, which can be used to implement a more-complete and useful system of agent societies.

CPF as a Tool for Constructing a Legal Knowledge Base

1998 ◽  
Vol 2 (1) ◽  
pp. 12-15
Author(s):  
Seiichiro Sakurai ◽  
Keyword(s):  
Knowledge Acquisition ◽  
Logic Programming ◽  
Knowledge Base ◽  
Programming Language ◽  
Legal Knowledge ◽  
Logic Programming Language

To construct a legal knowledge base, knowledge engineers must incorporate implicit lawyer expertise. Knowledge acquisition problems still arise in legal domains. If a lawyer can construct a legal knowledge base, the problem may be solved. CPF, a logic programming language, is proposed for lawyers to express legal knowledge. Since CPF is still complicated for lawyers, however, knowledge base written by lawyers may not be executable. This paper describes a method to construct an executable knowledge base from an unexecutable knowledge base written by lawyers. Since the most expressions written by lawyers are retained, the constructed knowledge base is comprehensible to lawyers.

Sign in / Sign up

Export Citation Format

Share Document