An algebra for pomsets.

DOI10.1006/inco.1998.2777zbMath1045.68558OpenAlexW2019909852MaRDI QIDQ1854275

Tova Milo, Stéphane Grumbach

Publication date: 14 January 2003

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1998.2777

zbMATH Keywords

relational databasesPTIME queries

Mathematics Subject Classification ID

Database theory (68P15) Logic in computer science (03B70) Descriptive complexity and finite models (68Q19)

Related Items (2)

Structural recursion as a query language on lists and ordered trees ⋮ Computing possible and certain answers over order-incomplete data

Cites Work

• Fixed-point extensions of first-order logic
• Computable queries for relational data bases
• Relational queries computable in polynomial time
• On Database Logic
• Efficient Planarity Testing
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An algebra for pomsets.