NYU Faculty Digital Archive
metadata only
EXTERNAL SEMANTIC QUERY SIMPLIFICATION: A GRAPH-THEORETIC APPROACH AND ITS IMPLEMENTATION IN PROLOG
Semantic query simplification utilizes integrity constraints enforced in a database system for reducing the number of tuple variables and terms in a relational calculus query. To a large degree, this can be done by a system that is external to the DBMS. The paper advocates the application of dat
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Datalog+/-: A Family of Logical Knowledge Representation and Query Languages for New Applications#254394
- Advanced Semantics#3436
- Message-based semantica for sat problems#732750
- PROLOG META-INTERPRETERS FOR RULE-BASED INFERENCE UNDER UNCERTAINTY#933573
- A SURVEY OF QUERY OPTIMIZATION IN CENTRALIZED DATABASE SYSTEMS#933704
Record · ID 933662
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive