Some syntactic approaches to the handling of inconsistent knowledge bases: A comparative study. I: The flat case
DOI10.1023/A:1004987830832zbMATH Open0867.68100OpenAlexW1602390698MaRDI QIDQ677077FDOQ677077
Salem Benferhat, Henri Prade, Didier Dubois
Publication date: 31 March 1997
Published in: Studia Logica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1004987830832
Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35) Logic in artificial intelligence (68T27) Other applications of logic (03B80)
Cited In (43)
- Getting the most out of inconsistency
- Adaptive Proofs for Networks of Partial Structures
- A postulate-driven study of logical argumentation
- On the measure of conflicts: Shapley inconsistency values
- A capacity-based framework encompassing Belnap-Dunn logic for reasoning about multisource information
- Synergies between machine learning and reasoning -- an introduction by the Kay R. Amel group
- Disjunctive merging: quota and Gmin merging operators
- Syntax versus semantics in knowledge bases II
- An adaptive logic based on Jaśkowski's approach to paraconsistency
- Possibilistic logic: a retrospective and prospective view
- The inapplicability of (selected) paraconsistent logics
- A computationally grounded logic of graded belief
- Being Consistent About Inconsistency: Toward the Rational Fusing of Inconsistent Propositional Logic Bases
- A generalized proof-theoretic approach to logical argumentation based on hypersequents
- A capacity-based semantics for inconsistency-tolerant inferences
- The theory of the process of explanation generalized to include the inconsistent case
- Simple contrapositive assumption-based argumentation frameworks
- $$\exists $$ -ASP for Computing Repairs with Existential Ontologies
- Main issues in belief revision, belief merging and information fusion
- A review of the relations between logical argumentation and reasoning with maximal consistency
- Syntax versus semantics in knowledge bases – I
- Assertional Removed Sets Merging of DL-Lite Knowledge Bases
- Logic based merging
- Logical limits of abstract argumentation frameworks
- Yes fellows, most human reasoning is complex
- A split-combination approach to merging knowledge bases in possibilistic logic
- Majority merging by adaptive counting
- Semantic-based construction of arguments: an answer set programming approach
- On the transitivity of logical consequence without assuming monotonicity
- Active logic semantics for a single agent in a static world
- Qualitative capacities: basic notions and potential applications
- \(\text{DA}^2\) merging operators
- Belief base merging as a game
- Lost in translation: language independence in propositional logic -- application to belief change
- Query answering DL-lite knowledge bases from hidden datasets
- Direct Dynamic Proofs for the Rescher–Manor Consequence Relations: The Flat Case
- A procedural criterion for final derivability in inconsistency-adaptive logics
- ``Platonic thought experiments: how on earth?
- Inconsistency-tolerant reasoning over linear probabilistic knowledge bases
- Handling locally stratified inconsistent knowledge bases
- Selecting accepted assertions in partially ordered inconsistent DL-Lite knowledge bases
- Policy-based inconsistency management in relational databases
- New Arguments for Adaptive Logics as Unifying Frame for the Defeasible Handling of Inconsistency
Recommendations
This page was built for publication: Some syntactic approaches to the handling of inconsistent knowledge bases: A comparative study. I: The flat case
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q677077)