Why not negation by fixpoint?
From MaRDI portal
Publication:1176286
DOI10.1016/0022-0000(91)90033-2zbMATH Open0753.68028OpenAlexW2022938902MaRDI QIDQ1176286FDOQ1176286
Authors: Phokion G. Kolaitis, Christos Papadimitriou 
Publication date: 25 June 1992
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-0000(91)90033-2
Recommendations
Cites Work
- Reducibility among combinatorial problems
- Fixed-point extensions of first-order logic
- Elementary induction on abstract structures
- A lattice-theoretical fixpoint theorem and its applications
- Some simplified NP-complete graph problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- A note on succinct representations of graphs
- The complexity of facets (and some facets of complexity)
- The Polynomial Time Hierarchy Collapses If the Boolean Hierarchy Collapses
- Relational queries computable in polynomial time
- Contributions to the Theory of Logic Programming
- Horn clause queries and generalizations
- Structure and complexity of relational queries
- On the unique satisfiability problem
- Title not available (Why is that?)
- The expressive power of stratified logic programs
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (33)
- On the complexity of data disjunctions.
- Complexity and expressive power of deterministic semantics for DATALOG\(^ \neg\).
- The expressive power of ``possible-is-certain semantics (extended abstract)
- The alternating fixpoint of logic programs with negation
- Formalizing a logic for logic programming
- CAN w < -1 BE EXORCIZED?
- Functional queries in datalog
- An analysis of the Core-ML language: Expressive power and type reconstruction
- Title not available (Why is that?)
- Logical foundations and complexity of 4QL, a query language with unrestricted negation
- Expressive power and complexity of partial models for disjunctive deductive databases
- The expressive powers of stable models for bound and unbound DATALOG queries
- Queries and computation on the web
- Datalog extensions for database queries and updates
- Circumscribing DATALOG: expressive power and complexity
- Succinctness as a source of complexity in logical formalisms
- Multiple total stable models are definitely needed to solve unique solution problems
- Title not available (Why is that?)
- Complexity and undecidability results for logic programming
- About boundedness for some DATALOG and DATALOG\textsuperscript{neg} programs
- Inductive definitions over finite structures
- Fundamental properties of deterministic and nondeterministic extensions of Datalog
- Querying datalog programs with temporal logic
- The expressive power of unique total stable model semantics
- Answer set programming in intuitionistic logic
- Negation in rule-based database languages: A survey
- Backchain iteration: Towards a practical inference method that is simple enough to be proved terminating, sound, and complete
- \(\mathcal {NPD}\)atalog: A logic language for expressing \(\mathcal {NP}\) search and optimization problems
- Similarity-based relations in Datalog programs
- The complexity of propositional closed world reasoning and circumscription
- Tie-breaking semantics and structural totality
- A logic for programming with complex objects
- Negation by default and unstratifiable logic programs
This page was built for publication: Why not negation by fixpoint?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1176286)
