We propose to enhance the functionality of the OLAP systems by incorporating the knowledge extraction component. The extracted knowledge is mainly to benefit the OLAP analysts by guiding them to the interesting portio...
详细信息
ISBN:
(纸本)0889863946
We propose to enhance the functionality of the OLAP systems by incorporating the knowledge extraction component. The extracted knowledge is mainly to benefit the OLAP analysts by guiding them to the interesting portions of data and augmenting the precious information to the query results. We also describe the OLAP architecture extending with the knowledge management part. The Datalog-like rule-based language is proposed to be the unified language for knowledge representation and manipulation. The functionalities of the language are illustrated via examples.
In this book, we incrementally specify, semantically characterize, and illustrate with examples, the concepts and tools necessary to the development of Evolving Knowledge Bases (EKB). An EKB is a knowledge base which ...
详细信息
ISBN:
(数字)9781601294258
ISBN:
(纸本)9781586032784
In this book, we incrementally specify, semantically characterize, and illustrate with examples, the concepts and tools necessary to the development of Evolving Knowledge Bases (EKB). An EKB is a knowledge base which can not only be externally updated, but is also capable of self evolution by means of its internally specified behavior. To this purpose, we first define the notion of Dynamic logic programming, based on the concept of logic Program Updates, which characterizes knowledge given by a sequence of logic programs, each representing a state of the world. Then, we set forth a language capable of uniformly specify both the external updates as well as the knowledge base's internal behaviour and its updates.
The proceedings contains 26 papers from the Fifth ACM SIGPLAN Conference on Principle and Practice of Declarative programming. The topics discussed include: a functional correspondence between evaluators and abstract ...
详细信息
ISBN:
(纸本)1581137052
The proceedings contains 26 papers from the Fifth ACM SIGPLAN Conference on Principle and Practice of Declarative programming. The topics discussed include: a functional correspondence between evaluators and abstract machines;conditional narrowing without conditions;finding all minimal unsatisfiable subsets;formally deriving an STG machine;and refining weakly outermost-needed rewriting and narrowing.
This is about the implementation of a cooperative information-gathering agent as Morph on Squeak. The purpose of this project is to make an agent that solves this point on Squeak. This agent includes three main functi...
详细信息
ISBN:
(纸本)076951975X
This is about the implementation of a cooperative information-gathering agent as Morph on Squeak. The purpose of this project is to make an agent that solves this point on Squeak. This agent includes three main functions. First, it collects information. Second, it shows information to the user, who selects from it, and then properly stores it. Lastly, which is also a characteristic, it allows fellow agents that have received information disclosure range and per-mission from the user exchange information to further refine it. With these three functioning continually, the circulation of knowledge occurs, and the Internet can become a true knowledge processor.
We integrate an expressive class of description logics (DLs) and answer set programming by extending the latter to support inverted predicates and infinite domains, features that are present in most DLs. The extended ...
详细信息
This paper presents an approach that allows us to increase efficiency of the constraint propagation method. This approach consists in using a strategy of calls of narrowing operators in the process of computation on t...
详细信息
The cogen approach to program specialisation, writing a compiler generator instead of a specialiser, has been used with considerable success. This paper demonstrates that the cogen approach is also applicable to the s...
详细信息
The proceedings contain 20 papers from the Web Knowledge Management and Decision Support - 14th International Conference on Applications of Prolog, INAP 2001. The topics discussed include: the rule markup language: RD...
详细信息
The proceedings contain 20 papers from the Web Knowledge Management and Decision Support - 14th International Conference on Applications of Prolog, INAP 2001. The topics discussed include: the rule markup language: RDF-XML data model, XML schema hierarchy, and XSL transformations;software components for Internet based self-service consulting systems;preferring and updating in logic-based agents;relational information retrieval through natural language analysis;towards reconciling use cases via controlled language and graphical models;selection restrictions acquisition for parsing improvement;connecting databases with argumentation;and action rules for programming constraint propagators and interactive user interfaces.
A method for finding bugs in object-oriented code is presented. It is capable of checking complex user-defined structural properties - that is, of the configuration of objects on the heap - and generates counterexampl...
详细信息
The correspondence between Reiter's default reasoning and logic programming has been exhaustively studied (e.g. [1], [2], [3]). A Contrario the relation with the many variants of the initial theory of Reiter seems...
详细信息
The correspondence between Reiter's default reasoning and logic programming has been exhaustively studied (e.g. [1], [2], [3]). A Contrario the relation with the many variants of the initial theory of Reiter seems far less known. This paper aims to present a preliminary investigation on applying a variant of default reasoning proposed by Witold Lukaszewicz [5] to extended logic programs. We show that the modification made to the notion of extension by Lukaszewicz has its counterpart as a relaxed notion of answer set of an extended logic program. As can be expected from this correspondence: (1) any extended logic program has always at least one relaxed answer set;(2) classical answer sets can be completely characterized among the set of relaxed answer sets of an extended logic program.
暂无评论