Annotation theories over finite graphs (Q2269516): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Untersuchungen über das Eliminationsproblem der mathematischen Logik / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4406531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Syntactic codes and grammar refinement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractable reasoning in artificial intelligence / rank
 
Normal rank
Property / cites work
 
Property / cites work: A logical account of formal argumentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411139 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Knowledge representation techniques. A rough set approach. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3126169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing circumscription revisited: A reduction algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4850061 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3543581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Second-order quantifier elimination in higher-order contexts with applications to the semantical analysis of conditionals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Temporal Logics with Reference Pointers and Computation Tree Logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247261 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4329266 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some computational aspects of circumscription / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the satisfiability of 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: Q4250040 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003537 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Knowledge compilation and theory approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Correspondence Between Modal and Classical Logic: an Automated Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal predicates, fixed-points, and definability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete extensions in argumentation coincide with 3-valued stable models in logic programming / rank
 
Normal rank

Revision as of 13:10, 2 July 2024

scientific article
Language Label Description Also known as
English
Annotation theories over finite graphs
scientific article

    Statements

    Annotation theories over finite graphs (English)
    0 references
    0 references
    0 references
    17 March 2010
    0 references
    argumentation theory
    0 references
    labeled graphs
    0 references
    annotations
    0 references
    semantics of logic programs
    0 references
    second-order quantifier elimination
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references