Computational methods for database repair by signed formulae
From MaRDI portal
Publication:2502158
DOI10.1007/s10472-005-9012-zzbMath1097.68549OpenAlexW2015200168MaRDI QIDQ2502158
Marc Denecker, Bert Van Nuffelen, Maurice Bruynooghe, Ofer Arieli
Publication date: 12 September 2006
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10472-005-9012-z
Database theory (68P15) Knowledge representation (68T30) Reasoning under uncertainty in the context of artificial intelligence (68T37) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35)
Related Items (6)
Invariance Properties of the Constant-Complement View-Update Strategy ⋮ Independent Update Reflections on Interdependent Database Views ⋮ Information-based distance measures and the canonical reflection of view updates ⋮ A QBF-based formalization of abstract argumentation semantics ⋮ Distance semantics for database repair ⋮ Distance-based paraconsistent logics
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Propositional knowledge base revision and minimal change
- Complete sets and the polynomial-time hierarchy
- Signed systems for paraconsistent reasoning
- On the logic of iterated belief revision
- A thorough axiomatization of a principle of conditional preservation in belief revision
- Information integration using logical views
- Possibilistic merging and distance-based fusion of propositional information
- LUPS -- A language for updating logic programs
- An algorithm to evaluate quantified Boolean formulae and its experimental evaluation
- Resolution for quantified Boolean formulas
- Census Data Repair: A Challenging Application of Disjunctive Logic Programming
- Coherent Composition of Distributed Knowledge-Bases through Abduction
- On the logic of theory change: Partial meet contraction and revision functions
- Reducing Preferential Paraconsistent Reasoning to Classical Entailment
- On Computing Belief Change Operations using Quantified Boolean Formulas
- Merging Information Under Constraints: A Logical Framework
- Answer sets for consistent query answering in inconsistent databases
- An abductive framework for computing knowledge base updates
- Logics in Artificial Intelligence
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
- Foundations of Information and Knowledge Systems
- A polynomial time computable metric between points sets
- A survey of approaches to automatic schema matching
This page was built for publication: Computational methods for database repair by signed formulae
