Functional queries in datalog
type: Item
instance of: scholarly article
title: Functional queries in datalog
zbMATH Open document ID: 1032.68070
DOI: 10.1007/BF03037371
author: Stefano Basta
author: Sergio Flesca
author: Sergio Greco
published in: New Generation Computing
publication date: 2003-07-15T00:00:00Z
Mathematics Subject Classification ID: 68P15
zbMATH DE Number: 1885641
zbMATH Keywords: expressive power
zbMATH Keywords: data complexity
zbMATH Keywords: DATALOG\(^\neg\)
describes a project that uses: Datalog
MaRDI profile type: Publication
cites work: Q4864249
cites work: Datalog extensions for database queries and updates
cites work: Stable and extension class theory for logic programs and default logics
cites work: Computable queries for relational data bases
cites work: Structure and complexity of relational queries
cites work: Q4058132
cites work: ``Possible is certain'' is desirable and can be expressive
cites work: Languages that Capture Complexity Classes
cites work: Q4385525
cites work: The expressive power of stratified logic programs
cites work: Why not negation by fixpoint?
cites work: Q3339245
cites work: Q4285787
cites work: Autoepistemic logic
cites work: Q4298260
cites work: Tie-breaking semantics and structural totality
cites work: Q3486858
cites work: Modular stratification and magic sets for Datalog programs with negation
cites work: The expressive powers of stable models for bound and unbound DATALOG queries
cites work: Deterministic and non-deterministic stable models
cites work: The well-founded semantics for general logic programs
cites work: Recursive query processing: The power of logic
cites work: On the equivalence of semantics for normal logic programs
full work available at URL: https://doi.org/10.1007/bf03037371
OpenAlex ID: W2023389410
description: scientific article; zbMATH DE number 1885641