Towards a deductive object-oriented database language

A language for databases with sets, tuples, lists, object identity and structural inheritance is proposed. The core language is logic-based with a fixpoint semantics. Methods with overloading and methods evaluated externally providing extensibility of the language are considered. Other important issues such as updates and the introduction of explicit control are discussed.     

An object-oriented deductive language

We propose a logic for objects that captures the knowledge represented with the LAURE object-oriented language. The work is oriented toward efficient implementation and compilation of queries. A data model for object-oriented databases is presented, with a declarative logic language used to perform queries and positive updates on the database. The expressiveness of this language is reduced, compared to other propositions in the same field, by the use of purely Horn clauses. An equivalent relational algebra is given, from which a formal technique for performing positive updates, called differentiation, is obtained. Two algorithms are proposed that achieve a sound and complete resolution, either for a bottom-up evaluation or a top-down resolution. An efficient implementation of constraint resolution is presented in this framework.     

演绎对象数据库中基于行为规则的继承方法

在演绎对象数据库的研究和发展过程中,仍有两个重要的问题未能很好的解决：非单调的多值结构和行为规则的继承;基于规则的行为的封装。针对前一个问题,文中提出了几种解决的方法。特别是提出了一种新的继承方法——行为继承的回退,以获得更多的信息。通过一个数据库实例以及对它的查询,进一步说明这些继承的思想。     

一个演绎对象数据库SD-DOOD的设计与实现

通过探寻面向对象数据库与知识库技术相结合的途径,研究演绎对象数据库系统实现的关键技术。以基于演绎数据库系统SD-DDBS,设计实现了一个演绎对象数据库系统原型SD-DOOD。系统支持类、类层次、对象、属性、方法、继承和封装等面向对象数据库系统的核心概念,支持演绎对象等演绎数据库的概念,提供了图形用户接口(GUI),便于用户进行创建、查询等操作。     

A deductive object-oriented database system for situated inferencein law

Deductive object-oriented databases and situation theory are two important areas of research in the fields of databases and of linguistics. “AI and law” is a new field attracting both AI researchers and legal practitioners. Our research brings together the former two fields with the aim of designing knowledge applications in the latter. This is achieved through a formal model for legal reasoning, 𝒮ℳ (“Situation-theoretic Model”), and a deductive object-oriented database system, 𝒬𝒰ℐ𝒳𝒪𝒯ℰ. The purpose of this paper is to introduce the key features of this formal model, based on situation theory, and to describe how this database system can implement this abstract model for complex legal reasoning applications. Concrete examples from legal precedents are used to illustrate these advanced features     

RELOOP, an algebra based query language for an object-oriented database system

In most object-oriented databases, as opposed to value-oriented databases, data are accessed by a programming language instead of a declarative query language. End users do not have a simple tool to perform their queries. This paper is concerned with the definition of an SQL-like query language on top of the O₂ object-oriented database system. We study the influence of the object-oriented paradigm on a query language, describe our language through examples, define its semantics by means of an algebra and sketch the compilation of RELOOP in one of the languages supported by the O₂ system.     

Verification of conceptual schemata based on hybrid object-oriented and logic paradigm

Contemporary conceptual modelling languages are concerned with the representational adequacy of knowledge about a universe of discourse and with the efficient organization of this knowledge in structures that help overcome the problems of size and complexity in the modelled reality. In the paper it is argued that a conceptual modelling language should also facilitate the verification of captured requirements by exercising the conceptual schemata derived from the use of such a language. A conceptual modelling language is presented that is based on a hybrid representation scheme that makes use of object-oriented and logic approaches, and it is shown how this language can be used to verify requirements during the development of information systems.     

On the declarative and procedural semantics of deductive object-oriented systems

We present declarative and procedural semantics for a deductive object-oriented language, Gulog. The declarative semantics is based on preferred minimal models. We describe both bottom-up and top-down query evaluation procedures and show that they are sound with respect to the declarative semantics. The results contribute to our understanding of the interaction of inheritance, overriding and deduction in the presence of both functional and set-valued methods, and multiple inheritance.     

The logic of totally and partially ordered plans: a deductive database approach

The problem of finding effective logic-based formalizations for problems involving actions remains one of the main application challenges of non-monotonic knowledge representation. In this paper, we show that complex planning strategies find natural logic-based formulations and efficient implementations in the framework of deductive database languages. We begin by modeling classical STRIPS-like totally ordered plans by means of Datalog_{1 S} programs, and show that these programs have a stable model semantics that is also amenable to efficient computation. We then show that the proposed approach is quite expressive and flexible, and can also model partially ordered plans, which are abstract plans whereby each plan stands for a whole class of totally ordered plans. This results in a reduction of the search space and a subsequent improvement in efficiency.     

An efficient implementation of SELF, a dynamically-typed object-oriented language based on prototypes

We have developed and implemented techniques that double the performance of dynamically-typed object-oriented languages. Our SELF implementation runs twice as fast as the fastest Smalltalk implementation, despite SELF's lack of classes and explicit variables.To compensate for the absence of classes, our system uses implementation-levelmaps to transparently group objects cloned from the same prototype, providing data type information and eliminating the apparent space overhead for prototype-based systems. To compensate for dynamic typing, user-defined control structures, and the lack of explicit variables, our system dynamically compilesmultiple versions of a source method, eachcustomized according to its receiver's map. Within each version the type of the receiver is fixed, and thus the compiler can statically bind andinline all messages sent toself.Message splitting andtype prediction extract and preserve even more static type information, allowing the compiler to inline many other messages. Inlining dramatically improves performance and eliminates the need to hard-wire low-level methods such as+, ==, andifTrue:.Despite inlining and other optimizations, our system still supports interactive programming environments. The system traverses internal dependency lists to invalidate all compiled methods affected by a programming change. The debugger reconstructs inlined stack frames from compiler-generated debugging information, making inlining invisible to the SELF programmer.This work has been generously supported by National Science Foundation Presidential Young Investigator Grant #CCR-8657631, and by IBM, Texas Instruments, NCR, Tandem Computers, Apple Computer, and Sun Microsystems.This paper was originally published inOOPSLA '89 Conference Proceedings (SIGPLAN Notices, 25, 10 (1989) 49–70).     

基于Delphi结构化语言开发电池设计数据库

用Delphi结构化语言实现了电池设计的数据库系统。知识库采用了Paradox数据库，链接了TTable和TQuery组件，为数据库提供了添加、修改和查询等强大功能。推理机采用精确计算与选择相结合的方法来确定符合条件的半反应电对。利用了面向对象的Windows编程方式，窗口界面友好直观和易于使用。而且系统安装后，可脱离Delphi独立运行。     

基于Atlas语言的数据库模型转换方法的研究

为了减少需求变更对软件开发的影响,提高软件开发效率和系统的可维护性,针对面向对象的数据库建设环节,在MDA思想的基础上,提出了基于元模型的UML模型到数据库模型的自动转换,建立了平台无关模型和平台相关模型的元模型,分析了Atlas的转换语言及其特点.以Web信息管理系统为例,说明了在模型转换中自动化地生成目标模型,并在一定程度上验证了MDA在软件开发中的可行性.     

OWL-QL—a language for deductive query answering on the Semantic Web

This paper discusses the issues involved in designing a query language for the Semantic Web and presents the OWL query language (OWL-QL) as a candidate standard language and protocol for query–answering dialogues among Semantic Web computational agents using knowledge represented in the W3Cs ontology web language (OWL). OWL-QL is a formal language and precisely specifies the semantic relationships among a query, a query answer, and the knowledge base(s) used to produce the answer. Unlike standard database and Web query languages, OWL-QL supports query–answering dialogues in which the answering agent may use automated reasoning methods to derive answers to queries, as well as dialogues in which the knowledge to be used in answering a query may be in multiple knowledge bases on the Semantic Web, and/or where those knowledge bases are not specified by the querying agent. In this setting, the set of answers to a query may be of unpredictable size and may require an unpredictable amount of time to compute.     

An implementation of the object-oriented concurrent programming language SINA

SINA is an object-oriented language for distributed and concurrent programming. The primary focus of this paper is on the object-oriented concurrent programming mechanisms of SINA and their implementation. This paper presents the SINA constructs for concurrent programming and inter-object communication, some illustrative examples and a message-based implementation model for SINA that we have used in our current implementation.     

Issues in the design of a parallel object-oriented language

This paper discusses the considerations that have played a role in the design of the language POOL2. This language integrates the structuring techniques of object-oriented programming with mechanisms for expressing parallelism. We introduce the basic principles of object-oriented programming and its significance for program development methodologies. Several approaches for integrating objects and parallelism are compared and arguments for the choices made in POOL2 are presented. We also explain why inheritance is not yet included in POOL2. A brief overview of the research in formal aspects of POOL is given. Finally we indicate some directions for future developments.     

An equational logic based approach to the security problem against inference attacks on object-oriented databases

A query is said to be secure against inference attacks by a user if there exists no database instance for which the user can infer the result of the query, using only authorized queries to the user. In this paper, first, the security problem against inference attacks on object-oriented databases is formalized. The definition of inference attacks is based on equational logic. Secondly, the security problem is shown to be undecidable, and a decidable sufficient condition for a given query to be secure under a given schema is proposed. The idea of the sufficient condition is to over-estimate inference attacks using over-estimated results of static type inference. The third contribution is to propose subclasses of schemas and queries for which the security problem becomes decidable. Lastly, the decidability of the security problem is shown to be incomparable with the static type inferability, although the tightness of the over-estimation of the inference attacks is affected in a large degree by that of the static type inference.     

多数据源查询的几种优化方法

信息时代带来了多数据源的集成，在多数据源研究领域中，查询晕迫切需要解决的问题。信息异构，信息量大是多数据源查询的特点。本文介绍了几种优化多数据源查询的方法，改进算法的线性模型，粗糙集分类模型，改进结构的分级查询模型，XML统一数据模型，以启发大家思路。