Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

On Datalog vs. LFP

From MaRDI portal
Publication:3519499
Jump to:navigation, search

DOI10.1007/978-3-540-70583-3_14zbMath1155.68402OpenAlexW1897022643WikidataQ58215582 ScholiaQ58215582MaRDI QIDQ3519499

Stephan Kreutzer, Anuj Dawar

Publication date: 19 August 2008

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70583-3_14



Mathematics Subject Classification ID

Logic in computer science (03B70) Model theory of finite structures (03C13) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Interpolation, preservation, definability (03C40) Descriptive complexity and finite models (68Q19)


Related Items (3)

Datalog Queries Distributing over Components ⋮ Unnamed Item ⋮ Unnamed Item


Uses Software

  • Datalog





This page was built for publication: On Datalog vs. LFP

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3519499&oldid=16888233"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 4 February 2024, at 23:50.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki