Complexity and expressive power of deterministic semantics for DATALOG\(^ \neg\). (Q1854304): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The expressive power of unique total stable model semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the unique satisfiability problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure and complexity of relational queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of selecting maximal solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4058132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A kripke-kleene semantics for logic programs* / rank
 
Normal rank
Property / cites work
 
Property / cites work: ``Possible is certain'' is desirable and can be expressive / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Why not negation by fixpoint? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic programming semantics made easy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3339245 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Autoepistemic logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of facets (and some facets of complexity) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3486858 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple total stable models are definitely needed to solve unique solution problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The expressive powers of stable models for bound and unbound DATALOG queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic and non-deterministic stable models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3869300 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The well-founded semantics for general logic programs / rank
 
Normal rank

Latest revision as of 11:07, 5 June 2024

scientific article
Language Label Description Also known as
English
Complexity and expressive power of deterministic semantics for DATALOG\(^ \neg\).
scientific article

    Statements

    Complexity and expressive power of deterministic semantics for DATALOG\(^ \neg\). (English)
    0 references
    0 references
    0 references
    14 January 2003
    0 references
    0 references
    fixpoint queries
    0 references
    0 references