Introduction to mathematical logic (3rd ed.)
Introduction to mathematical logic (3rd ed.)
A computer system for inference execution and data retrieval
Communications of the ACM
Database theory—past and future
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Safety and correct translation of relational calculus formulas
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Logic programming as constructivism: a formalization and its application to databases
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A Relational Calculus with Set Operators, Its Safety, and Equivalent Graphical Languages
IEEE Transactions on Software Engineering
A new proof of undecidability of safety of logic queries
ACM SIGACT News
Safety and translation of relational calculus
ACM Transactions on Database Systems (TODS)
On negation in HiLog (extended abstract)
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the equivalence of database restructurings involving object identifiers (extended abstract)
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Relations with relation names as arguments: algebra and calculus
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Syntactical characterization of a subset of domain-independent formulas
Journal of the ACM (JACM)
Interpreting a reconstructed relational calculus (extended abstract)
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Efficient checking of temporal integrity constraints using bounded history encoding
ACM Transactions on Database Systems (TODS)
Finite queries do not have effective syntax
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Perspectives on database theory
ACM SIGACT News
On the decidability and axiomatization of query finiteness in deductive databases
Journal of the ACM (JACM)
An axiomatic approach to deciding query safety in deductive databases
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The Solvability of the Decision Problem for Classes of Proper Formulas and Related Results
Journal of the ACM (JACM)
Horn clauses and database dependencies
Journal of the ACM (JACM)
Logic and Databases: A Deductive Approach
ACM Computing Surveys (CSUR)
The relational data file and the decision problem for classes of proper formulas
SIGIR '71 Proceedings of the 1971 international ACM SIGIR conference on Information storage and retrieval
The power of languages for the manipulation of complex values
The VLDB Journal — The International Journal on Very Large Data Bases
Groupwise Processing of Relational Queries
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Translating advanced integrity checking technology to SQL
Database integrity
An Extended Relational Algebra on Abstract Objects for Summarizing Answers to Queries
Fundamenta Informaticae
Compiling mappings to bridge applications and databases
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Impacts of logic and databases (invited paper)
VLDB '81 Proceedings of the seventh international conference on Very Large Data Bases - Volume 7
Constructibility and decidability versus domain independence and absoluteness
Theoretical Computer Science
Compiling mappings to bridge applications and databases
ACM Transactions on Database Systems (TODS)
Schema mapping discovery from data instances
Journal of the ACM (JACM)
Datalog programs over infinite databases, revisited
DBPL'07 Proceedings of the 11th international conference on Database programming languages
A framework for formalizing set theories based on the use of static set terms
Pillars of computer science
An Extended Relational Algebra on Abstract Objects for Summarizing Answers to Queries
Fundamenta Informaticae
| Hi-index | 0.01 |
A class of formulas of the first-order predicate calculus, the definite formulas has recently been proposed as the formal representation of the “reasonable” questions to put to a computer in the context of an actual data retrieval system, the Relational Data File of Levien and Maron. It is shown here that the decision problem for the class of definite formulas is recursively unsolvable. Hence there is no algorithm to decide whether a given formula is definite.