A comparison of ASP-based and SAT-based algorithms for the contension inconsistency measure
From MaRDI portal
Publication:6163915
DOI10.1007/978-3-031-18843-5_10zbMath1524.68375OpenAlexW4312549193MaRDI QIDQ6163915
Anna Gessler, Matthias Thimm, Vivien Laszlo, Isabelle Kuhlmann
Publication date: 26 July 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-18843-5_10
Knowledge representation (68T30) Reasoning under uncertainty in the context of artificial intelligence (68T37) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Stream-based inconsistency measurement
- Classifications for inconsistent theories
- The logic of paradox
- Using inconsistency measures for estimating reliability
- On the complexity of inconsistency measurement
- Inconsistency-tolerant reasoning over linear probabilistic knowledge bases
- Multi-Criteria Optimization in Answer Set Programming
- Measuring Consistency Gain and Information Loss in Stepwise Inconsistency Resolution
- On Measuring Inconsistency Using Maximal Consistent Sets
- Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
- Multi-shot ASP solving with clingo
- Answer Set Programming
- Forgetting-Based Inconsistency Measure
- A Parametric Approach for Smaller and Better Encodings of Cardinality Constraints
- Applications of SAT Solvers to Cryptanalysis of Hash Functions
- Measuring and computing database inconsistency via repairs
This page was built for publication: A comparison of ASP-based and SAT-based algorithms for the contension inconsistency measure