Computing thejth solution of a first-order query

DOI10.1051/ITA:2007046MaRDI QIDQ3514640zbMATH OpenOpenAlexFDO

Authors Guillaume Bagan, Arnaud Durand, Etienne Grandjean, Frédéric Olive

Publication date 21 July 2008

Published in RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/92857

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Descriptive complexity and finite models (68Q19)

Recommendations

• First-order queries on structures of bounded degree are computable with constant delay
• First-Order Queries over One Unary Function
• The logic of counting query answers
• Constant delay enumeration for FO queries over databases with local bounded expansion
• First-order logic with counting: at least, \textit{weak} Hanf normal forms always exist and can be computed!

Cites work

• A NORMAL FORM FOR FIRST-ORDER LOGIC OVER DOUBLY-LINKED DATA STRUCTURES
• Deciding first-order properties of locally tree-decomposable structures
• Elements of finite model theory.
• First-order queries on structures of bounded degree are computable with constant delay
• First-Order Queries over One Unary Function
• scientific article; zbMATH DE number 2080462 (Why is no real title available?)
• scientific article; zbMATH DE number 819814 (Why is no real title available?)
• scientific article; zbMATH DE number 969067 (Why is no real title available?)
• Linear delay enumeration and monadic second-order logic
• Machine-Independent Characterizations and Complete Problems for Deterministic Linear Time
• MSO Queries on Tree Decomposable Structures Are Computable with Linear Delay
• On Acyclic Conjunctive Queries and Constant Delay Enumeration
• On the complexity of database queries
• The complexity of acyclic conjunctive queries

Cited in

(12)

• Structural tractability of enumerating CSP solutions
• Constant delay enumeration for FO queries over databases with local bounded expansion
• A NORMAL FORM FOR FIRST-ORDER LOGIC OVER DOUBLY-LINKED DATA STRUCTURES
• First-Order Queries over One Unary Function
• First-order queries on classes of structures with bounded expansion
• The logic of counting query answers
• Direct access for conjunctive queries with negations
• Enhancing query efficiency for D-DNNF representations through preprocessing
• Direct access for conjunctive queries with negations
• Direct access for answers to conjunctive queries with aggregation
• Direct access for answers to conjunctive queries with aggregation
• Dynamic direct access of MSO query evaluation over strings

This page was built for publication: Computing thejth solution of a first-order query

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3514640)