Incomplete Information in Relational Databases
Journal of the ACM (JACM)
Artificial Intelligence
Relational queries computable in polynomial time
Information and Control
Decidability and expressiveness aspects of logic queries
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Languages that capture complexity classes
SIAM Journal on Computing
Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
Data functions, datalog and negation
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Deciding whether a production rule is relational computable
Lecture notes in computer science on ICDT '88
A logical language for data and knowledge bases
A logical language for data and knowledge bases
Fixpoint extensions of first-order logic and datalog-like languages
Proceedings of the Fourth Annual Symposium on Logic in computer science
Fundamental properties of deterministic and nondeterministic extensions of Datalog
Selected papers of the workshop on Deductive database theory
Programming primitives for database languages
POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Modelling Non Deterministic Queries and Updates in Deductive Databases
VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Tractable query languages for complex object databases
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A non-deterministic deductive database language
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
Semi-determinism (extended abstract)
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the semantics of theory change: arbitration between old and new information
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Adding disjunction to datalog (extended abstract)
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Semantics for update rule programs and implementation in a relational database management system
ACM Transactions on Database Systems (TODS)
Fixpoint logics, relational machines, and computational complexity
Journal of the ACM (JACM)
ACM Transactions on Database Systems (TODS)
Programming with non-determinism in deductive databases
Annals of Mathematics and Artificial Intelligence
"Possible is certain'' is desirable and can be expressive
Annals of Mathematics and Artificial Intelligence
On non-determinism in machines and languages
Annals of Mathematics and Artificial Intelligence
Annals of Mathematics and Artificial Intelligence
G-Log: A Graph-Based Query Language
IEEE Transactions on Knowledge and Data Engineering
Dynamic Programming in Datalog with Aggregates
IEEE Transactions on Knowledge and Data Engineering
EDBT '00 Proceedings of the 7th International Conference on Extending Database Technology: Advances in Database Technology
Search and Optimization Problems in Datalog
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II
New Generation Computing
Declarative semantics for active rules
Theory and Practice of Logic Programming
Towards a logic for abstract metafinite state machines
FoIKS'08 Proceedings of the 5th international conference on Foundations of information and knowledge systems
Fixed-point definability and polynomial time on chordal graphs and line graphs
Fields of logic and computation
Win-move is coordination-free (sometimes)
Proceedings of the 15th International Conference on Database Theory
| Hi-index | 0.00 |
The use of non-deterministic database languages is motivated using pragmatic and theoretical considerations. It is shown that non-determinism resolves some difficulties concerning the expressive power of deterministic languages: there are non-deterministic languages expressing low complexity classes of queries/updates, whereas no such deterministic languages exist. Various mechanisms yielding non-determinism are reviewed. The focus is on two closely related families of non-deterministic languages. The first consists of extensions of Datalog with negations in bodies and/or heads of rules, with non-deterministic fixpoint semantics. The second consists of non-deterministic extensions of first-order logic and fixpoint logics, using the witness operator. The ability of the various non-deterministic languages to express deterministic transformation is characterized. In particular, non-deterministic languages expressing exactly the queries/updates computable in polynomial time are exhibited, whereas it is conjectured that no analogous deterministic language exists. The connection between non-deterministic languages and determinism is also explored. Several problems of practical interest are examined, such as checking (statically or dynamically) if a given program is deterministic, detecting coincidence of deterministic and non-deterministic semantics, and verifying termination for non-deterministic programs.