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

Translation of logic programs into functional fixpoint equations

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

DOI10.1016/0304-3975(89)90009-1zbMath0681.68108OpenAlexW2045499073MaRDI QIDQ1823723

Georges Gardarin, Christophe de Maindreville, Irène Guessarian

Publication date: 1989

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(89)90009-1

zbMATH Keywords

recursive queriesTarski's theoremconnection graphfixpoint equationmagic function method


Mathematics Subject Classification ID

Artificial intelligence (68T99) Information storage and retrieval of data (68P20)


Related Items

Recursive queries and context-free graph grammars, Fixpoint strategies for deductive databases, Backchain iteration: Towards a practical inference method that is simple enough to be proved terminating, sound, and complete



Cites Work

  • A lattice-theoretical fixpoint theorem and its applications
  • Implementation of logical query languages for databases
  • On compiling queries in recursive first-order databases
  • The theory of languages
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1823723&oldid=14187798"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 10:51.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki