When you must forget: Beyond strong persistence when forgetting in answer set programming (Q4592710): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1707.05152 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forgetting under the Well-Founded Semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic updates of non-monotonic knowledge bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3880319 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Model-Theoretic Approach to Belief Change in Answer Set Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A system of interaction and structure / 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: Semantic forgetting in answer set programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forgetting in ASP: The Forgotten Properties / 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: Preserving Strong Equivalence while Forgetting / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Logical Difference for the Lightweight Description Logic EL / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model-theoretic inseparability and modularity of description logic ontologies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic-based ontology comparison and module extraction, with an application to DL-Lite / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411161 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reasoning under inconsistency: a forgetting-based approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4473033 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5715700 / 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: Strongly equivalent logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nested expressions in logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to progress a database / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lazy narrowing: strong completeness and eager variable elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forgetting Literals with Varying Propositional Symbols / rank
 
Normal rank
Property / cites work
 
Property / cites work: An abductive framework for computing knowledge base updates / rank
 
Normal rank
Property / cites work
 
Property / cites work: The rise and fall of semantic rule updates based on<tt>SE</tt>-models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Knowledge Forgetting in Answer Set Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forgetting for knowledge bases in DL-lite / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving logic program conflict through strong and weak forgettings / rank
 
Normal rank

Latest revision as of 17:06, 14 July 2024

scientific article; zbMATH DE number 6803825
Language Label Description Also known as
English
When you must forget: Beyond strong persistence when forgetting in answer set programming
scientific article; zbMATH DE number 6803825

    Statements

    When you must forget: Beyond strong persistence when forgetting in answer set programming (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    8 November 2017
    0 references
    0 references
    forgetting
    0 references
    answer set programming
    0 references
    strong equivalence
    0 references
    relativized equivalence
    0 references
    computational complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references