Resolving contradictions: A plausible semantics for inconsistent systems

DOI10.1007/BF00881841zbMath0804.68141OpenAlexW1972655158MaRDI QIDQ1332637

Eliezer L. Lozinskii

Publication date: 12 January 1995

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00881841

zbMATH Keywords

semantic informationinconsistent systemsknowledge systemreasoning by evidence

Mathematics Subject Classification ID

Knowledge representation (68T30) Other applications of logic (03B80)

Related Items

Measure-Based Inconsistency-Tolerant Maintenance of Database Integrity ⋮ THE LANDSCAPE OF INCONSISTENCY: A PERSPECTIVE ⋮ On the measure of conflicts: Shapley inconsistency values ⋮ A three-valued semantics for querying and repairing inconsistent databases ⋮ How Dirty Is Your Relational Database? An Axiomatic Approach ⋮ A syntax-based approach to measuring the degree of inconsistency for belief bases ⋮ Another look at the phenomenon of phase transition ⋮ Measuring Consistency Gain and Information Loss in Stepwise Inconsistency Resolution ⋮ Measuring conflict and agreement between two prioritized knowledge bases in possibilistic logic ⋮ A practical measure of the information in a logical theory ⋮ Measuring coherence using LP-models ⋮ On knowledge evolution: acquisition, revision, contraction ⋮ Policy-based inconsistency management in relational databases

Cites Work

• The complexity of computing the permanent
• Average time analyses of simplified Davis-Putnam procedures
• Truth and meaning
• Reasoning about truth
• A logic for default reasoning
• Approximate inclusion-exclusion
• Counting propositional models
• On measures of information and their characterizations
• Answering atomic queries in indefinite deductive databases
• The Pure Literal Rule and Polynomial Average Time
• Algorithms for testing the satisfiability of propositional formulae
• CNF-Satisfiability Test by Counting and Polynomial Average Time
• Information and evidence in logic systems
• The complexity of theorem-proving procedures
• A nonstandard approach to the logical omniscience problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item