Storage and retrieval of first-order terms using a relational database

1993 ◽  
pp. 199-219 ◽  
Author(s):  
Paul Singleton ◽  
Pearl Brereton
Keyword(s):  
Relational Database ◽  
First Order ◽  
Storage And Retrieval

scholarly journals VERIFICATION OF CONJUNCTIVE ARTIFACT-CENTRIC SERVICES

2012 ◽  
Vol 21 (02) ◽  
pp. 111-139 ◽  
Author(s):  
GIUSEPPE DE GIACOMO ◽  
RICCARDO DE MASELLIS ◽  
RICCARDO ROSATI
Keyword(s):  
Relational Database ◽  
Data Exchange ◽  
Recent Literature ◽  
Conjunctive Queries ◽  
First Order ◽  
Temporal Properties ◽  
Verification Time

An artifact-centric service is a stateful service that holistically represents both the data and the process in terms of a (dynamic) artifact. An artifact is constituted by a data component, holding all the data of interest for the service, and a lifecycle, which specifies the process that the service enacts. In this paper, we study artifact-centric services whose data component is a full-fledged relational database, queried through (first-order) conjunctive queries, and the lifecycle component is specified as sets of condition-action rules, where actions are tasks invocations, again based on conjunctive queries. Notably, the database can evolve in an unbounded way due to new values (unknown at verification time) inserted by tasks. The main result of the paper is that verification in this setting is decidable under a reasonable restriction on the form of tasks, called weak acyclicity, which we borrow from the recent literature on data exchange. In particular, we develop a sound, complete and terminating verification procedure for sophisticated temporal properties expressed in a first-order variant of μ-calculus.

scholarly journals A Programming Language for the Inductive Sets, and Applications

1982 ◽  
Vol 11 (143) ◽  
Author(s):  
David Harel ◽  
Dexter Kozen
Keyword(s):  
Programming Language ◽  
Relational Database ◽  
Query Language ◽  
Dynamic Logic ◽  
Computational Approach ◽  
Turing Machines ◽  
First Order ◽  
Separation Result ◽  
Alternating Turing Machines ◽  
Order Structures

We introduce a programming language IND that generalizes alternating Turing machines to arbitrary first-order structures. We show that IND programs (respectively, everywhere-halting IND programs, loop-free IND programs) accept precisely the inductively definable (respectively, hyperelementary, elementary) relations. We give several examples showing how the language provides a robust and computational approach to the theory of first-order inductive definability. We then show: (1) on all acceptable structures (in the sense of Moschovakis), r.e. Dynamic Logic is more expressive than finite-test Dynamic Logic. This refines a separation result of Meyer and Parikh; (2) IND provides a natural query language for the set of fixpoint queries over a relational database, answering a question of Chandra and Harel.

The Graph Traversal Pattern

2011 ◽  
pp. 29-46 ◽  
Author(s):  
Marko A. Rodriguez ◽  
Peter Neubauer
Keyword(s):  
Computer Science ◽  
19Th Century ◽  
Relational Database ◽  
Relational Databases ◽  
Information Storage And Retrieval ◽  
Information Storage ◽  
Late 19Th Century ◽  
Data Management Systems ◽  
Storage And Retrieval ◽  
Graph Traversal

A graph is a structure composed of a set of vertices (i.e. nodes, dots) connected to one another by a set of edges (i.e. links, lines). The concept of a graph has been around since the late 19th century, however, only in recent decades has there been a strong resurgence in both theoretical and applied graph research in mathematics, physics, and computer science. In applied computing, since the late 1960s, the interlinked table structure of the relational database has been the predominant information storage and retrieval model. With the growth of graph/network-based data and the need to efficiently process such data, new data management systems have been developed. In contrast to the index-intensive, set-theoretic operations of relational databases, graph databases make use of index-free, local traversals. This chapter discusses the graph traversal pattern and its use in computing. (Angles & Guiterrez, 2008)

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

Dual systems for all: Higher-order, role-based relational reasoning as a uniquely derived feature of human cognition

2019 ◽  
Vol 42 ◽  
Author(s):  
Daniel J. Povinelli ◽  
Gabrielle C. Glorioso ◽  
Shannon L. Kuznar ◽  
Mateja Pavlic
Keyword(s):  
Temporal Reasoning ◽  
Higher Order ◽  
Important Case ◽  
Human Cognition ◽  
Relational Reasoning ◽  
Dual Systems ◽  
First Order ◽  
Reasoning System ◽  
Role Based

Abstract Hoerl and McCormack demonstrate that although animals possess a sophisticated temporal updating system, there is no evidence that they also possess a temporal reasoning system. This important case study is directly related to the broader claim that although animals are manifestly capable of first-order (perceptually-based) relational reasoning, they lack the capacity for higher-order, role-based relational reasoning. We argue this distinction applies to all domains of cognition.

Stochasting modeling of planetary ring systems

1984 ◽  
Vol 75 ◽  
pp. 461-469 ◽  
Author(s):  
Robert W. Hart
Keyword(s):  
Maximum Entropy ◽  
Ring System ◽  
The Sun ◽  
Ultimate State ◽  
Interparticle Interactions ◽  
Ring Systems ◽  
First Order ◽  
Planetary Ring ◽  
Insight Into

ABSTRACTThis paper models maximum entropy configurations of idealized gravitational ring systems. Such configurations are of interest because systems generally evolve toward an ultimate state of maximum randomness. For simplicity, attention is confined to ultimate states for which interparticle interactions are no longer of first order importance. The planets, in their orbits about the sun, are one example of such a ring system. The extent to which the present approximation yields insight into ring systems such as Saturn's is explored briefly.

Sign in / Sign up

Export Citation Format

Share Document