Forgetting auxiliary atoms in forks (Q2321342): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.1016/j.artint.2019.07.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2964186776 / 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: Conflict-driven answer set solving: from theory to practice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design and implementation of aggregate functions in the DLV system / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equilibrium logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: On equivalence of infinitary formulas under the stable model semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: You Can't Always Forget What You Want: On the Limits of Forgetting in Answer Set Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strongly equivalent logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propositional theories are strongly equivalent to logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal Logic Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic Programming and Nonmonotonic Reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: A denotational semantics for equilibrium logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propositional semantics for disjunctive logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semantical characterizations and complexity of equivalences in answer set programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterising equilibrium logic and nested logic programs: Reductions and complexity, / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bird's-eye view of forgetting in answer-set programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preserving Strong Equivalence while Forgetting / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general framework for equivalences in Answer-Set Programming by countermodels in the logic of Here-and-There / rank
 
Normal rank
Property / cites work
 
Property / cites work: CP-logic: A language of causal probabilistic events and its relation to logic programming / rank
 
Normal rank

Latest revision as of 08:08, 20 July 2024

scientific article
Language Label Description Also known as
English
Forgetting auxiliary atoms in forks
scientific article

    Statements

    Forgetting auxiliary atoms in forks (English)
    0 references
    0 references
    28 August 2019
    0 references
    0 references
    0 references
    0 references
    0 references
    answer set programming
    0 references
    nonmonotonic reasoning
    0 references
    equilibrium logic
    0 references
    denotational semantics
    0 references
    forgetting
    0 references
    strong equivalence
    0 references
    0 references