Tractable reasoning via approximation
type: Item
instance of: scholarly article
title: Tractable reasoning via approximation
zbMATH Open document ID: 1014.03512
DOI: 10.1016/0004-3702(94)00009-P
author: Marco Schaerf
author: Marco Cadoli
published in: Artificial Intelligence
publication date: 2003-02-04T00:00:00Z
Mathematics Subject Classification ID: 03B60
Mathematics Subject Classification ID: 03B35
Mathematics Subject Classification ID: 03B45
Mathematics Subject Classification ID: 03B50
Mathematics Subject Classification ID: 68T27
zbMATH DE Number: 1863772
MaRDI profile type: Publication
cites work: Login: a logic programming language with built-in inheritance
cites work: Q4085699
cites work: Q3798298
cites work: ``Reducing'' classic to practice: Knowledge representation theory meets reality
cites work: Q3750100
cites work: Q4028775
cites work: Semantical and computational aspects of Horn approximations
cites work: The complexity of propositional closed world reasoning and circumscription
cites work: Q3867808
cites work: Q4138187
cites work: Q3495343
cites work: A hierarchy of tractable satisfiability problems
cites work: A Computing Procedure for Quantification Theory
cites work: Network-based heuristics for constraint-satisfaction problems
cites work: The complexity of existential quantification in concept languages.
cites work: Q4028788
cites work: Q4012243
cites work: Linear-time algorithms for testing the satisfiability of propositional horn formulae
cites work: Q3905252
cites work: Intuitive semantics for first-degree entailments and `coupled trees'
cites work: Q4281509
cites work: Q4934647
cites work: Belief, awareness, and limited reasoning
cites work: Polynomially solvable satisfiability problems
cites work: Q4028797
cites work: A theory of abstraction
cites work: Solving propositional satisfiability problems
cites work: Hard problems for simple default logics
cites work: Q5339289
cites work: The Computational Complexity of Provability in Systems of Modal Propositional Logic
cites work: Q3198885
cites work: Q4139711
cites work: Terminological reasoning is inherently intractable
cites work: A four-valued semantics for terminological logics
cites work: A decidable first-order logic for knowledge representation
cites work: A Machine-Oriented Logic Based on the Resolution Principle
cites work: Q5573961
cites work: Q4012193
cites work: The complexity of satisfiability problems
cites work: Q4012244
cites work: Attributive concept descriptions with complements
cites work: Q3200595
cites work: A satisfiability tester for non-clausal propositional calculus
cites work: Querying logical databases
full work available at URL: 0004-3702(94)00009-p
OpenAlex ID: W2016515719
description: scientific article; zbMATH DE number 1863772