Functional queries in datalog
From MaRDI portal
Publication:1862647
DOI10.1007/BF03037371zbMath1032.68070OpenAlexW2023389410MaRDI QIDQ1862647
Sergio Flesca, Stefano Basta, Sergio Greco
Publication date: 15 July 2003
Published in: New Generation Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf03037371
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tie-breaking semantics and structural totality
- The expressive power of stratified logic programs
- Computable queries for relational data bases
- Datalog extensions for database queries and updates
- Why not negation by fixpoint?
- Stable and extension class theory for logic programs and default logics
- Recursive query processing: The power of logic
- The expressive powers of stable models for bound and unbound DATALOG queries
- ``Possible is certain is desirable and can be expressive
- Structure and complexity of relational queries
- Languages that Capture Complexity Classes
- Autoepistemic logic
- The well-founded semantics for general logic programs
- On the equivalence of semantics for normal logic programs
- Modular stratification and magic sets for Datalog programs with negation
- Deterministic and non-deterministic stable models
This page was built for publication: Functional queries in datalog
