Why not negation by fixpoint?

Authors:
Phokion G. Kolaitis;Christos H. Papadimitriou
Affiliations:
Computer Science Department, Stanford University, Stanford, CA;Department of Computer Science and Engineering, University of California at San Diego, La Jolla, CA
Venue:
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Year:
1988

Citing 12
Cited 26

Relational queries computable in polynomial time

Information and Control
A note on succinct representations of graphs

Information and Control
The Boolean hierarchy: hardware over NP

Proc. of the conference on Structure in complexity theory
Skolem normal forms concerning the least fixpoint

Computation theory and logic
Towards a theory of declarative knowledge

Foundations of deductive databases and logic programming
Procedural and declarative database update languages

Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Contributions to the Theory of Logic Programming

Journal of the ACM (JACM)
Universality of data retrieval languages

POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
On the Boolean closure of NP

FCT '85 Fundamentals of Computation Theory
The complexity of relational query languages (Extended Abstract)

STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
The Polynomial Time Hierarchy Collapses if the Boolean Hierarchy Collapses

The Polynomial Time Hierarchy Collapses if the Boolean Hierarchy Collapses
Elementary induction on abstract structures (Studies in logic and the foundations of mathematics)

Elementary induction on abstract structures (Studies in logic and the foundations of mathematics)

Object identity as a query language primitive

SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Untyped sets, invention, and computable queries

PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
IDLOG: extending the expressive power of deductive database languages

SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
A rule-based language with functions and sets

ACM Transactions on Database Systems (TODS)
Generic Computation and its complexity

STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
A non-deterministic deductive database language

SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
Designing and Prototyping Data-Intensive Applications in the Logres and Algres Programming Environment

IEEE Transactions on Software Engineering - Special issue on knowledge representation and reasoning in software development
Queries are easier than you thought (probably)

PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Semantics for null extended nested relations

ACM Transactions on Database Systems (TODS)
Database querying and constraint programming

ACM SIGACT News
Logical foundations of object-oriented and frame-based languages

Journal of the ACM (JACM)
Constraint programming and database languages: a tutorial

PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Object identity as a query language primitive

Journal of the ACM (JACM)
Stable models and non-determinism in logic programs with negation

PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Constraint query languages (preliminary report)

PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Polynomial time query processing in temporal deductive databases

PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Theory of database queries

Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A Web Odyssey: from Codd to XML

PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Rule-based languages

Annals of Mathematics and Artificial Intelligence
What You Always Wanted to Know About Datalog (And Never Dared to Ask)

IEEE Transactions on Knowledge and Data Engineering
Rule Ordering in Bottom-Up Fixpoint Evaluation of Logic Programs

IEEE Transactions on Knowledge and Data Engineering
Efficient Recursive Aggregation and Negation in Deductive Databases

IEEE Transactions on Knowledge and Data Engineering
Termination and Confluence by Rule Prioritization

IEEE Transactions on Knowledge and Data Engineering
A Web odyssey: from codd to XML

ACM SIGMOD Record
Four lessons in versatility or how query languages adapt to the web

Semantic techniques for the web
Count constraints and the inverse OLAP problem: definition, complexity and a step toward aggregate data exchange

FoIKS'12 Proceedings of the 7th international conference on Foundations of Information and Knowledge Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

There is a fixpoint semantics for DATALOG programs with negation that is a natural generalization of the standard semantics for DATALOG programs without negation. We show that, unfortunately, several compelling complexity-theoretic obstacles rule out its efficient implementation. As an alternative, we propose Inflationary DATALOG, an efficiently implementable semantics for negation, based on inflationary fixpoints