Merging Logic Programs under Answer Set Semantics
From MaRDI portal
Publication:4649730
DOI10.1007/978-3-642-02846-5_17zbMath1251.68057OpenAlexW1554100114MaRDI QIDQ4649730
Stefan Woltran, Hans Tompits, Torsten Schaub, James P. Delgrande
Publication date: 13 November 2012
Published in: Logic Programming (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10072/30506
Related Items (12)
Merging existential rules programs in multi-agent contexts through credibility accrual ⋮ Belief Base Change Operations for Answer Set Programming ⋮ How does incoherence affect inconsistency-tolerant semantics for Datalog\(^\pm\)? ⋮ Characterization of logic program revision as an extension of propositional revision ⋮ Updating action domain descriptions ⋮ Prioritized and non-prioritized multiple change on belief bases ⋮ AGM contraction and revision of rules ⋮ Stratified belief bases revision with argumentative inference ⋮ Sum-based weighted belief base merging: from commensurable to incommensurable framework ⋮ Merging Logic Programs under Answer Set Semantics ⋮ Logic based merging ⋮ Multi-shot ASP solving with clingo
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Possibilistic merging and distance-based fusion of propositional information
- Knowledge Representation, Reasoning and Declarative Problem Solving
- On the semantics of combination operations
- On properties of update sequences based on causal rejection
- Dynamic updates of non-monotonic knowledge bases
- Merging Logic Programs under Answer Set Semantics
- Merging Information Under Constraints: A Logical Framework
- Strong equivalence made easy: nested expressions and weight constraints
- Coordination in answer set programming
- A Preference-Based Framework for Updating Logic Programs
- Propositional theories are strongly equivalent to logic programs
- Strongly equivalent logic programs
This page was built for publication: Merging Logic Programs under Answer Set Semantics
