Expressive power and complexity of partial models for disjunctive deductive databases (Q1274974): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Q4864249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic programming and negation: A survey / 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: Propositional semantics for disjunctive logic programs / 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: General logical databases and programs: Default logic semantics and stratification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circumscribing DATALOG: expressive power and complexity / 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: Generalized closed world assumption is \(\Pi ^ 0_ 2\)-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: A restricted second order logic for finite structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4225120 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational cost of disjunctive logic programming: Propositional case / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the partial semantics for disjunctive deductive databases / 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: Q4058132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3983043 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Second order logic and the weak exponential hierarchies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385543 / 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: On the expressive power of Datalog: tools and a case study. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3339245 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4391449 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Autoepistemic logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3939270 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3983045 / 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: The expressive powers of the logic programming semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity and undecidability results for logic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The polynomial-time hierarchy / 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: A three-valued semantics for deductive databases and logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the equivalence of semantics for normal logic programs / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0304-3975(97)00129-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1974247722 / rank
 
Normal rank

Latest revision as of 10:11, 30 July 2024

scientific article
Language Label Description Also known as
English
Expressive power and complexity of partial models for disjunctive deductive databases
scientific article

    Statements

    Expressive power and complexity of partial models for disjunctive deductive databases (English)
    0 references
    0 references
    0 references
    0 references
    12 January 1999
    0 references
    deductive databases
    0 references
    expressive power
    0 references
    complexity
    0 references
    disjunctive logic programming
    0 references
    partial model semantics
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers