Back to search

Hypothetical datalog: complexity and expressibility

Data up to Jan 2025

Published1990
Citations55
References22

Total Citations Per Year

Abstract

References (22)

Introduction to automata theory, languages and computation

1981 • 11,042 citations

Introduction to automata theory, languages, and computation

1980 • 6,852 citations

The Semantics of Predicate Logic as a Programming Language

1976 • 1,489 citations

Logic for problem solving

1982 • 1,224 citations

Alternation

1981 • 1,166 citations

Towards a Theory of Declarative Knowledge

1988 • 1,163 citations

Foundations of Deductive Databases and Logic Programming

1988 • 994 citations

Relational queries computable in polynomial time

1986 • 655 citations

Contributions to the Theory of Logic Programming

1982 • 592 citations

The Computational Complexity of Provability in Systems of Modal Propositional Logic

1977 • 572 citations

Computable queries for relational data bases

1980 • 444 citations

Intuitionistic propositional logic is polynomial-space complete

1979 • 239 citations

A logical analysis of modules in logic programming

1989 • 236 citations

N-Prolog: An extension of Prolog with hypothetical implications. I.

1984 • 174 citations

Clausal intuitionistic logic I. fixed-point semantics

1988 • 95 citations

N-Prolog: An extension of prolog with hypothetical implication. II. Logical foundations, and negation as failure

1985 • 91 citations

A Logic-based Language for Database Updates

1988 • 86 citations

Clausal intuitionistic logic II. tableau proof procedures

1988 • 63 citations

Structure and complexity of relational queries

1980 • 40 citations

Database Updates in Pure Prolog.

1984 • 39 citations

A logic for hypothetical reasoning

1988 • 24 citations

A dynamic logic programming language for relational updates

1987 • 6 citations

Cited By (0)

Loading...