The expressive powers of stable models for bound and unbound DATALOG queries (Q1362337): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: LOGIDATA+ / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Datalog / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1006/jcss.1997.1446 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2030648384 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3477931 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Procedural languages for database queries and updates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable and extension class theory for logic programs and default logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Negation in rule-based database languages: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of complexity results for non-monotonic logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure and complexity of relational queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Horn clause queries and generalizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4937194 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4058132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Languages that Capture Complexity Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short note preferred extensions are partial stable models / rank
 
Normal rank
Property / cites work
 
Property / cites work: The expressive power of stratified logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Why not negation by fixpoint? / 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 the logic programming semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Negation as failure using tight derivations for general logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The well-founded semantics for general logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the equivalence of semantics for normal logic programs / rank
 
Normal rank

Latest revision as of 17:55, 27 May 2024

scientific article
Language Label Description Also known as
English
The expressive powers of stable models for bound and unbound DATALOG queries
scientific article

    Statements

    The expressive powers of stable models for bound and unbound DATALOG queries (English)
    0 references
    0 references
    3 August 1997
    0 references
    0 references
    deterministic semantics
    0 references
    possible semantics
    0 references
    definite semantics
    0 references
    0 references
    0 references
    0 references