Reasoning under minimal upper bounds in propositional logic (Q861253): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2006.07.054 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2108315311 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q59259664 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385536 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4798018 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reasoning with minimal models: efficient algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: An incremental algorithm for generating all minimal models / rank
 
Normal rank
Property / cites work
 
Property / cites work: How many minimal upper bounds of minimal upper bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal model generation with positive unit hyper-resolution tableaux / 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: Q4506459 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of propositional nested circumscription and nested abnormality theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of propositional closed world reasoning and circumscription / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411139 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4225120 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing circumscription revisited: A reduction algorithm / 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 computational cost of disjunctive logic programming: Propositional case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2767002 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A circumscriptive theorem prover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logics in Artificial Intelligence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of belief update / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4296748 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nested abnormality theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4391449 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3821629 / 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: Q4707748 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing circumscriptive databases / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tableau calculus for minimal model reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inferring negative information from disjunctive databases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding circumscriptive theories in general disjunctive programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The well-founded semantics for general logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic Programming / rank
 
Normal rank

Latest revision as of 12:25, 25 June 2024

scientific article
Language Label Description Also known as
English
Reasoning under minimal upper bounds in propositional logic
scientific article

    Statements

    Reasoning under minimal upper bounds in propositional logic (English)
    0 references
    0 references
    0 references
    9 January 2007
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    artificial intelligence
    0 references
    circumscription
    0 references
    computational complexity
    0 references
    curbing
    0 references
    knowledge representation
    0 references
    minimal models
    0 references
    non-monotonic reasoning
    0 references
    propositional logic
    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