Hypothetical datalog: Complexity and expressibility

DOI10.1016/0304-3975(90)90011-6zbMath0702.68044MaRDI 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 programming; data complexity; deductive databases; Horn-clause logic; hypothetical queries; rule based systems

Mathematics Subject Classification ID

68P15: Database theory

68T27: Logic in artificial intelligence

68T35: Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence

68N17: Logic programming

68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)

Related Items

Sequences, datalog, and transducers, An overview of transaction logic

Uses Software

• Datalog