Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

The branching-time transformation technique for chain datalog programs

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

DOI10.1023/A:1012502800961zbMATH Open0985.68020MaRDI QIDQ5952811FDOQ5952811

Panos Rondogiannis, Manolis Gergatsoulis

Publication date: 22 January 2002

Published in: Journal of Intelligent Information Systems (Search for Journal in Brave)




zbMATH Keywords

Branching Datalogbranching-time logic programmingbranching-time transformationChain Datalog


Mathematics Subject Classification ID

Logic programming (68N17) Database theory (68P15)



Cited In (2)

  • Temporal stratification tests for linear and branching-time deductive databases
  • A PROOF PROCEDURE FOR TEMPORAL LOGIC PROGRAMMING

Uses Software

  • CACTUS
  • Datalog


   Recommendations
  • A value-propagating transformation technique for Datalog programs based on non-deterministic constructs πŸ‘ πŸ‘Ž
  • Title not available (Why is that?) πŸ‘ πŸ‘Ž
  • Branching-time logic programming: the language Cactus and its applications πŸ‘ πŸ‘Ž
  • The transformational approach to program development πŸ‘ πŸ‘Ž
  • Linear time Datalog and branching time logic πŸ‘ πŸ‘Ž





This page was built for publication: The branching-time transformation technique for chain datalog programs

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5952811&oldid=12116425"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 30 January 2024, at 01:04. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki