Complexity and expressive power of deterministic semantics for DATALOG\(^ \neg\).

DOI10.1006/inco.1999.2800zbMath1045.68514OpenAlexW2067185472MaRDI QIDQ1854304

Sergio Greco, Domenico Saccà

Publication date: 14 January 2003

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1999.2800

zbMATH Keywords

fixpoint queries

Mathematics Subject Classification ID

Database theory (68P15) Logic programming (68N17)

Related Items (1)

On the Semantics of Abstract Argumentation Frameworks: A Logic Programming Approach

Uses Software

• Datalog

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of facets (and some facets of complexity)
• Why not negation by fixpoint?
• Multiple total stable models are definitely needed to solve unique solution problems
• The expressive powers of stable models for bound and unbound DATALOG queries
• ``Possible is certain is desirable and can be expressive
• Structure and complexity of relational queries
• The complexity of selecting maximal solutions
• On the unique satisfiability problem
• A kripke-kleene semantics for logic programs*
• Autoepistemic logic
• The well-founded semantics for general logic programs
• Deterministic and non-deterministic stable models
• The expressive power of unique total stable model semantics
• Logic programming semantics made easy

This page was built for publication: Complexity and expressive power of deterministic semantics for DATALOG\(^ \neg\).