Semantics and complexity of recursive aggregates in answer set programming (Q543600): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: NoMoRe / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Datalog / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: ASSAT / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Cmodels / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: nomore++ / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2064864283 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logics in Artificial Intelligence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5633670 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circumscription - a form of non-monotonic reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: A logic for default reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-monotonic logic. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonmonotonic Logic II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semantical considerations on nonmonotonic logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3983043 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Knowledge Representation, Reasoning and Declarative Problem Solving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3939270 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending and implementing the stable model semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unfolding partiality and disjunctions in stable model semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: The DLV system for knowledge representation and reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: ASSAT: computing answer sets of a logic program by SAT solvers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic Programming and Nonmonotonic Reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4798024 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The nomore + + Approach to Answer Set Solving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotonic aggregation in deductive databases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4707773 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic Programming and Nonmonotonic Reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic Programming and Nonmonotonic Reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic Programming and Nonmonotonic Reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well-founded and stable semantics of logic programs with aggregates / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Constructive semantic characterization of aggregates in answer set programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic Programming and Nonmonotonic Reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic Programming and Nonmonotonic Reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3348437 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic programming and nonmonotonic reasoning. 5th international conference, LPNMR '99. El Paso, TX, USA, December 2--4, 1999. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinctness as a source of complexity in logical formalisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4131648 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Autoepistemic logic / 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: Weight constraints as nested expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nested expressions in logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3624081 / rank
 
Normal rank

Latest revision as of 04:04, 4 July 2024

scientific article
Language Label Description Also known as
English
Semantics and complexity of recursive aggregates in answer set programming
scientific article

    Statements

    Semantics and complexity of recursive aggregates in answer set programming (English)
    0 references
    0 references
    0 references
    0 references
    17 June 2011
    0 references
    nonmonotonic reasoning
    0 references
    answer set programming
    0 references
    aggregates
    0 references
    computational complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    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