Why not negation by fixpoint?
- 1 March 1988
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 231-239
- https://doi.org/10.1145/308386.308446
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- Procedural and declarative database update languagesPublished by Association for Computing Machinery (ACM) ,1988
- A note on succinct representations of graphsInformation and Control, 1986
- Relational queries computable in polynomial timeInformation and Control, 1986
- On the unique satisfiability problemInformation and Control, 1982
- Contributions to the Theory of Logic ProgrammingJournal of the ACM, 1982
- The complexity of relational query languages (Extended Abstract)Published by Association for Computing Machinery (ACM) ,1982
- Universality of data retrieval languagesPublished by Association for Computing Machinery (ACM) ,1979
- Some simplified NP-complete graph problemsTheoretical Computer Science, 1976