On the limits of forgetting in answer set programming (Q2211850): Difference between revisions

From MaRDI portal
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.artint.2020.103307 / 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.1016/j.artint.2020.103307 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3034914877 / 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: When you must forget: Beyond strong persistence when forgetting in answer set programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to progress a database / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411161 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving logic program conflict through strong and weak forgettings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semantic forgetting in answer set programming / 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: Forgetting for knowledge bases in DL-lite / 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: 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: Q3983043 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3011296 / 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: Q3880319 / 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: 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: Q3543581 / 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: An abductive framework for computing knowledge base updates / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Unifying Perspective on Knowledge Updates / 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: The rise and fall of semantic rule updates based on<tt>SE</tt>-models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preserving Strong Equivalence while Forgetting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Knowledge Forgetting in Answer Set Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Knowledge forgetting: properties and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semantics of (disjunctive) logic programs based on partial evaluation / 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: Nested expressions in logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable inference as intuitionistic validity / 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: Logic Programming and Nonmonotonic Reasoning / 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: Q3624114 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Knowledge Level Account of Forgetting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forgetting auxiliary atoms in forks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modularity Aspects of Disjunctive Stable Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Syntactic Operator for Forgetting that Satisfies Strong Persistence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forgetting under the Well-Founded Semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: The well-founded semantics for general logic programs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.ARTINT.2020.103307 / rank
 
Normal rank

Latest revision as of 12:28, 17 December 2024

scientific article
Language Label Description Also known as
English
On the limits of forgetting in answer set programming
scientific article

    Statements

    On the limits of forgetting in answer set programming (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    16 November 2020
    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
    0 references
    0 references

    Identifiers