Tractable reasoning via approximation

DOI10.1016/0004-3702(94)00009-PMaRDI QIDQ1855213zbMATH OpenOpenAlexFDO

Authors Marco Schaerf, Marco Cadoli

Publication date 4 February 2003

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0004-3702(94)00009-p

Mathematics Subject Classification ID

Other nonclassical logic (03B60) Modal logic (including the logic of norms) (03B45) Many-valued logic (03B50) Logic in artificial intelligence (68T27) Mechanization of proofs and logical operations (03B35)

Recommendations

• scientific article; zbMATH DE number 1841825
• scientific article; zbMATH DE number 2014708
• The universe of approximations
• The universe of propositional approximations
• On the hardness of approximate reasoning

Cites work

• scientific article; zbMATH DE number 4174350 (Why is no real title available?)
• scientific article; zbMATH DE number 4176506 (Why is no real title available?)
• scientific article; zbMATH DE number 4168656 (Why is no real title available?)
• scientific article; zbMATH DE number 3986613 (Why is no real title available?)
• scientific article; zbMATH DE number 4064542 (Why is no real title available?)
• scientific article; zbMATH DE number 3670430 (Why is no real title available?)
• scientific article; zbMATH DE number 3715502 (Why is no real title available?)
• scientific article; zbMATH DE number 67465 (Why is no real title available?)
• scientific article; zbMATH DE number 67502 (Why is no real title available?)
• scientific article; zbMATH DE number 67503 (Why is no real title available?)
• scientific article; zbMATH DE number 140373 (Why is no real title available?)
• scientific article; zbMATH DE number 140381 (Why is no real title available?)
• scientific article; zbMATH DE number 140390 (Why is no real title available?)
• scientific article; zbMATH DE number 3504935 (Why is no real title available?)
• scientific article; zbMATH DE number 3566230 (Why is no real title available?)
• scientific article; zbMATH DE number 3568056 (Why is no real title available?)
• scientific article; zbMATH DE number 512816 (Why is no real title available?)
• scientific article; zbMATH DE number 1390355 (Why is no real title available?)
• scientific article; zbMATH DE number 3212004 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• A Computing Procedure for Quantification Theory
• A Machine-Oriented Logic Based on the Resolution Principle
• A decidable first-order logic for knowledge representation
• A four-valued semantics for terminological logics
• A hierarchy of tractable satisfiability problems
• A satisfiability tester for non-clausal propositional calculus
• A theory of abstraction
• Attributive concept descriptions with complements
• Belief, awareness, and limited reasoning
• Hard problems for simple default logics
• Intuitive semantics for first-degree entailments and `coupled trees'
• Linear-time algorithms for testing the satisfiability of propositional horn formulae
• Login: a logic programming language with built-in inheritance
• Network-based heuristics for constraint-satisfaction problems
• Polynomially solvable satisfiability problems
• Querying logical databases
• Semantical and computational aspects of Horn approximations
• Solving propositional satisfiability problems
• Terminological reasoning is inherently intractable
• The Computational Complexity of Provability in Systems of Modal Propositional Logic
• The complexity of existential quantification in concept languages.
• The complexity of propositional closed world reasoning and circumscription
• The complexity of satisfiability problems
• ``Reducing classic to practice: Knowledge representation theory meets reality

Cited in

(36)

• Approximate coherence-based reasoning
• scientific article; zbMATH DE number 44975 (Why is no real title available?)
• scientific article; zbMATH DE number 1728396 (Why is no real title available?)
• Approximate and Limited Reasoning: Semantics, Proof Theory, Expressivity and Control
• Partial meet pseudo-contractions
• Tractable approximate deduction for OWL
• scientific article; zbMATH DE number 2014708 (Why is no real title available?)
• Approximations of modal logics: K and beyond
• Tractable reasoning in artificial intelligence
• The universe of approximations
• Approximation logics for subclasses of probabilistic conditional independence and hierarchical dependence on incomplete data
• The enduring scandal of deduction. Is propositional logic really uninformative?
• Sound approximate reasoning about saturated conditional probabilistic independence under controlled uncertainty
• Cut and pay
• A workbench for anytime reasoning by ontology approximation. With a case study on instance retrieval
• A probabilistic semantics for belief logic
• Is default logic a reinvention of inductive-statistical reasoning?
• A modal view on resource-bounded propositional logics
• First order LUB approximations: characterization and algorithms
• A logic-based tractable approximation of probability
• Does This Set of Clauses Overlap with at Least One MUS?
• An informational view of classical logic
• scientific article; zbMATH DE number 1841825 (Why is no real title available?)
• The universe of propositional approximations
• Computational Aspects of Quasi-Classical Entailment
• Measuring Inconsistency for Description Logics Based on Paraconsistent Semantics
• On AGM for non-classical logics
• Semantics and complexity of abduction from default theories
• Controlling entity integrity with key sets
• An Algorithm for Computing Inconsistency Measurement by Paraconsistent Semantics
• Local Diagnosis
• Frontiers for propositional reasoning about fragments of probabilistic conditional independence and hierarchical database decompositions
• Capturing model-based ontology evolution at the instance level: the case of DL-Lite
• On simplification of schema mappings
• scientific article; zbMATH DE number 35428 (Why is no real title available?)
• Foundations for a fourth normal form over SQL-like databases

This page was built for publication: Tractable reasoning via approximation

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