On Semantic Update Operators for Answer-Set Programs

DOI10.3233/978-1-60750-606-5-957zbMath1211.68426OpenAlexW85236698MaRDI QIDQ2999230

João Leite, Martin Slota

Publication date: 11 May 2011

Full work available at URL: https://dblp.uni-trier.de/db/conf/ecai/ecai2010.html#SlotaL10

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Knowledge representation (68T30) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (9)

Default Negation as Explicit Negation plus Update ⋮ Belief Base Change Operations for Answer Set Programming ⋮ A Unifying Perspective on Knowledge Updates ⋮ Inconsistency-tolerant reasoning over linear probabilistic knowledge bases ⋮ Stable reasoning ⋮ Characterization of logic program revision as an extension of propositional revision ⋮ On updates of hybrid knowledge bases composed of ontologies and rules ⋮ Revision, defeasible conditionals and non-monotonic inference for abstract dialectical frameworks ⋮ Strong inconsistency

This page was built for publication: On Semantic Update Operators for Answer-Set Programs