Hypothetical datalog: complexity and expressibility
- 31 October 1990
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 76 (1) , 3-51
- https://doi.org/10.1016/0304-3975(90)90011-6
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Clausal intuitionistic logic II. tableau proof proceduresThe Journal of Logic Programming, 1988
- Clausal intuitionistic logic I. fixed-point semanticsThe Journal of Logic Programming, 1988
- N-Prolog: An extension of prolog with hypothetical implication. II. Logical foundations, and negation as failureThe Journal of Logic Programming, 1985
- N-Prolog: An extension of Prolog with hypothetical implications. I.The Journal of Logic Programming, 1984
- Contributions to the Theory of Logic ProgrammingJournal of the ACM, 1982
- AlternationJournal of the ACM, 1981
- Computable queries for relational data basesJournal of Computer and System Sciences, 1980
- Intuitionistic propositional logic is polynomial-space completeTheoretical Computer Science, 1979
- The Computational Complexity of Provability in Systems of Modal Propositional LogicSIAM Journal on Computing, 1977
- The Semantics of Predicate Logic as a Programming LanguageJournal of the ACM, 1976