On the complexity of propositional knowledge base revision, updates, and counterfactuals (Q1199919): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the logic of theory change: Partial meet contraction and revision functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Saturation, nonmonotonic reasoning and the closed-world assumption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time algorithms for testing the satisfiability of propositional horn formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5750466 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3107917 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Negation as failure: careful closure procedure / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the relationship between circumscription and negation as failure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counterfactuals / rank
 
Normal rank
Property / cites work
 
Property / cites work: A circumscriptive theorem prover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reasoning about action. I: A possible worlds approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Results for Nonmonotonic Logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4028799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Updates and subjunctive queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: New developments in structural complexity theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(P^{NP[O(\log n)]}\) and sparse turing-complete sets for NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5751985 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4028812 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propositional knowledge base revision and minimal change / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closed-world databases and circumscription / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modal logic for default reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circumscription - a form of non-monotonic reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonmonotonic Logic II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-monotonic logic. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3939270 / 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: Semantical considerations on nonmonotonic logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3493313 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4028815 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of facets (and some facets of complexity) / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm to compute circumscription / rank
 
Normal rank
Property / cites work
 
Property / cites work: A logic for default reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5551124 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035685 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4131648 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded Query Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3995235 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circumscriptive semantics for updating knowledge bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deduction in non-Horn databases / rank
 
Normal rank

Latest revision as of 12:10, 17 May 2024

scientific article
Language Label Description Also known as
English
On the complexity of propositional knowledge base revision, updates, and counterfactuals
scientific article

    Statements

    On the complexity of propositional knowledge base revision, updates, and counterfactuals (English)
    0 references
    0 references
    0 references
    17 January 1993
    0 references
    0 references
    0 references
    0 references
    0 references
    updating
    0 references
    revising propositional knowledge bases
    0 references
    minimal change
    0 references
    counterfactual
    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
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references