Deciding boundedness for uniformly connected datalog programs

DOI10.1007/3-540-53507-1_91MaRDI QIDQ4694701zbMATH OpenFDO

Authors Irène Guessarian

Publication date 29 June 1993

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-53507-1_91

zbMATH Keywords

boundednessconnected Datalog programsdecidabilityuniformly connected programs

Mathematics Subject Classification ID

Logic programming (68N17) Information storage and retrieval of data (68P20)

Recommendations

• About Boundedness for some Datalog and Datalog^neg Programs
• About boundedness for some DATALOG and DATALOG\textsuperscript{neg} programs
• Undecidable boundedness problems for datalog programs
• PREDICATE BOUNDEDNESS OF LINEAR MONADIC DATALOG IS IN PSPACE
• Boundedness is undecidable for datalog programs with a single recursive rule

Cited in

(10)

• Deciding the bisimilarity relation between Datalog goals
• Undecidability and intractability results concerning Datalog programs and their persistency numbers
• On Bounded Database Schemes and Bounded Horn-Clause Programs
• About Boundedness for some Datalog and Datalog^neg Programs
• A datalog-based computational model for coordination-free, data-parallel systems
• The 3 Frenchmen method proves undecidability of the uniform boundedness for single recursive rule ternary DATALOG Programs
• scientific article; zbMATH DE number 6820296 (Why is no real title available?)
• About boundedness for some DATALOG and DATALOG\textsuperscript{neg} programs
• Datalog programs and their persistency numbers
• Datalog queries distributing over components

Describes a project that uses

Uses Software

• Datalog

This page was built for publication: Deciding boundedness for uniformly connected datalog programs

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