The complexity of propositional closed world reasoning and circumscription (Q1329160): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q55980557, #quickstatements; #temporary_batch_1711504539957
Created claim: DBLP publication ID (P1635): journals/jcss/CadoliL94, #quickstatements; #temporary_batch_1731543907597
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Q4428289 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3750100 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computational complexity of abduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of model checking for circumscriptive formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient method for eliminating varying predicates from a circumscription / 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: Eliminating the fixed predicates from a circumscription / 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: On the Complexity of Timetable and Multicommodity Flow Problems / 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: An algorithm to compute circumscription / rank
 
Normal rank
Property / cites work
 
Property / cites work: A circumscriptive theorem prover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hard problems for simple default logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some computational aspects of circumscription / rank
 
Normal rank
Property / cites work
 
Property / cites work: Why not negation by fixpoint? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closed-world databases and circumscription / 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: Q3939270 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal consequence in sentential logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak generalized closed world assumption / rank
 
Normal rank
Property / cites work
 
Property / cites work: A logic for default reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of diagnosis from first principles / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3200595 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The decision problem for database dependencies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Querying logical databases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deduction in non-Horn databases / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/jcss/CadoliL94 / rank
 
Normal rank

Latest revision as of 01:33, 14 November 2024

scientific article
Language Label Description Also known as
English
The complexity of propositional closed world reasoning and circumscription
scientific article

    Statements

    The complexity of propositional closed world reasoning and circumscription (English)
    0 references
    0 references
    0 references
    13 February 1995
    0 references
    computational complexity
    0 references
    nonmonotonic inheritance
    0 references
    diagnosis
    0 references
    default reasoning
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers