Resolving contradictions: A plausible semantics for inconsistent systems

DOI10.1007/BF00881841MaRDI QIDQ1332637zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 487144
• A knowledge representation perspective: Logics for paraconsistent reasoning
• scientific article; zbMATH DE number 140409
• Measuring Inconsistency for Description Logics Based on Paraconsistent Semantics
• Artificial Intelligence: Methodology, Systems, and Applications

Cites work

• scientific article; zbMATH DE number 4176507 (Why is no real title available?)
• scientific article; zbMATH DE number 4181307 (Why is no real title available?)
• scientific article; zbMATH DE number 3118808 (Why is no real title available?)
• scientific article; zbMATH DE number 4164174 (Why is no real title available?)
• scientific article; zbMATH DE number 3963779 (Why is no real title available?)
• scientific article; zbMATH DE number 3659568 (Why is no real title available?)
• scientific article; zbMATH DE number 25191 (Why is no real title available?)
• scientific article; zbMATH DE number 67513 (Why is no real title available?)
• scientific article; zbMATH DE number 67514 (Why is no real title available?)
• scientific article; zbMATH DE number 67849 (Why is no real title available?)
• scientific article; zbMATH DE number 140409 (Why is no real title available?)
• A logic for default reasoning
• A nonstandard approach to the logical omniscience problem
• Algorithms for testing the satisfiability of propositional formulae
• Answering atomic queries in indefinite deductive databases
• Approximate inclusion-exclusion
• Average time analyses of simplified Davis-Putnam procedures
• CNF-Satisfiability Test by Counting and Polynomial Average Time
• Counting propositional models
• Information and evidence in logic systems
• On measures of information and their characterizations
• Reasoning about truth
• The Pure Literal Rule and Polynomial Average Time
• The complexity of computing the permanent
• The complexity of theorem-proving procedures
• Truth and meaning

Cited in

(14)

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

This page was built for publication: Resolving contradictions: A plausible semantics for inconsistent systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1332637)