Expressive power and complexity of partial models for disjunctive deductive databases
type: Item
instance of: scholarly article
title: Expressive power and complexity of partial models for disjunctive deductive databases
zbMATH Open document ID: 0913.68053
DOI: 10.1016/S0304-3975(97)00129-1
author: Thomas Eiter
author: N. Leone
author: Domenico Saccà
published in: Theoretical Computer Science
publication date: 1999-01-12T00:00:00Z
Mathematics Subject Classification ID: 68P15
zbMATH DE Number: 1238721
zbMATH Keywords: deductive databases
zbMATH Keywords: expressive power
zbMATH Keywords: complexity
zbMATH Keywords: disjunctive logic programming
zbMATH Keywords: partial model semantics
describes a project that uses: Datalog
MaRDI profile type: Publication
cites work: Q4864249
cites work: Logic programming and negation: A survey
cites work: Stable and extension class theory for logic programs and default logics
cites work: Propositional semantics for disjunctive logic programs
cites work: Negation in rule-based database languages: A survey
cites work: General logical databases and programs: Default logic semantics and stratification
cites work: Circumscribing DATALOG: expressive power and complexity
cites work: A survey of complexity results for non-monotonic logics
cites work: Structure and complexity of relational queries
cites work: Generalized closed world assumption is \(\Pi ^ 0_ 2\)-complete
cites work: A restricted second order logic for finite structures
cites work: Q4225120
cites work: On the computational cost of disjunctive logic programming: Propositional case
cites work: On the partial semantics for disjunctive deductive databases
cites work: Short note preferred extensions are partial stable models
cites work: Q4058132
cites work: Q3983043
cites work: Second order logic and the weak exponential hierarchies
cites work: Q4385543
cites work: The expressive power of stratified logic programs
cites work: Why not negation by fixpoint?
cites work: On the expressive power of Datalog: tools and a case study.
cites work: Q3339245
cites work: Q4391449
cites work: Autoepistemic logic
cites work: Q3939270
cites work: Q3221403
cites work: Q3983045
cites work: The expressive powers of stable models for bound and unbound DATALOG queries
cites work: Deterministic and non-deterministic stable models
cites work: The expressive powers of the logic programming semantics
cites work: Complexity and undecidability results for logic programming
cites work: The polynomial-time hierarchy
cites work: The well-founded semantics for general logic programs
cites work: A three-valued semantics for deductive databases and logic programs
cites work: On the equivalence of semantics for normal logic programs
full work available at URL: s0304-3975(97)00129-1
OpenAlex ID: W1974247722
description: scientific article; zbMATH DE number 1238721