Hypothetical datalog: Complexity and expressibility

DOI10.1016/0304-3975(90)90011-6zbMath0702.68044OpenAlexW2126897484MaRDI QIDQ915436

Anthony J. Bonner

Publication date: 1990

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(90)90011-6

zbMATH Keywords

logic programmingdata complexitydeductive databasesHorn-clause logichypothetical queriesrule based systems

Mathematics Subject Classification ID

Database theory (68P15) Logic in artificial intelligence (68T27) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35) Logic programming (68N17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (3)

An overview of transaction logic ⋮ An extended constraint deductive database: theory and implementation ⋮ Sequences, datalog, and transducers

Uses Software

• Datalog

Cites Work

• Unnamed Item
• Unnamed Item
• Computable queries for relational data bases
• Intuitionistic propositional logic is polynomial-space complete
• N-Prolog: An extension of Prolog with hypothetical implications. I.
• N-Prolog: An extension of prolog with hypothetical implication. II. Logical foundations, and negation as failure
• Clausal intuitionistic logic I. fixed-point semantics
• Clausal intuitionistic logic II. tableau proof procedures
• Alternation
• Contributions to the Theory of Logic Programming
• The Semantics of Predicate Logic as a Programming Language
• The Computational Complexity of Provability in Systems of Modal Propositional Logic

This page was built for publication: Hypothetical datalog: Complexity and expressibility