Semantics and complexity of abduction from default theories (Q1402749): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for testing the truth of certain quantified Boolean formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002981 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4028775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computational complexity of abduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of complexity results for non-monotonic logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractable reasoning via approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure and complexity of relational queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3742757 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5750429 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Relationship Between Abduction and Deduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating probabilistic inference in Bayesian belief networks is NP- hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ground Nonmonotonic Modal Logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of propositional knowledge base revision, updates, and counterfactuals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4022222 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of logic-based abduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity results for abductive logic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Timetable and Multicommodity Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4028795 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Results for Nonmonotonic Logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of default reasoning under the stationary fixed point semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Second order logic and the weak exponential hierarchies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abductive Logic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hard problems for simple default logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abduction versus closure in causal theories. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273952 / rank
 
Normal rank
Property / cites work
 
Property / cites work: LTUR: A simplified linear-time unit resolution algorithm for Horn formulae and computer implementation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4514014 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3998470 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A logical framework for default reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5750451 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic programming, abduction and probability. A top-down anytime algorithm for estimating prior and posterior probabilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic Horn abduction and Bayesian networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298363 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A logic for default reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hardness of approximate reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Approximation Algorithms for # P / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0004-3702(96)00040-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2000042161 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:08, 30 July 2024

scientific article
Language Label Description Also known as
English
Semantics and complexity of abduction from default theories
scientific article

    Statements

    Semantics and complexity of abduction from default theories (English)
    0 references
    0 references
    0 references
    0 references
    28 August 2003
    0 references
    Abduction
    0 references
    Default logic
    0 references
    Algorithms and complexity
    0 references
    Tractability
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers