NDLI: Universal finiteness and satisfiability (extended abstract)

Please wait, while we are loading the content...

Will I be pretty, will I be rich?: some thoughts on theory vs. practice in systems engineering

Beyond uniformity and independence: analysis of R-trees using the concept of fractal dimension

On the relative cost of sampling for join selectivity estimation

Path caching (extended abstract): a technique for optimal external searching

Optimal response time retrieval of replicated data (extended abstract)

Constraint checking with partial information

Compiling query constraints (extended abstract)

Constraints among argument sizes in logic programs (extended abstract)

Tutorial database mining

The power of sampling in knowledge discovery

Can Datalog be approximated?

Bonded arity Datalog (≠) queries on graphs

On the complexity of equivalence between recursive and nonrecursive Datalog programs

A decomposition-based simulated annealing technique for data clustering

Reducing recovery constraints on locking based protocols

Relative serializability (extended abstract): an approach for relaxing the atomicity of transactions

Tutorial: languages for collection types

New techniques for studying set languages, bag languages and aggregate functions

A query language for NC

A query language for list-based complex objects

Universal finiteness and satisfiability (extended abstract)

Any algorithm in the complex object algebra with powerset needs exponential space to compute transitive closure

Dyn-FO (preliminary version): a parallel, dynamic complexity class

Functional database query languages as typed lambda calculi of fixed order (extended abstract)

Object migration

Making object-oriented schemas more expressive

A polymorphic calculus for views and object sharing (extended abstract)

Adding disjunction to datalog (extended abstract)

Towards a theory of spatial database queries (extended abstract)

Finitely representable databases (extended abstract)

Text dominated databases, theory practice and experience (abstract)

Reasoning about strings in databases

Universal finiteness and satisfiability (extended abstract)

Content Provider	ACM Digital Library
Author	Shmueli, Oded Mumick, Inderpal Singh
Abstract	The problem of determining whether, for every extensional database, a given predicate in a given program has a finite number of derivations is called the universal finiteness problem. The problem of determining whether a given predicate in a given program has a non-empty extension for some extensional database is called the satisfiability problem. We show that the universal finiteness problem can be reduced to the satisfiability problem. Thus all decidability results for satisfiability can be applied to universal finiteness—for example, we can infer that the universal finiteness problem is decidable for Datalog extended with negation on base predicates. The satisfiability problem can be easily reduced to the universal finiteness problem, so that all undecidability results for satisfiability can be applied to universal finiteness. For example we can infer that the universal finiteness problem is undecidable for Datalog extended with stratified negation.Many recursive programs have infinite number of derivations only when ed b relations have data cycles. It is thus of particular interest to study universal finiteness in the presence of acyclicity constraints on the ed b relations. We define acyclicity constraints in terms of non-satisfiability of a specific recursive program. We show that both the problems of universal finiteness and satisfiability of Datalog in the presence of acyclicity constraints (on one or more ed b relations) remain decidable for a language L whenever the problems are decidable for language L in absence of such constraints. We also show that the problems are undecidable for arbitrary constraints expressed in terms of non-satisfiability of a recursive program.
Starting Page	190
Ending Page	200
Page Count	11
File Format	PDF
ISBN	0897916425
DOI	10.1145/182591.182612
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	1994-05-24
Publisher Place	New York
Access Restriction	Subscribed
Content Type	Text
Resource Type	Article

Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302

See location in the Map
03222 282435
Mail: support@ndl.gov.in

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in