Complexity and expressive power of deterministic semantics for DATALOG\(^ \neg\).
type: Item
instance of: scholarly article
title: Complexity and expressive power of deterministic semantics for DATALOG\(^ \neg\).
zbMATH Open document ID: 1045.68514
author: Sergio Greco
author: Domenico Saccà
published in: Information and Computation
publication date: 2003-01-14T00:00:00Z
Mathematics Subject Classification ID: 68N17
Mathematics Subject Classification ID: 68P15
zbMATH DE Number: 1853065
zbMATH Keywords: fixpoint queries
describes a project that uses: Datalog
MaRDI profile type: Publication
full work available at URL: inco.1999.2800
OpenAlex ID: W2067185472
cites work: The expressive power of unique total stable model semantics
cites work: On the unique satisfiability problem
cites work: Structure and complexity of relational queries
cites work: The complexity of selecting maximal solutions
cites work: Q4058132
cites work: A kripke-kleene semantics for logic programs*
cites work: ``Possible is certain'' is desirable and can be expressive
cites work: Q4385525
cites work: Why not negation by fixpoint?
cites work: Logic programming semantics made easy
cites work: Q3339245
cites work: Autoepistemic logic
cites work: Q4298260
cites work: The complexity of facets (and some facets of complexity)
cites work: Q3486858
cites work: Multiple total stable models are definitely needed to solve unique solution problems
cites work: The expressive powers of stable models for bound and unbound DATALOG queries
cites work: Deterministic and non-deterministic stable models
cites work: Q3869300
cites work: The well-founded semantics for general logic programs
DOI: 10.1006/INCO.1999.2800
description: scientific article; zbMATH DE number 1853065