Logic And Prolog Database System

1989 ◽  
pp. 41-48
Author(s):  
Mohamed Othman
Keyword(s):  
Relational Database ◽  
Question Answering ◽  
Predicate Logic ◽  
Database System ◽  
Large Set ◽  
Inference System ◽  
First Order ◽  
Small Set ◽  
Representation Language ◽  
Initial Research

This paper discusses an initial research of a subfield of first order predicate logic applied to the database. Consideration has been made toward the relational database system.Here,the logic used boths as an inference system as well as a representation language. The use of logic for knowledge representation and manipulation is previously due to the work of question-answering system, which have been mainly concerned with the deductive manipulation of a small set of facts and thus require an inferential mechanism provided by logic. Similar techniques have been adopted to databases to handle large set of facts, open queries, and others. Keywords: Relational database, Programming in logic, classical interpretation, unification and queries

Modelling spatial reasoning systems with shape algebras and formal logic

1997 ◽  
Vol 11 (4) ◽  
pp. 273-285 ◽  
Author(s):  
Scott C. Chase
Keyword(s):  
Spatial Reasoning ◽  
Predicate Logic ◽  
Spatial Relations ◽  
Large Set ◽  
First Order ◽  
Reasoning Systems ◽  
Geometric Objects ◽  
Small Set ◽  
Definition Of ◽  
High Level

AbstractThe combination of the paradigms of shape algebras and predicate logic representations, used in a new method for describing designs, is presented. First-order predicate logic provides a natural, intuitive way of representing shapes and spatial relations in the development of complete computer systems for reasoning about designs. Shape algebraic formalisms have advantages over more traditional representations of geometric objects. Here we illustrate the definition of a large set of high-level design relations from a small set of simple structures and spatial relations, with examples from the domains of geographic information systems and architecture.

Source-Oriented Data Processing. The triumph of the micro over the macro?

1996 ◽  
Vol 8 (3) ◽  
pp. 160-168 ◽  
Author(s):  
Janet Burt ◽  
Tom Beaumont James
Keyword(s):  
Data Processing ◽  
Relational Database ◽  
Database System ◽  
Relational Database System ◽  
Historical Databases ◽  
Oriented Approach

This article discusses the different approaches to the treatment of historical databases: the relational database system and κλειω, a source-oriented approach.

Scalable linear algebra on a relational database system

2020 ◽  
Vol 63 (8) ◽  
pp. 93-101
Author(s):  
Shangyu Luo ◽  
Zekai J. Gao ◽  
Michael Gubanov ◽  
Luis L. Perez ◽  
Dimitrije Jankov ◽  
...  
Keyword(s):  
Linear Algebra ◽  
Relational Database ◽  
Database System ◽  
Relational Database System

Syllogism and quantification

1962 ◽  
Vol 27 (1) ◽  
pp. 58-72 ◽  
Author(s):  
Timothy Smiley
Keyword(s):  
Predicate Logic ◽  
Modern Logic ◽  
First Order ◽  
First Order Predicate Logic

Anyone who reads Aristotle, knowing something about modern logic and nothing about its history, must ask himself why the syllogistic cannot be translated as it stands into the logic of quantification. It is now more than twenty years since the invention of the requisite framework, the logic of many-sorted quantification.In the familiar first-order predicate logic generality is expressed by means of variables and quantifiers, and each interpretation of the system is based upon the choice of some class over which the variables may range, the only restriction placed on this ‘domain of individuals’ being that it should not be empty.

Some logical and syntactical observations concerning the first-order dependent type system λP

1999 ◽  
Vol 9 (4) ◽  
pp. 335-359 ◽  
Author(s):  
HERMAN GEUVERS ◽  
ERIK BARENDSEN
Keyword(s):  
Predicate Logic ◽  
Type System ◽  
Logical Framework ◽  
First Order ◽  
Logical Derivation ◽  
Dependent Type ◽  
First Order Predicate Logic

We look at two different ways of interpreting logic in the dependent type system λP. The first is by a direct formulas-as-types interpretation à la Howard where the logical derivation rules are mapped to derivation rules in the type system. The second is by viewing λP as a Logical Framework, following Harper et al. (1987) and Harper et al. (1993). The type system is then used as the meta-language in which various logics can be coded.We give a (brief) overview of known (syntactical) results about λP. Then we discuss two issues in some more detail. The first is the completeness of the formulas-as-types embedding of minimal first-order predicate logic into λP. This is a remarkably complicated issue, a first proof of which appeared in Geuvers (1993), following ideas in Barendsen and Geuvers (1989) and Swaen (1989). The second issue is the minimality of λP as a logical framework. We will show that some of the rules are actually superfluous (even though they contribute nicely to the generality of the presentation of λP).At the same time we will attempt to provide a gentle introduction to λP and its various aspects and we will try to use little inside knowledge.

First order predicate logic

1986 ◽  
pp. 155-183
Author(s):  
Igor Aleksander ◽  
Henri Farreny ◽  
Malik Ghallab
Keyword(s):  
Predicate Logic ◽  
First Order ◽  
First Order Predicate Logic

scholarly journals Higher-Order Illative Combinatory Logic

2013 ◽  
Vol 78 (3) ◽  
pp. 837-872 ◽  
Author(s):  
Łukasz Czajka
Keyword(s):  
Strong Consistency ◽  
Predicate Logic ◽  
Higher Order ◽  
Second Order ◽  
Model Construction ◽  
Partial Answer ◽  
Combinatory Logic ◽  
First Order ◽  
Propositional Quantifiers

AbstractWe show a model construction for a system of higher-order illative combinatory logic thus establishing its strong consistency. We also use a variant of this construction to provide a complete embedding of first-order intuitionistic predicate logic with second-order propositional quantifiers into the system of Barendregt, Bunder and Dekkers, which gives a partial answer to a question posed by these authors.

The design of the Triton nested relational database system

1991 ◽  
Vol 20 (3) ◽  
pp. 62-72 ◽  
Author(s):  
Tina M. Harvey ◽  
Craig W. Schnepf ◽  
Mark A. Roth
Keyword(s):  
Relational Database ◽  
Database System ◽  
Relational Database System
Sign in / Sign up

Export Citation Format

Share Document