Set constructors in a logic database language

Beeri, Catriel; Naqvi, Shamim A.; Shmueli, Oded; Tsur, Shalom

doi:10.1016/0743-1066(91)90036-o

Cited by 74 publications

(28 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Note that the possibility of including some limited form of negation for (side-effect-free) method invocations, as well as some grouping mechanisms could be interesting for our language. In this case, some stratification conditions would need to be imposed on the method implementations, both with respect to negation [19] and sets [20]. Since, however, negation and grouping do not raise new issues in our language, we have decided not to include them in order to focus on the more innovative aspects of the language.…”

Section: Recursive Methodsmentioning

confidence: 98%

A set‐oriented method definition language for object databases and its semantics

Bertino

Guerrini

Merlo

2003

Concurrency and Computation

View full text Add to dashboard Cite

SUMMARYIn this paper we propose a set-oriented rule-based method definition language for object-oriented databases. Most existing object-oriented database systems exploit a general-purpose imperative objectoriented programming language as the method definition language. Because methods are written in a general-purpose imperative language, it is difficult to analyze their properties and to optimize them. Optimization is important when dealing with a large amount of objects as in databases. We therefore believe that the use of an ad hoc, set-oriented language can offer some advantages, at least at the specification level. In particular, such a language can offer an appropriate framework to reason about method properties.In this paper, besides defining a set-oriented rule-based language for method definition, we formally define its semantics, addressing the problems of inconsistency and non-determinism in set-oriented updates. Moreover, we characterize some relevant properties of methods, such as conflicts among method specifications in sibling classes and behavioral refinement in subclasses.

show abstract

Section: Recursive Methodsmentioning

confidence: 98%

A set‐oriented method definition language for object databases and its semantics

Bertino

Guerrini

Merlo

2003

Concurrency and Computation

View full text Add to dashboard Cite

show abstract

“…The extended data model induces extensions to relational query languages and leads to the definition of complex-value relational calculus (calc cv ) and a deductive language for complex values, Datalog cv -the language of Horn clauses built from literals whose arguments range over complexvalued variables and constants [2,26]. Datalog cv programs and queries are defined as follows: Datalog cv is equivalent to the complex-value calculus in expressive power [1].…”

Section: Complex Data Modelmentioning

confidence: 99%

“…However, unlike most other approaches that usually attempt to use various compact representation techniques for automata, e.g., based on BDDs [5] or on state space factoring using a guided automaton [17], our approach is based on techniques developed for program evaluation in deductive databases, in particular on the Magic Set transformation [2] and SLG resolution, a top-down resolution-based approach augmented with memoing [9,10]. We also study the impact of using other optimization techniques developed for Logic Programs, such as goal reordering.…”

Section: Introductionmentioning

confidence: 99%

Logic programming approach to automata-based decision procedures

Unel

Toman

2017

Journal of Logical and Algebraic Methods in Programming

View full text Add to dashboard Cite

Abstract. We propose a novel technique that maps decision problems in WS1S (weak monadic second-order logic with n successors) to the problem of query evaluation of Complex-value Datalog queries. We then show how the use of advanced implementation techniques for Logic Programs, in particular the use of tabling in the XSB system, yields a considerable improvement in performance over more traditional approaches. We also explore various optimizations of the proposed technique based on variants of tabling and goal reordering. Although our primary focus is on WS1S, it is straightforward to adapt our approach for other logics with existing automata-theoretic decision procedures, for example WS2S.

show abstract

“…Following Beeri et al BNST91], we extend the de nition of terms to allow sets in terms. We use simple terms to refer to the standard de nition of terms.…”

Section: Databases and Programs { Syntaxmentioning

confidence: 99%

The valid model semantics for logic programs

Beeri¹,

Ramakrishnan²,

Srivastava³

et al. 1992

Proceedings of the Eleventh ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems - PODS '92

Self Cite

View full text Add to dashboard Cite

We present the valid model semantics, a new approach to providing semantics for logic programs with negation, setterms and grouping. The valid model semantics is a threevalued semantics, and is de ned in terms of a`normal form' computation. The valid model semantics also gives meaning to the generation and use of non-ground facts (i.e., facts with variables) in a computation.The formulation of the semantics in terms of a normal form computation o ers important insight not only into the valid model semantics, but also into other semantics proposed earlier. We show that the valid model semantics extends the well-founded semantics in a natural manner, and has several advantages over it. The well-founded semantics can also be understood using a variant of the normal form computations that we use; the normal form computations used for valid semantics seem more natural than those used for well-founded semantics.We also show that the valid model semantics has several other desirable properties: it is founded ( SZ90]), it is contained in every regular model ( YY90]), and it is contained in every two-valued stable model.

show abstract

Set constructors in a logic database language

Cited by 74 publications

References 11 publications

A set‐oriented method definition language for object databases and its semantics

A set‐oriented method definition language for object databases and its semantics

Logic programming approach to automata-based decision procedures

The valid model semantics for logic programs

Contact Info

Product

Resources

About