Simplified forms of computerized reasoning with distance semantics
From MaRDI portal
Publication:545150
DOI10.1016/J.JAL.2010.07.001zbMATH Open1216.68254OpenAlexW1999586011MaRDI QIDQ545150FDOQ545150
Publication date: 22 June 2011
Published in: Journal of Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jal.2010.07.001
Recommendations
Cites Work
- MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability
- Title not available (Why is that?)
- Two modellings for theory change
- Measuring inconsistency
- Counterfactuals.
- Title not available (Why is that?)
- Error Detecting and Error Correcting Codes
- Minimal-change integrity maintenance using tuple deletions
- Answer sets for consistent query answering in inconsistent databases
- Multiset theory
- Voting by Committees
- Distance semantics for belief revision
- \(\text{DA}^2\) merging operators
- Title not available (Why is that?)
- Merging Information Under Constraints: A Logical Framework
- Another perspective on default reasoning
- Title not available (Why is that?)
- Distance semantics for database repair
- Title not available (Why is that?)
- Title not available (Why is that?)
- Distance-based paraconsistent logics
- Implementing semantic merging operators using binary decision diagrams
- Disjunctive merging: quota and Gmin merging operators
- Resolution for Max-SAT
- A sphere world semantics for default reasoning
- Reasoning with prioritized information by iterative aggregation of distance functions
Cited In (2)
Uses Software
This page was built for publication: Simplified forms of computerized reasoning with distance semantics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q545150)