Copyright © 2003, Idea Group Inc. ABSTRACT In this chapter, we propose the use of first-order logic, in the form of deductive database rules, as a query language for XML data, and we present X-DEVICE, an extension of the deductive object-oriented database system DEVICE, for storing and querying XML data. XML documents are stored into the OODB by automatically mapping the DTD to an object schema...

In this paper we describe our experiment using an extension of the deductive database system LDL ++ AOTZ93, AOZ93, AO93] to express situations that need spatio-temporal reasoning in Sea monitoring. The temporal extension we used is LDLT DM94], a temporal database proposal that integrates the expressiveness and deductive power of the logic language LDL NT88] with the possibility to perform tempo...

the main objective of this study is to swing krull intersection theorem in primary decomposition of rings and modules to the primary decomposition of soft rings and soft modules. to fulfill this aim several notions like soft prime ideals, soft maximal ideals, soft primary ideals, and soft radical ideals are introduced for a soft ring over a given unitary commutative ring. consequently, the p...

This paper discusses and compares various answers to the question when argumentation is deductive. includes an answer questions defeasible whether a subclass of deductive or it distinct form argumentation. It concluded that as conceived by Philosophers like Pollock Rescher formalised in ASPIC+ framework systems Defeasible Logic Programming, are semantically different categories. For this reason...

The basic assumption in relational and deductive databases is that there are no gaps in our knowledge. That is, the database cannot store data that contain null values or data that is indeenite. In practical situations knowledge is not precise, and there are gaps in our knowledge. These gaps may be due to null values in the data, may arise when we combine several databases that lead to inconsis...

The focus of this paper lies on the proof-theory for extensions of Logic Programming in which it is possible to draw negative conclusions both in a direct (i.e., based on a proof) and in an indirect (i.e., based on the lack of a proof) way. These extensions are provided with a rule-based deductive system in the sense of the work of Jager [8] for Normal Logic Programs. Rule-based deductive syst...

The aim of this paper is to propose dynamic logic as a cotmnon logical framework to describe and identify the most relevant formal characteristics of multi-language logical architectures (MLA) in order to investigate the expressive power of the knowledge bases that can be built upon them. In general, a MLA allows to build knowledge bases as a set of units with initial local theories written in ...

Abstract State Machines (ASMs, for short) provide a practical new computational model which has been applied in the area of software engineering for systems design and analysis. However, reasoning about ASM models occurs, not within a formal deductive system, but basically in the classical informal proofs style of mathematics. Several formal verification approaches for proving correctness of AS...