Hypothetical datalog: Complexity and expressibility
type: Item
instance of: scholarly article
title: Hypothetical datalog: Complexity and expressibility
zbMATH Open document ID: 0702.68044
DOI: 10.1016/0304-3975(90)90011-6
author: Anthony J. Bonner
published in: Theoretical Computer Science
publication date: 1990-01-01T00:00:00Z
Mathematics Subject Classification ID: 68P15
Mathematics Subject Classification ID: 68N17
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 68T35
Mathematics Subject Classification ID: 68T27
zbMATH DE Number: 4151812
zbMATH Keywords: hypothetical queries
zbMATH Keywords: rule based systems
zbMATH Keywords: deductive databases
zbMATH Keywords: data complexity
zbMATH Keywords: logic programming
zbMATH Keywords: Horn-clause logic
describes a project that uses: Datalog
MaRDI profile type: Publication
full work available at URL: 0304-3975(90)90011-6
OpenAlex ID: W2126897484
cites work: Contributions to the Theory of Logic Programming
cites work: Computable queries for relational data bases
cites work: Alternation
cites work: N-Prolog: An extension of prolog with hypothetical implication. II. Logical foundations, and negation as failure
cites work: N-Prolog: An extension of Prolog with hypothetical implications. I.
cites work: Q5592246
cites work: Q3862380
cites work: The Computational Complexity of Provability in Systems of Modal Propositional Logic
cites work: Clausal intuitionistic logic I. fixed-point semantics
cites work: Clausal intuitionistic logic II. tableau proof procedures
cites work: Intuitionistic propositional logic is polynomial-space complete
cites work: The Semantics of Predicate Logic as a Programming Language
description: scientific article; zbMATH DE number 4151812